Scheme of examination for master of computer applications (M. C. A.)

Objectives: The objective of this course is to provide the in-depth coverage of various concepts of computer graphics. The students will be able to understand and use computer graphics in real-world.
Learning Outcomes: At the end of this course students should be able to:

• 
  Gain knowledge about graphics hardware devices and software used.
  
• 
  Understand two dimensional and three dimensional creation and manipulation of pictures/objects.
  
• 
  Understand various input techniques and animation techniques used in graphics.
  

UNIT – I

Introduction to Computer Graphics and its applications, Components and working of Interactive Graphics;

Video Display Devices: Raster scan and Random Scan displays, Display Processors; Resolution, Aspect Ratio, Refresh CRT, interlacing; Color CRT monitors, LookUp tables, Plasma Panel and LCD monitors, Interactive Input and Output Devices: keyboard, mouse, trackball, joystick, light pen, digitizers; image scanners, Touch Panels; Voice systems; printers, plotters; Graphics Software; Coordinate Representations;

UNIT – II

Drawing Geometry: Symmetrical and Simple DDA line drawing algorithm, Bresenham’s line Algorithm; loading frame buffer; Symmetrical DDA for drawing circle, Polynomial method for circle drawing; circle drawing using polar coordinates, Bresenham’s circle drawing; Generation of ellipse; parametric representation of cubic curves, drawing Bezier curves;

Filled-Area Primitives: Flood fill algorithm, Boundary fill algorithm, Scan-line polygon fill algorithm

UNIT – III

2-D Transformations: translation, rotation, scaling, matrix representations and homogeneous coordinates, composite transformations, general pivot point rotation, general fixed point scaling, Shearing; Reflection ; Reflection about an arbitrary line;

2-D Viewing: window, viewport; 2-D viewing transformation, zooming, panning; Clipping operations: point and line clipping, Cohen-Sutherland line clipping, mid-point subdivision line clipping, Liang-Barsky line clipping, Sutherland-Hodgman polygon clipping; Weiler-Atherton polygon Clipping

Pointing and positioning techniques; rubber band technique; dragging;

UNIT – IV

3-D Graphics: 3-D modeling of objects, 3D transformation matrices for translation, scaling and rotation, parallel projection: Orthographic and oblique projection; perspective projection; Hidden surface removal: Z-buffer, depth-sorting, area subdivision, BSP-Tree method; Ray casting; Shading: Modelling light intensities, Gouraud shading, Phong shading; Introduction to Animation, Tweening, Morphing, Fractals;

Text Books:

1. Donald Hearn, M. Pauline Baker, Computer Graphics, Pearson Education.

2. Foley etc., Computer Graphics Principles & Practice, Pearson Education.

Reference Books:

1. 
   D.P. Mukherjee, Fundamentals of Computer Graphics and Multimedia, PHI.
   
2. 
   Newmann & Sproull, Principles of Interactive Computer Graphics, McGraw Hill.
   
3. 
   Rogers, Procedural Elements of Computer Graphics, McGraw Hill.
   
4. 
   Anirban Mukhopadhyay, Arup Chattopadhyay, Introduction to Computer Graphics and Multimedia, Vikas Publications.
   
5. 
   Zhigang Xiang, Roy Plastock, Computer Graphics, Tata McGraw Hill.
   
6. 
   Malay K. Pakhira, Computer Graphics, Multimedia and Animation, PHI
   

MCA-16-45 LINUX AND SHELL PROGRAMMING

Maximum marks: 100 (External: 75, Internal: 25) Time: 3 hours Credits: 4

Note: Examiner will be required to set NINE questions in all. Question Number 1 will consist of objective type/short-answer type questions covering the entire syllabus. In addition to question no. 1, the examiner is required to set eight more questions selecting two from each unit. Student will be required to attempt FIVE questions in all. Question Number 1 will be compulsory. In addition to compulsory question, student will have to attempt four more questions selecting one question from each Unit. All questions will carry equal marks.

Objectives: The objectives of this course is to provide the in-depth coverage of various concepts of Linux. Linux administration is an essential course for the students.
Learning Outcomes: At the end of this course students should be able to:

• 
  Install and understand the basic concepts of Linux administration.
  
• 
  Understand the C environment under Linux.
  
