Guru Nanak Institute of Technology
Department of Computer Application
Course Structure & Syllabus
of
Master of Computer Application(MCA)
2016
Affiliated to
Maulana Abul Kalam Azad University of Technology
(Formerly known as WBUT)
Guru Nanak Institute of Technology
DepartmentofComputerApplication
Course Curriculam & Syllabus of Masterof ComputerApplication(MCA)Program
FirstSemesterSN / CourseCode / CourseName / ContactHours/Week / Credits
L / T / P / Total
THEORY
1 / MCA101 / ComputerOrganizationArchitecture / 3 / 1 / - / 4 / 4
2 / MCA102 / System Analysis & System Programming / 3 / 1 / - / 4 / 4
3 / MCA103 / ProgrammingwithC / 3 / 1 / - / 4 / 4
4 / MCA104 / DiscreteMathematical StructureGraph Theory / 3 / 1 / - / 4 / 4
5 / HU 101 / BusinessEnglish & Communication / 3 / 1 / - / 4 / 4
PRACTICAL
6 / MCA191 / Computer Architecture & Microprogramming Lab / - / - / 4 / 4 / 3
7 / MCA193 / CLanguage Lab / - / - / 4 / 4 / 3
8 / HU 191 / BusinessEnglish &CommunicationLab / - / - / 4 / 4 / 3
Total / 32 / 29
SecondSemester
SN / CourseCode / CourseName / ContactHours/Week / Credits
L / T / P / Total
THEORY
1 / MCA201 / Data CommunicationComputer Networks / 3 / 1 / - / 4 / 4
2 / MCA202 / Software Engineering & TQM / 3 / 1 / - / 4 / 4
3 / MCA203 / Data StructureAlgorithm / 3 / 1 / - / 4 / 4
4 / MCA204 / Operating System / 3 / 1 / - / 4 / 4
5 / MCA 205 / Statistical & Numerical Methods / 3 / 1 / - / 4 / 4
PRACTICAL
6 / MCA293 / Data StructureAlgorithmLab / - / - / 4 / 4 / 3
7 / MCA294 / Operating System Lab / - / - / 4 / 4 / 3
8 / MCA295 / Statistical & Numerical Computing Lab / - / - / 4 / 4 / 3
SESSIONAL
9 / MCA 280 * / Technical Communication / - / - / - / - / 0
Total / 32 / 29
* Qualifying/Mandatory Paper
ThirdSemesterSN / CourseCode / CourseName / ContactHours/Week / Credits
L / T / P / Total
THEORY
1 / MCA301 / UNIX & Shell Programming / 3 / 1 / - / 4 / 4
2 / MCA302 / Database Management System / 3 / 1 / - / 4 / 4
3 / MCA303 / ObjectOriented ProgrammingUsing C++ / 3 / 1 / - / 4 / 4
4 / MCA304 / Operation Research & Optimization Techniques / 3 / 1 / - / 4 / 4
5 / MBA301 / Management & Accountancy / 3 / 1 / - / 4 / 4
PRACTICAL
6 / MCA 391 / UNIX &ShellProgrammingLab / - / - / 4 / 4 / 3
7 / MCA392 / Database Management System Lab / - / - / 4 / 4 / 3
8 / MCA393 / ObjectOriented ProgrammingUsing C++ Lab / - / - / 4 / 4 / 3
SESSIONAL
MCA 380 * / Technical Seminar / - / - / - / - / 0
Total / 32 / 29
* Qualifying/Mandatory Paper
Fourth SemesterSN / CourseCode / CourseName / ContactHours/Week / Credits
L / T / P / Total
THEORY
1 / MCA401 / Formal Language and Automata Theory / 3 / 1 / - / 4 / 4
2 / MCA402 / Computer Graphics & Multimedia / 3 / 1 / - / 4 / 4
3 / MCA403 / Programming with Java / 3 / 1 / - / 4 / 4
4 / MCA404 / Artificial Intelligence / 3 / 1 / - / 4 / 4
5 / HU 401 / ValuesEthics / 3 / 1 / - / 4 / 4
PRACTICAL
6 / MCA494 / Visual BasicLab / - / - / 8 / 8 / 4
7 / MCA492 / Computer Graphics & Multimedia Lab / - / - / 4 / 4 / 3
8 / MCA493 / Java Lab / - / - / 4 / 4 / 3
Total / 36 / 30
Fifth Semester
SN / CourseCode / CourseName / ContactHours/Week / Credits
L / T / P / Total
THEORY
1 / MCA501 / DistributedSystem / 3 / 1 / - / 4 / 4
2 / MCA E 501 A/B/C / Elective–1 / 3 / 1 / - / 4 / 4
3 / MCA E 502A/B/C / Elective– 2 / 3 / 1 / - / 4 / 4
4 / MCA E 503A/B/C / Elective– 3 / 3 / 1 / - / 4 / 4
5 / MCA E 504A/B/C / Elective– 4 / 3 / 1 / - / 4 / 4
6 / MCA E 592 A/B/C / Elective–2Lab / - / - / 4 / 4 / 3
PRACTICAL
7 / MCA595 / MinorProjectSeminar / - / - / 8 / 8 / 6
8 / MCA 590 / Group Discussion / - / - / - / - / 0
Total / 32 / 29
Sixth Semester
SN / CourseCode / CourseName / ContactHours/Week / Credits
L / T / P / Total
1 / MCA691 / Major Project & Seminar / - / - / 30 / 30 / 30
2 / MCA 692 / Grand Viva / - / - / - / - / 4
Total / 30 / 34
ElectiveCourses
ElectiveNumber / CourseCode / CourseName
1 / MCAE501A / Network SecurityCryptography
MCAE501B / Cloud Computing
MCAE501C / Mobile Computing
2 / MCAE502A / InternetTechnologyThrough.NET Framework
MCAE502B / Advanced Java Technologies
MCAE502C / XML and Databases
3 / MCAE503A / Compiler Design
MCAE503B / Parallel Programming
MCAE503C / Image Processing
4 / MCA E 504 A / E Commerce and Cyber Law
MCA E 504 B / System Administration
MCA E 504 C / Enterprise Resource Planning
Semester / Credits
Semester-I / 29
Semester-II / 29
Semester-III / 29
Semester-IV / 30
Semester-V / 29
Semester-VI / 34
Total / 180
1st Year 1st Semester
THEORY
COMPUTER ORGANIZATION AND ARCHITECTURE (MCA 101)
CONTACTS: 3L + 1T
CREDITS: 4
Data and number representation- binary-complement representation, BCD-ASCII, conversion of numbers from one Number system to the other, (r-1)’s & r’s complement representation.
Weighted and Unweighted Codes – Gray Code, Excess 3 Code, Binary Arithmetic, Floating Point Numbers.
Fundamentals of Boolean Algebra, Logic gates (AND, OR, NOT, XOR, NAND, NOR) MINTERM, MAXTERM, truth table, Boolean expression, simplification, Boolean Algebra, K-map up-to 4 variable, Canonical Forms.
Combination circuits: adders, subtractor, BCD adder, multiplexer, de-multiplexer, encoder, decoder
Sequential circuits: Flip-Flop (SR, JK, D, T, Master-slave), Application of flip-flop-- Asynchronous counter up-to 4 bit, decade counter, mod-n-counter, Synchronous counter—ring counter, Johnson’s count, Up down counter, Register.
Memory organization: Types of memory RAM ROM, EPROM, DRAM, SRAM, Addressing Modes, Associative memory, main memory, virtual memory, secondary memory
I/O: I/O interface, polling, interrupts, DMA, mode of data transfer,
CPU: CPU organization, instruction format, addressing mode, RISC, CISC, Von- Neumann- Architecture
Pipeline & vector processing: Pipeline structure, speedup, efficiency, throughput and bottlenecks. Arithmetic pipeline and Instruction pipeline, .Computer arithmetic: addition, subtraction, multiplication & division. Booth’. Dual core, C2D, I3, I5.
Books:
- Computer System Architecture, Morris Mano, PHI
- Computer Organization, Hamacher, MGH
- Computer Architecture, Carter, Schaum Outline Series, TMH
- System Architecture, Buad, VIKAS
- The Fundamentals of Computer Organization, Raja Rao, Scitech
SYSTEM ANALYSIS & SYSTEM PROGRAMING (MCA 102)
CONTACTS: 3L + 1T
CREDITS: 4
System: Definition, Characteristics, elements and types of system. System Development Life Cycle, Role of system analyst, Initial investigation, Feasibility study -Technical, economic and behavioral feasibility, Cost and Benefit analysis.
System Analysis: Problem Definition, Information requirements, Information gathering tools, Tools of structured Analysis
–Data Flow Diagrams, Data Dictionary, Decision Tree, Decision tables and structured English.
System Programming:
Assembler: macro processor, macros, calls, parameters, expansion, design of two-pass assembler.
Loaders and Linkers: Loading schemes, design of absolute and direct linking loaders.
Books:
- Awad, EM: System Analysis and Design, Galgotia Publications Pvt. Ltd
- Rajib Mall; Fundamentals of Software Engineering; PHI Learning Pvt. Ltd.
- Gane and Sarson: Structured System Analysis and Design.
- Silver, GA, Silver, ML: System Analysis and Design, Addison-Wesley Publishing Co
- Dhamdhere, Systems Programming & Operating Systems, TMH
- Donovan; Systems Programming, TMH
- S. Chattopadhyay, System Software, Prentice-Hall of India, 2007
PROGRAMMING WITH C (MCA 103)
CONTACTS: 3L + 1T
CREDITS: 4
C character set- Delimiters-The C Keywords-Identifiers- Constants-Variables-Rules for DefiningVariables-Data Types-Declaring Variables- Initializing Variables –Type Conversion-Priority of Operators and their Clubbing- Comma and Conditional Operator-Arithmetic Operators-Relational Operators –Logical Operators-Bitwise Operators, Shift operator-Input and Output in C-Formatted and Unformatted Functions -Library Functions.
if statement- if…else – various statement forms of if-nested if -break statement-continue statement –go to statement - switch statement - nested switch statement - for statement -while statement, do-while statement - arrays - working with string and standard functions.
introduction to pointers –pointer declaration –Arithmetic Operations with pointers – pointers and arrays –pointers and two-dimensional arrays –array of pointers –pointers to pointers –pointers and strings –void pointers –function definition and declaration –proto types - types of functions –call by value and reference –functions returning more values –function as an argument –function with operators –function and decision statements –function and loop statements –function with arrays and pointers –recursion –pointer to function – storage classes.
pre-processor directives –structures and unions –command line arguments –dynamic memory allocation.
Books:
1)R. G. Dromey, How to Solve it by Computer, Prentice Hall
2)Byron s Gottfried, Programming with C, Schaum’s Outline series
3)Programming with C, Gottfried, TMH
4)C The Complete Reference, Schildt, TMH
5)Practical C Programming, 3rd Ed, Oualline, SPD/O’ REILLY
6)The C answer Book, Tondo, 2nd Ed, PHI
7)C Programming Made Easy, Raja Ram, SCITECH
8)Projects Using C, Varalaxmi, SCITECH
9)Mastering Algorithms with C, Loudan, SPD/O’REILLY
10) Kanithkar; “Let us C”. BPB publication
DISCRETE MATHEMATICAL STRUCTURE AND GRAPH THEORY (MCA 104)
CONTACTS: 3L + 1T
CREDITS: 4
Mathematical Logic: Statements and Notation, Connectives, Normal Forms, Predicate Calculus.
Sets and Operations on Sets, Relations and Ordering, Posets and Lattices, Functions (Injective, Surjective, Bijective, Inverse), Mathematical Induction.
Counting: Factorial Notation, Binomial Coefficients, Permutation and Combinations, Pigeonhole Principle, Principle of Inclusion-Exclusion.
Generating Functions, Recurrence Relations and its solutions.
Graph Theory: Basic concepts; Complete, Regular and Bipartite Graphs; Subgraphs and Isomorphism; Paths and connectivity; Trees and Planar graphs; Euler and Hamiltonian Graphs; Graph Algorithms.
Books:
- Discrete Mathematics for Computer Scientists & Mathematicians: Mott, Kandel & Baker; PHI
- Discrete Mathematical Structures with Applications to Computer Science: Tremblay & Manohar; TMH
- Elements of Discrete Mathematics: C.L.Liu; TMH
- Discrete Mathematics & Its Applications: Kenneth H Rosen, TMH
- Discrete Mathematics (SCHAUM'S outlines): Lipschutz & Lipson; TMH
BUSINESS ENGLISH AND COMMUNICATION (HU 101)
CONTACTS: 3L + 1T
CREDITS: 4
This should cover general and technical writing, oral communications and listening skills: letter writing, technical report writing, and business communication.
Expression: Practical communication skill development, business presentation with multimedia, speaking skill, prepared speech, extempore speech
Reading skill: comprehension test
Writing: precise, technical/business letter, organization of writing material, poster presentation, writing technical document, preparing software user manual, preparing project documentation.
Books:
- Business Correspondence & Report Writing, Sharma, TMH
- Business Communication Strategies, Monipally, TMH
- English for Technical communication, Laxminarayanan, Scitech
- Business Communication, Kaul, PHI
- Communication Skill for Effective Mgmt., Ghanekar, EPH
PRACTICAL
Computer Architecture and Microprogramming Lab(MCA 191)
Contacts : 4P ,Credits :3
All laboratory assignments are based on Hardware Description Language (VHDL or Verilog) Simulation.
1. HDL introduction
2. Realization of a Boolean Function. Minimize using K map and realize the same using truth table
3. Realize NAND and NOR Gate as universal gate
4. Design Half Adder and Full Adder
5. Design a Full Adder/ Subtractor using 2 half adder/ subtractor
6. Design Half Subtractor and Full Subtractor
7. Design 4 bit parallel Adder Subtrator Composite unit using IC7483 and 7486
8. Design 8:1 Multiplexer using two 4:1 Multiplexer
9. Implement logic function using Multiplexer.
10. 8-bit Addition, Multiplication, Division
11. 8-bit Register design
12. Memory unit design and perform memory operatons.
13. 8-bit simple ALU design
14. 8-bit simple CPU design
15. Interfacing of CPU and Memory
C Programming Lab(MCA 193)
CONTACTS: 4P ,CREDITS: 3
Introduction about the way of programming, Programming to implement input and output statement, sancf(), printf(), Other preliminary function, like getch(), clrscr(),
Control Statement: if, if – else, if – else – else if. switch case.
Loop: for, while, do – while.
Array: single, double, multi dimension array
Teach how to write a programming depending on algorithm.
Business English and Communication Lab(HU 191)
CONTACTS: 4P ,CREDITS: 3
Windows Overview, Office features, Templates and Wizards, MS Word, PowerPoint, Outlook, MS Excel, MS Access. Preparing business presentation with computers using PowerPoint, Developing structured project report with Word and Excel, practicing English and communication skills.
1st Year 2nd Semester
THEORY
DATA COMMUNICATION AND COMPUTER NETWORKS (MCA 201)
CONTACTS: 3L + 1T
CREDITS: 4
Introduction to computer network- Topology; Base Band & Broad Band Topology; Guided & Unguided Media. Overview of Data & Signal Bits. Baud & Bit Rate. Modulation (AM, PM, FM); Multiplexing (TDM, FDM, STDM). Encoding (RZ, NRZ, BIPLOAR, MANCHESTER, DIFF. MANCHESTER). Digital To Analog –ASK, PSK, FSK, QPSK.
Transmission methods –Synchronous & Asynchronous, Flow Control, Error Control, Error Detection methods. Goals of Layered protocols- Introduction to OSI, TCP/IP, IBM, SNA, ATM. Bit oriented (BSC) & Character oriented Protocol (SDLC, LAPB, LAPD, LLC) HDLC- frame format, station, states, configuration, access control. LAN Topology –Ethernet (IEEE 802.3), Token Bus (IEEE 802.4), Token Ring (IEEE 802.5)
Introduction to WAN –DQDB (IEEE 802.6) & FDDI. Switching Technologies –Circuit, Message, and Packet. X.25, X.21, RS-232 C –frame format, channel, packet frames, facilities (In brief only). ISDN- D channel, B-Channel
Introduction to leased lines, DSL, Digital Carriers. Bridging & Routing –Static & Dynamic (In Brief).
IP, IP addressing, ICMP, Congestion Control, TCP, UDP. HTTP, FTP, Telnet, SMTP.
Introduction to data security (private key, public key, ISO standards).
Introduction to Mobile technology (Topology, FDM, TDM, CDMA), Satellite Communication (LEO, GEO, TDM).
Books:
- Data Communication & Networking, Forouzan, TMH
- Computer Networks, Tannenbaum, PHI
- Data & Computer Communications, Stallings, PHI
- Communication Networks, Walrand, TMH
- Computer Communication Networks, Shanmugam & Rajeev, ISTE/EXCEL
- Data Communications, Prakash C. Gupta, PHI
- Computer Networking, Tittel, Schaum Outline Series, TMH
- Data & Network Communications, Miller, VIKAS
SOFTWARE ENGINEERING AND TQM (MCA 202)
CONTACTS: 3L + 1T
CREDITS: 4
Introduction to Software Engineering: Introduction, Overview & Definition of Software Engineering; Phases of Software Development, Software Development Life Cycle Models; Requirements determination, SRS; Decision Tree & Decision Table.
Software Project Management: Introduction, Overview & Definition of Project Management; Project Scheduling, Staffing, Gantt chart, PERT Chart, Critical Path Evaluation; Software Metrics –LOC, FP; Cost benefit analysis –COCOMO I & II, Software Configuration Management, Project Monitoring.
Software Design: Information requirement analysis, structured system design, Process modeling with physical and logical DFD, Data modeling with ERD, Data Dictionary; Modular Design –Cohesion and Coupling.
Object Oriented Analysis & Design: Introduction to Object Oriented Analysis & Design, object modeling, functional modeling, dynamic modeling, Class diagram, State transition diagrams, Collaboration diagrams; Introduction to UML; Use Case Diagrams, Collaboration Diagrams.
Coding & Testing: Coding Standard & guidelines; introduction to software testing, Levels of Testing, Unit testing, Integration testing, System testing, User acceptance & Beta testing, Regression testing, Test planning.
Quality Assurance, Project Monitoring: Software Quality Concepts, Quality Assurance Vs Quality control, reviews, walkthroughs, and inspection, Concepts of six sigma in quality, ISO Approach and SEI-CMM Levels.
Risk Analysis: Identification of Risk, Projection, Refinement, Monitoring & Management of Risk.
Software Maintenance: Software maintenance, Software Complexity & Reliability.
CASE Tools: Case Tools Concepts, use and application.
Books:
- Software Engineering Approach; Roger S. Pressman; Practitioner’s McGraw-Hill Higher Education App.
- Fundamentals of Software Engineering; Rajib Mall; PHI Learning Pvt. Ltd.
- Software Engineering; K. K. Aggarwal & Yogesh Singh; New Age International
- Object-oriented and classical software engineering; Stephen R. Schach; McGraw-Hill Higher Education
- Total Quality Management; Jagdeep Kairon; Everest Publishing House
- An Integrated Approach to Software Engineering,Third Edition; Pankaj Jalote; Narosa Publishing House
DATA STRUCTURE AND ALGORITHM (MCA 203)
CONTACTS: 3L + 1T
CREDITS: 4
Algorithm concept, Complexity –Big O- Notation, time space trade-off. Array- Row/Column major representation, sparse matrix. Linked List- Singly, circular, doubly, doubly & circular Stack- Push, Pop, Conversion from infix –to postfix, evaluation of postfix expression. Stack representation using array & linked list.
Queue –insert, delete, representation using array & linked list, circular queue (operations), deque (operations), priority queue (operations)-Both iterative & recursive implementation.
Garbage collection-different techniques. Tree- definition –traversal algorithms (pre, post, in).
Threaded tree (One Way & Two Way), heap tree, AVL tree-balancing, B-tree, B+ tree
Binary search tree, Huffman algorithm, Creation of Heap. Sorting with complexity analysis –bubble, merge, quick, selection, insertion, shell, tournament, radix, heap.
Search- Linear & Binary (Complexity Analysis). Recursion Technique- overview including tail recursion.
Hashing- definition. Functions- Midsquare, Folding, remainder, Collision resolution & linear probing.
Overview On –file management, hash file.
Books:
1. Fundamentals of Data Structures in C, E. Horowitz, Satraj Sahni and Susan Anderson, W. H. Freeman and Company
2. Data Structure Using C & C++, Tannenbaum, PHI
3. Data Structures & Program Design in C, 2nd Ed, Kruse, Tondo & Leung, PHI
4. Mastering Algorithms with C. Loudon, SPD/O’REILLY
5. Data Structures and Algorithm, R. S. Salaria, Khanna Publishing
OPERATING SYSTEM (MCA 204)
CONTACTS: 3L + 1T
CREDITS: 4
Importance of OS, Basic concepts and terminology, types of OS, different views, journey of a command execution, design and implementation of OS.
Process: Concept and views, OS view of processes, OS services for process management, scheduling algorithms, performance evaluation; Interprocess communication and synchronization, mutual exclusion, semaphores, hardware support for mutual exclusion, queuing implementation of semaphores, classical problem of concurrent programming, critical region and conditional critical region, monitors, messages, deadlocks.
Resource manager, file management, processor management, device management, Memory management –paging, swapping, page replacement algorithm, design issues for paging system, segmentation, Scheduling algorithm and performance evaluation. Security and protection, policies and mechanism, authentication, protection and access control, formal models of protection, cryptography, worms and viruses.
In-process communication & synchronization, File systems, security and protection mechanism, Input/output systems, processes and processors in distributed system Performance measurement, monitoring and evaluation .
Multiprocessor system, classification and types, OS functions and requirements, introduction to parallel computing, multiprocessor interconnection synchronization. Distributes OS - rationales, algorithms for distributed processing.
OS services and kernel, Multiprogramming and time sharing, Processor scheduling. Performance measurement and monitoring –measures, evaluation techniques, bottlenecks and saturation, feedback loops.
Introduction to UNIX and Shell Programming
Books:
1. Operating Systems, Galvin & Silverschatz, John Wiley
2. Modern Operating System, 2nd Ed, Tannenbaum, PHI
3. Systems Programming & Operating Systems, Dhamdhere, TMH
4. Systems Programming, Donovan, TMH
5. UNIX and Shell Programming, Yashavant P. Kanetkar, BPB Publications
STATISTICAL AND NUMERICAL METHODS (MCA 205)
CONTACTS: 3L + 1T
CREDITS: 4
Basic Statistics - Measures of Central Tendency, Measures of Dispersion, Correlation and Regression, Theory of Probability, Theoretical Distributions - Binomial, Poisson and Normal distributions.
Approximations and Errors in Computing, Error propagation.
Roots of Nonlinear equations: Concept of root, Methods of solution –Bisection method, False Position method, Newton-Raphson method, Secant method and Fixed-Point method.
Solution of a system of Linear Equations: Basic Gauss Elimination method, Gauss Elimination with Pivoting, Gauss-Jordan method, Matrix Inversion method, LU factorization method, Jacobi method, Gauss-Seidel method.
Interpolation: Basic concepts, Lagrange Interpolation, Newton's Divided Difference Interpolation, Interpolation with equidistant points –Gregory-Newton Forward difference and Backward difference formula. Inverse Interpolation.
Numerical Integration: Newton-Cotes methods –Trapezoidal rule, Simpson’s 1/3 rule, Sim Weddel’s Rule.
Numerical Solution of Ordinary Differential Equations: Taylor Series method, Euler's method, Modified Euler's method, Runge-Kutta method.
Books:
- Statistics (Schaum's outlines): M.R. Spiegel and L.J. Stephens; TMH
- Statistical Measures: N.G. Das (Part I & II)
- Probability, Statistics and Random Processes: T Veerarajan; TMH
- Numerical Methods: E Balagurusamy; TMH
- Numerical Analysis (Schaum's outlines): F Scheid; McGraw-Hill
- Introductory Methods of Numerical Analysis: S.S. Sastry; PHI
- Numerical Methods and Statistical Techniques Using 'C': Manish Goyal; Laxmi Publications (P) Ltd
- An Introduction to Numerical Analysis: Dutta & Jana; Shreedhar Prakashani, Calcutta
PRACTICAL