Master of Computer Applications (MCA) Regular Programme Syllabus and Scheme of Examination w.e.f MCA First Year Semester-I.

Pages 27
Views 4
of 27
All materials on our website are shared by users. If you have any questions about copyright issues, please report us to resolve them. We are always happy to assist you.
Description
Master of Computer Applications (MCA) Regular Programme Syllabus and Scheme of Examination w.e.f MCA First Year Semester-I Paper Code Course Course Requirements (Hrs) MCA-101 Mathematical Foundation
Transcript
Master of Computer Applications (MCA) Regular Programme Syllabus and Scheme of Examination w.e.f MCA First Year Semester-I Paper Code Course Course Requirements (Hrs) MCA-101 Mathematical Foundation of Computer Science MCA-102 Computer Fundamentals & Programming in C University Exams Internal Assessment Total MCA-103 Digital Design MCA-104 Internet and Web Designing MCA-105 Object Oriented Programming Using C++ MCA-106 Software Lab i) Programming in C ii) Web Programming Using HTML MCA-107 SoftwareLab i) Programming in C++ ii) Use of MS-Office MCA-108 Soft skills-i Total * Practical Examination of MCA-106 & 107 may be conducted on the same day in 2 sittings each maximum of 4 hours. Semester-II Paper Code Course Course Requirements (Hrs) University Exams Internal Assessment MCA-201 Data Structures Total MCA-202 MCA-203 MCA-204 MCA-205 MCA-206 MCA-207 Computer Organisation & Architecture Computer Based Management System & E- Commerce Data Base Management Systems Principles of System Programming & Compiler Design Software Lab-3 i) Data Structure implementation in C/C++ ii) Programming in 8086/88/80x6 Assembly Software Lab-4 i) Oracle & SQL Prog. ii) System Programming Using C/C MCA-208 Soft skills-ii Total * Practical Examination of MCA-206 & 207 may be conducted on the same day in 2 sittings each maximum of 4 hours. 1 MCA Second Year w.e.f Semester-III Paper Code Course Course Requirements (Hrs) MCA-301 Computer Graphics & Multimedia University Exams Internal Assessment Total MCA-302 Operating Systems MCA-303 Artificial Intelligence & Expert Systems MCA-304 Data Communication & Computer Networks MCA-305 Object Technology MCA-306 MCA-307 SoftwareLab-5 i) Graphics Programming in C/C++. ii)use of MatLab iii)prolog Programming SoftwareLab-6 i) Java Programming Total * Practical Examination of MCA-306 & 307 may be conducted on the same day in 2 sittings each maximum of 4 hours. Semester-IV Paper Code Course Course Requirements (Hrs) University Exams Internal Assessment MCA-401 Advanced Java Programming MCA-402 Data Warehousing & Mining MCA-403 Software Engineering Total MCA-404 Advanced Database Systems MCA-405 MCA-406 MCA-407 Visual Languages Programming SoftwareLab-7 i) Advance Java Programming Software Lab-8 i) Visual Programming Using VB ii) ADS (Working with MS SQL Server) MCA-408 Minor Project-I Total * Practical Examination of MCA-406 & 407 may be conducted on the same day in 2 sittings each maximum of 4 hours. 2 MCA Third Year w.e.f Semester-V Paper Code Course Course Requirements (Hrs) University Exams Internal Assessment MCA-501 Advanced Technology Total MCA-502 Software Testing & Quality Assurance MCA-503 Windows Programming & Visual C++ MCA-504 Elective I * Soft Computing MCA-505 Elective II * Computer Security MCA-506 Software Lab-9 i).net Programming Using C# and/or VB.NET MCA-507 Software Lab-10 i) Windows Programming Using Visual C MCA-508 Minor Project-II Total * Practical Examination of MCA-506 & 507 may be conducted on the same day in 2 sittings each maximum of 4 hours. Semester-VI Paper Code Course Course Requirements (Hrs) University Exams Internal Assessment MCA-601 Major Project Total Grand Total of 3 Years ELECTIVE I * At present only Soft Computing course (MCA-504) is being offered under Elective-I but depending upon the availability of expertise and the required infrastructure determined by the University, any one of the following subjects could be offered in place of Soft Computing. i) Simulation and Modeling ii) Theory of Computation iii) Unix and Network Programming iv) Enterprise Resource Planning v) Object Oriented Analysis and Design vi) Analysis & Design of Algorithms vii) Multimedia and Its Applications viii) Distributed Computing ELECTIVE II * At present only Computer Security course (MCA-505) is being offered under Elective-II but depending upon the availability of expertise and the required infrastructure determined by the University, any one of the following subjects could be offered in place of Computer Security. i) Digital Image Processing ii) Software Project Management iii) Embedded Systems iv) Bio-Informatics v) Mobile Computing vi) Neural Networks vii) Perl Programming 3 Semester I w.e.f MCA-101: MATHEMATICAL FOUNDATION OF COMPUTER SCIENCE Unit I Relation: Relations, Properties of Binary relation, Matrix representation of relations, Closures of relations, Equivalence relations, Partial order relation. Function: Types, Composition of function, Recursively defined function. Algebraic Structures: Properties, Semi group, Monoid, Group, Abelian group, Subgroup, Cyclic group, Cosets, Normal Subgroups, Lagrange s Theorem, Permutation groups. Unit II Propositional Logic: Prepositions, logical operations, Tautologies, Contradictions, Logical implication, Logical equivalence, Normal forms, Theory of Inference and deduction. Predicate Calculus: Predicates and quantifiers. Mathematical Induction. Unit III Lattices and Boolean Algebra: Introduction, Partially Ordered Set, Hasse diagram, Well ordered set, Lattices, Properties of lattices, Bounded lattices, Complemented and Distributive lattices, Boolean Algebra. Unit IV Introduction to defining language, Kleene Closure, Arithmetic expressions, Chomsky Hierarchy, Regular expressions, Generalized Transition graph. Conversion of regular expression to Finite Automata, NFA, DFA, Conversion of NFA to DFA, Optimizing DFA, FA with output: Moore machine, Mealy machine, Conversions. Suggested Readings: 1. C.L.Liu: Elements of Discrete Mathematics, McGraw Hill. 2. Lipschutz, Seymour: Discrete Mathematics, Schaum s Series 3. Babu Ram: Discrete Mathematics, Vinayek Publishers, New Delhi. 4. Trembley, J.P & R. Manohar: Discrete Mathematical Structure with Application to Computer Science, TMH. 5. Kenneth H. Rosen: Discrete Mathematics and its applications, TMH. 6. Doerr Alan & Levasseur Kenneth: Applied Discrete Structures for Computer Science, Galgotia Pub. Pvt. Ltd. 7. Gersting: Mathematical Structure for Computer Science, WH Freeman & Macmillan. 8. Hopcroft J.E, Ullman J.D.: Introduction to Automata theory, Languages and Computation, Narosa Publishing House, New Delhi. 9. Any other book(s) covering the contents of the paper in more depth. 4 MCA-102: COMPUTER FUNDAMENTALS & PROGRAMMING IN C Evolution of information processing: Concept of data and information, data processing. Hardware CPU, Storage Devices & Media, VDU, Input Output, Devices, Type of Software System Software, Application Software. Overview of OS. Programming Languages and its Classification, Compiler, Interpreter, Linker, Loader. Range of Applications: Scientific, business, educational, industrial, weather forecasting, remote sensing, planning, multilingual applications. Social concerns of Computer Technology: Positive and Negative Impacts, Computer Crimes, Viruses and their remedial solutions. Problem Solving: Problem Identification, Analysis, flowcharts, Decision Tables, Pseudo codes and algorithms, Program Coding, Program Testing and Execution. C Programming: Concept of variables and constants, structure of a C program. Operators & Expressions: Arithmetic, Unary, Logical, Bit-wise, Assignment & Conditional Operators, Library Functions, Control Statements : while, do..while, for statements, Nested loops, if..else, switch, break, continue and goto statements, Comma operator. I Functions: Defining & Accessing : Passing arguments, Function Prototype, Recursion, Use of Library Functions, Storage Classes: Automatic, External and Static Variables (Register), Arrays: Defining & Processing, Passing to a function, Multidimensional Arrays. String: Operations of Strings (String handling through built-in & UDF: Length, Compare Concatenate, Reverse, Copy, Character Search using array) Pointers: Declarations, Passing to a function, Operations on Pointers, Pointers & Arrays, Array of Pointer, Pointer Arithmetic, Array accessing through pointers, Pointer to structure, Pointer to functions, Function returning pointers, Dynamic Memory Allocations. V Structures: Defining & Processing, Passing to a function, Unions (Array within structure, Array of structure, Nesting of structure, Passing structure and its pointer to UDF, Introduction to Unions and its Utilities) Data Files: Open, Close, Create, Process Unformatted Data Files. (Formatted Console I/O functions, Unformatted Console I/O functions, Modes Of Files, Use Of fopen(), fclose(), fgetc(), fputc(), fgets(), fprintf(), fscanf(), fread(),fwrite(), Command Line Arguments). 5 Documentation, debugging, C Processors, Macros. Examples illustrating structured program development methodology and use of a block structured algorithmic language to solve specific problems. Suggested Readings 1. Gill Nasib Singh: Computing Fundamentals and Programming in C, Khanna Books Publishing Co., New Delhi. 2. Kenneth.A.: C problem solving and programming, Prentice Hall. 3. Gottfried, B.: Theory and problems of Programming in C, Schaum Series. 4. Gill, Nasib Singh: Essentials of Computer and Network Technology, Khanna Books Publishing Co., New Delhi. 5. Sanders, D.: Computers Today, Tata McGraw-Hill. 6. Rajender Singh Chhillar: Application of IT to Business, Ramesh Publishers, Jaipur. 7. Cooper, Mullish :The spirit of C, An Introduction to Modern Programming, Jaico Publ. House, New Delhi. 8. Kerninghan & Ritchie: The C Programming Language, PHI. 9. Gottfried, B.: Theory and problems of Programming in C, Schaum Series. 10. E. Balaguruswamy: Programming in C, Tata McGraw Hill. 11. H. Schildt: C-The Complete Reference, Tata McGraw Hill. 12. Y. Kanetkar: Let us C, BPB Publication 13. Any other book(s) covering the contents of the paper in more depth. MCA-103: DIGITAL DESIGN Number System: Binary, Octal, Hexadecimal and Decimal, 1 s and 2 s Complements, Interconversion of numbers. Codes: BCD Code, Excess -3 Code, Gray code, Alphanumeric Codes, Parity Bits, Hamming Code, Floating Point Numbers. Binary Arithmetic: Basic Rules of Binary Addition and Subtraction, Addition and Subtraction Using 2 s Complement Method, Binary Multiplicity repeated Left Shift and Add Algorithm, Binary Divison Repeated Right Shift and Subtract Algorithm. Positive and Negative Logic, Truth Tables, Logic Gates, Fan out of Logic Gates, Logic Families, TTL Logic Family, CMOS Logic Family, ECL Logic Family, NMOS and PMOS Logic Families. Boolean Algebra vs. Ordinary Algebra, Boolean Expressions- Variables and Literals, Boolean Expressions Equivalent and Complement, Theorems of Boolean Algebra, Minimisation 6 Techniques, SOPs & POSs Boolean Expressions, Quine- McCluskey Tabular Method, Karnaugh Map Method. I Combinational Circuits, Implementing Combinational Logic, Arithmetic Circuits Basic Building Blocks, Adder- Subtractor, BCD Adder, Magnitude Comparator, Parity Generator and Checker, De-multiplexers and Decoders, Encoders, Read Only Memory (ROM), Programmable Logic Array (PLA). R-S Flip Flop, Level Triggered and Edge Triggered Flip Flops, J.K Flip Flop, Master-slave Flip Flops, T-flip Flop, D-flip Flop, Synchronous and Asynchronous Inputs. V Ripple Counter vs. Synchronous Counter, Modulus of a Counter, Propagation Delay in Ripple Counters, Binary Ripple Counters, Up/Down Counters, Decade and BCD Counters, Pre-settable Counters, Shift Register, Controlled Shift Registers. RAM Architecture, Static RAM (SRAM), Dynamic RAM (DRAM) Suggested Readings 1. Mano, M.M.: Digital Logic and Computer Design, Prentice-Hall of India. 2. Gill, Nasib Singh and Dixit J.B: Digital Design and Computer Organisation, University Science Press (Laxmi Publications), New Delhi. 3. Stallings, William: Computer Organisation & Architecture. 4. Mano, M.M.: Digital Design, Prentice-Hall of India. 5. Anand Kumar: Fundamentals of Digital Circuits, PHI. 6. Tokheim: Digital Electronics, TMH. 7. S. Rangnekar: Digital Electronics, ISTE/EXCE.L 8. Any other book(s) covering the contents of the paper in more depth. MCA 104: INTERNET AND WEB DESIGNING Introduction to Internet, Internet Services, WWW, Working of Internet, Internet Connection Concepts, Introduction to Intranet, DNS working, Configuring Internet Connection, Connecting LAN to Internet. 7 Single User, Multi User, Server, Workstation, Client-Sever environment, Computer Network, Types of Computer Network: LAN, WAN, MAN; Network Topologies. Network Protocols, Windows and GUI. Concepts Configuring Program, Sending and Receiving Files through , Fighting Spam, Sorting Mail, and avoiding viruses. Web Browsers, Search Engines, Categories of Search Engines, Searching Criterion, Surfing the Net, Hypertext Transfer Protocol (HTTP), URL. Other Internet Tools. Online Chatting, Messaging, and Conferencing Concepts, mailing lists, Usenet newsgroup concepts Reading usenet newsgroups, Internet Relay Chat, Instant messaging, Web-Based chat rooms and discussion boards, Voice and Video conferencing. Streamlining Browsing, Keeping track of Favorite Web Sites, Web Security, Privacy, and Site-Blocking. Searching the Web Audio and Video on the Web. I HTML: Internet Language, Understanding HTML, Create a Web Page, Linking to other Web Pages, Publishing HTML Pages, Text Alignment and Lists, Text Formatting Fonts Control, Links and link within a Page, Creating HTML Forms. V Creating Web Page Graphics, Putting Graphics on a Web Page, Custom Backgrounds and Colors, Creating Animated Graphics. Web Page Design and layout, Advanced Layout with Tables, Using Style Sheets. Suggested Readings: 1. Dick Oliver: Tech Yourself HTML 4 in 24 Hours, Techmedia. 2. Satish Jain: O Level Information Technology, 3. Craig Zacker: 10 minutes Guide to HTML Style Sheets, PHI. 4. V.K. Jain: O Level Information Technology, BPB Publications. 5. Gill, Nasib Singh: Essentials of Computer and Network Technology, Khanna Books Publishing Co., New Delhi. 6. Margaret Levine Young: Internet The Complete Reference 7. Harley Hahn: The Internet Complete Reference, TMH. 8. Rajender Singh Chhillar: Application of IT to Business, Ramesh Publishers, Jaipur. 9. Any other book(s) covering the contents of the paper in more depth. MCA-105: OBJECT ORIENTED PROGRAMMING USING C++ 8 questions in all. Question Number 1 will be compulsory. In addition to compulsory question, student will Introduction to object oriented programming, user defined types, polymorphism, and encapsulation. Getting started with C++ - syntax, data-type, variables, strings, functions, exceptions and statements, namespaces and exceptions, operators. Flow control, functions, recursion. Arrays and pointers, structures. Abstraction Mechanisms: Classes, private, public, constructors, destructors, member functions, static members, references etc. Class hierarchy, derived classes. Inheritance: simple inheritance, polymorphism, object slicing, base initialization, virtual functions. I Prototypes, linkages, operator overloading, ambiguity, friends, member operators, operator function, I/O operators etc. Memory management: new, delete, object copying, copy constructors, assignment operator, this Input/output. Exception handling: Exceptions and derived classes, function exception declarations, Unexpected exceptions, Exceptions when handling exceptions, resource capture and release etc. V Templates and Standard Template library: template classes, declaration, template functions, namespaces, string, iterators, hashes, iostreams and other type. Design using C++ design and development, design and programming, role of classes. Suggested Books: 1. Herbert Schildt: C++ - The Complete Reference, Tata McGraw Hill Publications 2. Balaguru Swamy: C++, Tata McGraw Hill Publications. 3. Balaguruswamy: Object Oriented Programming and C++, TMH. 4. Shah & Thakker: Programming in C++, ISTE/EXCEL. 5. Johnston: C++ Programming Today, PHI. 6. Olshevsky: Revolutionary Guide to Object Oriented Programming Using C++, SPD/WROX. 7. Object Oriented Programming and C++, R.Rajaram, New Age International. 8. Samanta: Object Oriented Programming with C++ & JAVA, PHI. 9. Subburaj: Object-Oriented Programming with C++, VIKAS. 10. Any other book(s) covering the contents of the paper in more depth. 9 MCA-201: DATA STRUCTURES Introduction to Algorithm Design and Data Structures: Design and analysis of algorithm: Algorithm definition, comparison of algorithms. Top down and bottom up approaches to Algorithm design. Analysis of Algorithm; Frequency count, Complexity measures in terms of time and space. Structured approach to programming. Arrays: single and multidimensional arrays. Address calculation using column and row major ordering. Various operations on Arrays. Vectors. Application of arrays: Matrix multiplication, Sparse polynomial representation and addition, Stacks and Queues: Representation of stacks and queues using arrays and linked-list. Circular queues, Priority Queue and D-Queue. Applications of stacks: Conversion from infix to postfix and prefix expressions, Evaluation of postfix expression using stacks. I Linked list: Singly linked list; operations on list, Linked stacks and queues. Polynomial representation and manipulation using linked lists. Circular linked lists, Doubly linked lists. Binary tree traversal methods: Preorder, In-order, Post-ordered traversal. Recursive Algorithms. Traversal methods. Representation of trees and its applications: Binary tree representation of a general tree. Conversion of forest into tree. Threaded binary trees. Binary search tree: Height balanced (AVL) tree, B-trees. V Sorting: Selection sort, Insertion sort, Bubble sort, Quick sort, merge sort, Heap sort, Radix sort and their complexity, Searching: Sequential search, Binary Search, Binary Search Tree, ASVL trees, B trees, Searching, sorting and complexity, Searching: Sequential and binary searches, Indexed search, Hashing Schemes. Comparison of time complexity. Graph representation: Adjacency matrix, Adjacency lists, Traversal schemes: Depth first search, Breadth first search. Spanning tree: Definition, Minimal spanning tree algorithms. Shortest Path algorithms (Prim s and Kruskal s). Suggested Readings: 1. Hubbard JR: Schaum s outline of Data Structures with C++, TMH. 10 2. R. Sedgewick: Algorithms in C++, Pearson Education Asia. 3. Y.Langsam, M.J.Augenstein and A.M.Tanenbaum: Data Structures Using C and C++, Prentice Hall of India. 4. R.Kruse, C.L.Tonodo and B.Leung: Data Structures and Program Design in C, Pearson Education. 5. S.Chottopadhyay, D.Ghoshdastidar & M.Chottopadhyay: Data Structures Through C Language, BPB Publication. 6. G.L. Heileman: Data Structutes, Algorithms and Object Oriented Programming, Tata McGraw Hill. 7. E. Horowitz, Sahni and D. Mehta: Fundamentals of Data Structures in C++, Galgotia Publiction. 8. Any other book(s) covering the contents of the paper in more depth. MCA-202: COMPUTER ORGANIZATION & ARCHITECTURE parts(short-answer type questions) covering the entire syllabus and will carry 16 marks. In addition to the Basic organization of the computer and block level description of the functional units as related to the execution of a program. Operational concepts, Bus structures, Von Neumann Concept. Fetch, decode and execute cycle. Role of operating systems and compilers. Basic Processing: Instruction code, Instruction set, Instruction sequencing, Instruction cycle, Instruction format, Addressing modes, Micro instruction, Data path, Hardwired controlled unit, Micro programmed controlled unit. Timing and Control Unit, Micro-operations, Instruction cycle, Design of ALU: Binary arithmetic, Addition and Subtraction of signed number, Multiplication of Positive number, Signed operand multiplication, Division, Floating point number representation and arithmetic. General Register Organization, Stack Organization, Instruction Formats, Addressing Models, Data Transfer and Manipulation, Program control, RISC Vs. CISC architectures. Programming in Assembly Language for 8086/8088/80x6 micro-processor. I Input/Output Organization: Peripheral Devices, Input-output Interface, Asynchronous Data Transfer, Mode of Tra
Advertisements
Related Documents
View more...
We Need Your Support
Thank you for visiting our website and your interest in our free products and services. We are nonprofit website to share and download documents. To the running of this website, we need your help to support us.

Thanks to everyone for your continued support.

No, Thanks
SAVE OUR EARTH

We need your sign to support Project to invent "SMART AND CONTROLLABLE REFLECTIVE BALLOONS" to cover the Sun and Save Our Earth.

More details...

Sign Now!

We are very appreciated for your Prompt Action!

x