• 
  Understand the user management and security concepts in Linux.
  
• 
  Appreciate and use shell programming in Linux.
  

UNIT – I

Introduction: Basic features, architecture, distributions, Installation requirements; Kernel, Shell.

File System: boot block, super block, inode table, data blocks, accessing files, storage of files, standard directories, system calls for files, file and disk related commands, hard disk partitions; Installing Linux OS, System startup and shut down processes, init and run levels, rc and init files.
UNIT – II

C language compiler, layout of C program in memory, process environment, kernel support, process images, managing zombie and orphan processes, use of makefiles, dependency calculations, dynamic loader, debugging with gdb.

UNIT – III

User Management: Adding new users and groups, super users, creating and mounting file systems. User management commands.

Security and Connections: viewing and changing the permissions and ownerships of files and directories, creating networks, Signal generation and handling, Environment variables, Commands: man, chmod, fchmod, chown, lchown, ping, ifconfig, raise, alarm, pause, abort etc.
UNIT – IV

Shell: meaning, types; connecting processes with pipes, tee, redirect input and output, background processes, managing multiple processes, changing priority, scheduling of processes at command, process related commands.

Shell Programming: Introduction, shell programming in various shells, file name substitution, read command, operators, conditional statements, looping and case statements, expr statement, command line arguments, parameter passing and arguments, associative arrays, string and mathematical functions, arrays and functions, libraries, shell variables, shell programs to automate system tasks, interrupt processing, shell scripts for administrators, debugging shell scripts, introduction to egrep.
Text Books:

1. Matthew Neil, Stones Richjard, “Beginning Linux Programming”, 4th Ed., Wiley India Pvt. Ltd.

2. John Goerzen, “Linux Programming Bible”, IDG Books, New Delhi.
Reference Books:

1. Negus Christopher, “Linux Bible”, 8th Ed., Wiley India Pvt. Ltd.

2. Petersen Richard, “Linux: The Complete Reference”, 6th Ed., Tata Mcgraw Hill.

3. Venkateshmurthy M.G., “Introduction to Unix & Shell Programming”, Pearson Education.

MCA-16–48 SEMInar
Maximum marks: 50 Time: 1/2 hours CREDITS: 1
Seminar

Each student shall individually prepare and submit a seminar report within stipulated time. A panel consisting of two teachers (internal) should evaluate the seminar report and the presentation. Marks should be distributed considering report writing, presentation, technical content, depth of knowledge, brevity and references and their participation in seminar. The time allotted for presentation will be 30 minutes.

MCA – 16-51 ADVANCED WEB TECHNOLOGIES

Maximum marks: 100 (External: 75, Internal: 25) Time: 3 hours Credits: 4

Note: Examiner will be required to set NINE questions in all. Question Number 1 will consist of objective type/short-answer type questions covering the entire syllabus. In addition to question no. 1, the examiner is required to set eight more questions selecting two from each unit. Student will be required to attempt FIVE questions in all. Question Number 1 will be compulsory. In addition to compulsory question, student will have to attempt four more questions selecting one question from each Unit. All questions will carry equal marks.
Objectives: The objective of this course is to provide the coverage of advanced technologies used in the

design and development of web based applications such as PHP/Java Script/JSP for client-side and server-side programming.

Learning Outcomes: At the end of this course students should be able to:

• 
  Design web sites for various requirements.
  
• 
  Design web applications using both client and server side programming.
  
• 
  Understand the basic concepts of cyber forensics.
  

UNIT – I

Introduction: Conceptual architectural of web browsers and its functions, web optimizations; Search Engine Optimization, merge multiple JavaScript into one, Static page design; designing static web pages with HTML5.0-HTML basic, multimedia, Graphics, Form tags, CSS 2.0 concept and its properties & CSS 3.0 properties i.e. borders, backgrounds, fonts, text effects, animations.

UNIT-II

Introduction to PHP: features of PHP, control structures, arrays, functions, introduction to WAMP and XAMPP servers, MYSQL quires, connectivity with MYSQL, upload images, audios, videos in MYSQL, cookies and sessions in PHP with its all features.

Java Script: Concept of JavaScript, use of functions, objects and events of JavaScript in website, form validation in Java Script.

UNIT-III

Basics of Servlet; Servlet API, GenericServlet, HttpServlet, Servlet Life Cycle, ServletRequest methods, Registration example with DB, ServletConfig methods, ServletConfig example, ServletContext methods, ServletContext example.

Java Server Pages: Basics of JSP; Life cycle of JSP, Scripting elements; scriptlet tag, expression tag, declaration tag, Implicit Objects; out, request, response, config, application, session, pageContext, page exception.

UNIT – IV

Introduction to Cyber forensics: Information Security Investigations, Corporate Cyber Forensics, Scientific method in forensic analysis. Ethical Hacking: Essential Terminology, Windows Hacking, Malware, Scanning, Cracking. Digital Evidence in Criminal Investigations: The Analog and Digital World, Training and Education in digital evidence.

Reference Books:

1. 
   Edward Amoroso, "Fundamentals of Computer Security Technology", Prentice-Hall, 1999
   
2. 
   Charles P. Pleeger, “Security in Computing”, Pearson Education, 5th Edition, 2001.
   
3. 
   John R. Vacca, Computer Forensics: Computer Crime Scene Investigation, 2nd Edition, Charles River Media, 2005
   
4. 
   Ali Jahangiri, Live Hacking: The Ultimate Guide to Hacking Techniques & Countermeasures for Ethical Hackers & IT Security Experts, Ali Jahangiri, 2009
   

MCA-16-52 HIGH PERFORMANCE NETWORKS

Maximum marks: 100 (External: 75, Internal: 25) Time: 3 hours Credits: 4

Note: Examiner will be required to set NINE questions in all. Question Number 1 will consist of objective type/short-answer type questions covering the entire syllabus. In addition to question no. 1, the examiner is required to set eight more questions selecting two from each unit. Student will be required to attempt FIVE questions in all. Question Number 1 will be compulsory. In addition to compulsory question, student will have to attempt four more questions selecting one question from each Unit. All questions will carry equal marks.

Objectives: The objective of this course is to provide the in-depth coverage of high-performance networks used in wired and wireless environment.
Learning Outcomes: At the end of this course students should be able to:

• 
  Understand the basic performance of high-speed networks.
  
• 
  Understand the details of TCP/IP model and its protocols.
  
• 
  Understand about the provisions of quality of services in networks.
  

UNIT – I

Brief Networking History: Growth of Internet; The need for speed and Quality of Service; ISPs and Backbone Networks; Wired networks: Telephone Networks; Cable Networks; Connecting devices and Virtual LANs; High-Speed Networks: Frame Relay Networks; Design goals and architecture of SONET and ATM; TCP/IP protocol architecture;

UNIT – II

Internet Protocol (IP); IPv4 addresses; fragmentation; Type of Service; Datagram format; Classful and classless addressing; DHCP; NAT; CIDR; IPv6 and its comparison with IPv4; Format and Headers of IPv6; traffic class, flow label, IPv6 addresses; ICMP; Mobile IP; Address mapping: Address Resolution Protocol (ARP), Reverse Address Resolution Protocol (RARP); Multicasting: IGMP;

UNIT – III

TCP/IP applications; Client/Server paradigm; Peer-to-Peer Paradigm; Transport layer services; Port numbers; Transport layer protocols; TCP connection; TCP flow and congestion control; UDP services and applications; SCTP.

Interior and Exterior routing protocols; Autonomous Systems; RIP; OSPF; BGP; Introduction to Mobile Adhoc networks and its routing protocols.

UNIT – IV

Standard Client-Server protocols: WWW and HTTP; FTP; E-Mail architecture; TELNET.

Client-server programming: Introduction to Sockets; Socket Descriptors; Ports and Connection

Quality of Service in IP Networks: Data flow characteristics; Integrated and Differentiated Services; Multiprotocol Label Switching; Real-Time Transport Protocol.
Text Books:

1. 
   William Stallings, “High-Speed Networks and Internets, Performance and Quality of Service”.
   
2. 
   Behrouz A. Forouzan, “Data Communications and Networking”, Fourth Edition, McGraw Hill.
   
3. 
   B Muthukumaran, “Introduction to High Performance Networks”, Mcgraw-Hill
   

Reference Books:

1. 
   Douglas E. Comer, “Internetworking with TCP/IP Volume – I, Principles, Protocols, and Architectures”, Fourth Edition, Pearson Education.
   
2. 
   Mahbub Hassan, Raj Jain, “High Performance TCP/IP Networking, Concepts, Issues, and Solutions”, Pearson Education.
   
3. 
   James F. Kurose, Keith W. Ross, “Computer Networking, A Top-Down Approach Featuring the Internet”, Pearson Education.
   
4. 
   Andrew S. Tanenbaum, “Computer Networks”, 4th Edition, PHI.
   

MCA-16-53 MOBILE APPLICATION DEVELOPMENT

Maximum marks: 100 (External: 75, Internal: 25) Time: 3 hours Credits: 4

Note: Examiner will be required to set NINE questions in all. Question Number 1 will consist of objective type/short-answer type questions covering the entire syllabus. In addition to question no. 1, the examiner is required to set eight more questions selecting two from each unit. Student will be required to attempt FIVE questions in all. Question Number 1 will be compulsory. In addition to compulsory question, student will have to attempt four more questions selecting one question from each Unit. All questions will carry equal marks.

Objectives: The objective of this course is to provide the in-depth coverage of various concepts of mobile application development especially android based applications. This course will help the students in learning to develop and publish their own mobile applications.

Learning Outcomes: At the end of this course students should be able to:

• 
  Understand the basic concepts of mobile application development.
  
• 
  Design and publish the android applications.
  
• 
  Understand the basic concepts of cross-platform application development.
  

UNIT – I

Introduction: Mobile Applications, Characteristics and Benefits, Application Models, Mobile devices Profiles. Basics of Android, Importance and scope, Android Architecture, Android Stack, Android Applications Structure, Android Emulator, Android SDK, Overview of Android Studio, Android and File Structure, Android Virtual Device Manager, DDMS, LogCat

Application Design: Memory Management, Design patterns for limited memory, Work flow for Application Development, Techniques for composing Applications, Dynamic Linking, Plug-ins and rules of thumb for using DLLs, Concurrency and Resource Management.

UNIT-II

Google Android: Activities, Intents, Tasks, Services; Callbacks and Override in application, Concurrency, Serialization, Application Signing, API keys for Google Maps.

Android Framework: Fragments and Multi-platform development, Creating Widgets: Layouts, Canvas Drawing, Shadows, Gradients; Applications with multiple screens; Handling database in Android: Android Database class, Using the Database API, Working with Data Storage: Shared preferences, Preferences activity, Files access, SQLite database

UNIT-III

Android Applications: Various life cycles for applications, Building a User Interface: Blank UI, Folding and Unfolding a scalable UI, Making Activity, Fragment, Multiple layouts; Content Provider, Location and Mapping: location based services, Mapping, Google Maps activity, Working with MapView and MapActivity; Playing and Recording of Audio and Video in application; Sensors and Near Field Communication; Native libraries and headers, Building client server applications.

UNIT-IV

Preparing for publishing, Signing and preparing the graphics, Publishing to the Android Market

Other Platforms: Apple iPhone Platform, Introduction to iPhone OS and iOS, UI tool kit interfaces, Event handling and Graphics services, Layer Animation. Overview of Cross-platform application development.
Reference Books:

1. 
   Zigurd Mednieks, Laird Dornin, G,Blake Meike and Masumi Nakamura “Programming Android”, O’Reilly Publications.
   
2. 
   Pradeep Kothari, “Android Application Development: Black Book”, Wiley India Ltd.
   
3. 
   Wei-Meng Lee, “Beginning iPhone SDK Progrmming with Objective-C”, Wiley India Ltd.
   
4. 
   James C.S. “Android Application development”, CENGAGE Learning.
   
5. 
   Gargenta M., Nakamura M., “Learning Android”, O’Reilly Publications.
   

MCA-16-54(I) artificial intelligence

Maximum marks: 100 (External: 75, Internal: 25) Time: 3 hours Credits: 4

Note: Examiner will be required to set NINE questions in all. Question Number 1 will consist of objective type/short-answer type questions covering the entire syllabus. In addition to question no. 1, the examiner is required to set eight more questions selecting two from each unit. Student will be required to attempt FIVE questions in all. Question Number 1 will be compulsory. In addition to compulsory question, student will have to attempt four more questions selecting one question from each Unit. All questions will carry equal marks.

Objectives: The objective of this course is to provide the in-depth coverage of artificial intelligence techniques and their applications. It focuses on various search techniques and expert systems along with other parts of artificial intelligence in computer science.
Learning Outcomes: At the end of this course students should be able to:

• 
  Understand the difference between problems and Artificial Intelligence problems.
  
• 
  Apply various search methods to solve AI problems efficiently.
  
• 
  Design expert systems along with natural language processing techniques
  

UNIT-I

Introduction: Background and history, Overview of AI applications areas.

The predicate calculus: Syntax and semantic for propositional logic and FOPL, Clausal form, inference rules, resolution and unification.

Knowledge representation: Network representation-Associative network & conceptual graphs, Structured representation- Frames & Scripts.

UNIT-II

Search strategies: Strategies for state space search-data driven and goal driven search; Search algorithms- uninformed search (depth first, breadth first, depth first with iterative deepening) and informed search (Hill climbing, best first, A* algorithm, mini-max etc.), computational complexity, Properties of search algorithms - Admissibility, Monotonicity, Optimality, Dominance.

UNIT-III

Production system: Types of production system-commutative and non-commutative production systems, Decomposable and non-decomposable production systems, Control of search in production systems.

Rule based expert systems: Architecture, development, managing uncertainty in expert systems - Bayesian probability theory, Stanford certainty factor algebra, Nonmonotonic logic and reasoning with beliefs, Fuzzy logic, Dempster/Shaffer and other approaches to uncertainty.
UNIT-IV

Knowledge acquisition: Types of learning, learning by automata, genetic algorithms, intelligent editors, learning by induction.

Natural Language Processing (NLP): Problems in understanding natural languages, Different stages of language analysis, Chomsky Hierarchy of formal languages, Transition network parsers (TNP), Augmented Transition Network Parsers (ATNP).
Text Books:

1. 
   George F. Luger, Artificial Intelligence, Pearson Education.
   
2. 
   Dan W. Patterson Introduction to Artificial Intelligence and Expert system, PHI.
   

Reference Books:

1. 
   Ben Coppin, Artificial Intelligence Illuminated, Narosa Publishing House.
   
2. 
   Eugene Charniak, Drew McDermott Introduction to Artificial Intelligence, Pearson Education.
   
3. 
   Nils J. Nilsson Principles of Artificial Intelligence, Narosa Publishing House.
   
4. 
   Jackson Peter, Introduction to Expert systems, 3rd ed., Pearson-Education.
   

MCA-16-54(II) SECURITY IN COMPUTING

Maximum marks: 100 (External: 75, Internal: 25) Time: 3 hours Credits: 4

Note: Examiner will be required to set NINE questions in all. Question Number 1 will consist of objective type/short-answer type questions covering the entire syllabus. In addition to question no. 1, the examiner is required to set eight more questions selecting two from each unit. Student will be required to attempt FIVE questions in all. Question Number 1 will be compulsory. In addition to compulsory question, student will have to attempt four more questions selecting one question from each Unit. All questions will carry equal marks.

Objectives: The objective of this course is to provide the coverage of various security parameters and vulnerabilities. This course enables the students to handle various security issues in real-world.
Learning Outcomes: At the end of this course students should be able to:

• 
  Evaluate the risks and vulnerabilities .
  
• 
  Design and security analysis of various systems.
  
• 
  Understand the concepts of confidentiality, availability and integrity and analyze these factors in an existing system.
  

UNIT – I

Computer Security Concepts, Threats, Attacks and Assets, Security Functional Requirements, Security

Architecture and Scope of Computer Security, Computer Security Trends and Strategies. Cryptography: Terminology and Background, Substitution Ciphers, Transpositions, Cryptanalysis,

Program Security: Secure Program, Non-malicious Program Error, Viruses and other Malicious Code, Targeted Malicious Code, Control against Program Threats.

UNIT – II

Database Security: Database Management System, Relational Databases, Database Access Control, Inference, Security Requirements, Reliability and Integrity, Sensitive Data, Database Encryption.

Network Security: Threats in Network, Network Security Controls, Firewall- Need for firewall, Characteristics, Types of firewall, Firewall Basing, Intrusion Detection System- Types, Goals of IDS, IDS strengths and Limitations.