0% found this document useful (0 votes)
53 views

Updated - MCA Syllabus 2020-21

Hi

Uploaded by

ANIL KUMAR S v
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
0% found this document useful (0 votes)
53 views

Updated - MCA Syllabus 2020-21

Hi

Uploaded by

ANIL KUMAR S v
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 52
BENGALURU CITY UNIVERSITY SYLLABUS FOR MASTER OF COMPUTER APPLICATIONS (MCA) (I to IV Semesters) CHOICE BASED CREDIT SYSTEM (SEMESTER SCHEME) 2020-2021 onwards a Proceedings of the BOS (Computer Science) meetin; Department of MCA/Bengaluru City University. . Bengaluru - 560001 ‘The BOS meeting of Computer Science was held on Circulation with the following members Members Present: |. Dr.D § Guru , Professor, University of Mysore, Mysore, DrM.T Somashekar, Assistant Professor, Bangalore University, Bangalore DrRegina L Suganthi, HOD, Mount Carmel College, Bangalore Dr-Prashanthi B G, HOD, St.Joseph College, Bangalore Mrs.Priya, Govt Degree College, K R Puram, Bangalore MrSumanth, Maharanis Home Science College; Bangalore. Dr-Hanumanthappa M, Chairman, BOS, Bengaluru City University, Bangalore ‘The agenda for the meetings was to approve the syllabus of MCA two years course as per the AICTE norms and to evaluate the syllabus based on the views from an industry expert and academician. The Committee felt that, as all the members of Bangalore University and Bengaluru City University are same, also to maintain the uniformity it is better to have the same Syllabus for both the universities. So the same dyllabus is approved for Bengaluru City University also. The detailed syllabus and concept note is enclosed along with this letter. hin (Dr-Hanumanthappa M) Chairman(BOS), Bengaluru City University, Bangalore. Or. M. HANUMANTHAPPR FEA MPH, PO, — ‘BANGALORE -San ARR BENGALURU CITY UNIVERSITY REGULATIONS, SCHEME AND SYLLABUS For the course MASTER OF COMPUTER APPLICATIONS (MCA) I to IV Semesters = cheme) Revised w.e.f. Academic Year 2020-21 and onwards MCA PROGRAMME CENTRAL COLLEGE CAMPUS BENGALURU UNIVESITY, BANGALORE O BENGALURU CITY UNIVERSITY PROPOSED NEW SYLLABUS FOR MCA FROM THE ACADEMIC YEAR 2020-21 ‘The AICTE (All India Council for Technical Education), the governing body for the MCA. course, has decided to reduce the course work of MCA course from three years to two years. Accordingly, every University which runs the course has to frame syllabus for MCA course for two years. The new syllabus has to come into force from the Academic year 2020-21 From the point of view of the students, we keep the following two objectives while framing the syllabus: 1. To make the MCA graduates industry ready 2. To enable the MCA graduates to appear for NET (National Eligibility Test) Examination for Lectureship, and JRF (Junior Research Fellowship) without any hardship We can have 12 Core courses of Computer Science in the first two semesters of the MCA course. The first two semester of the course can be equipped with two Lab Courses, We propose a novel specialization in the form of verticals in the third semester. These verticals intent to enable the students to acquire a specialized technical skill which is contemporary with the industry standard. The vertical can be in the area of Java, NET, Database, and Business Intelligence and Data Analytics. Bach of these Verticals can have four courses in that specialization and a mini project in the specialized area. The third semester also consists of two open elective papers to be chosen from other department, one from Science Department and the other from Social Science, or Humanities, The Final Semester will be a full time industry/research internship. All the courses will be of equal weightage with 3 credits, Lab courses with 2 Credits, Mini Project with 4 credits, and the Final Semester internship with 12 credits. The overall credits the student earn would be 78 credits, which is in line with the generally acceptable University standards. The weightage for the University and contagious internal assessment will be according to the University guidelines which is of the ratio 80:20. Keeping in mind the above facts, the following syllabus structure is proposed for discussion: Semester I 1. ‘The Art of Programming 2. Discrete Mathematics 3. Computer Organization and Architecture 4. Theory of Computation 5. Object Oriented Programming agit 6. Data Structures 1 Semester Lab component 1. Data Structures 2. Object Oriented Programming Semester II L. Operating Systems 2. Database Management Systems 3. Computer Networks 4. Software Engineering 5. The Design and Analysis of Algorithm 6. Artificial Intelligence II Semester Lab Component 1. Database Management System 2. Unix Programming Semester Il: Two Open Elective Papers from outside the Departments Vertical I Java with four courses and a mini project Vertical 1] N ET with four courses and a mini project Vertical HII Business Intelligence and Data Analytics with four courses and a mini project Vertical [V Advanced Database with four courses and a mini project IV Semester Full time industry/research internship Advantages: 1. Certification is possible 2. In line with online MOOC and Swayam Courses 3. Inline with Oracle University BENGALURU UNIVERSITY Regulations of Master of Computer applications (MCA) Course RITLE [OF THE COURSE: The course shall be called MCA — Master of Computer Applications. 2 DURATION OF THE COURSE: The course of study shall be two years. 3 ELIGIBILITY FOR ADMISSION: A candidate with any degree of a minimum of 3 years duration (101243) of Bangalore university or of any other University equivalent there on ta with @ minimum of $0% of marks in the aggregate of all subjects including languages, iftany, provided further, that the candidate has studied Mathematics / Computer science /Businece Mathematics / Statistics / Computer Applications / Electronics as a subject at PUC level or fauivalent HSC (XII Standard) or at Degree level is eligible for admission to MCA Course Relaxation to SC/ST, Group | be extended as per University norms. ATTENDANCE: In each Semester a candidate should be considered to have successfully undergone the prescribed Course of study if the candidate has attended at least 75% of the classes in each subject (Theory, Lab & Practical), 5 SCHEME OF EXAMINATION: 6 ELIGIBILITY TO GO 10 THE HIGHER SEMES A. The Internal Assessment marks should be decided for each of the theory subjects by Conducting 2 tests, each of 60 minutes duration, spread over the span of a Semester. A seming should also-be-giverr by the student in the second year and the same to be assessed and evaluated for internal assessment along with two tests. B. “The Internal Assessment marks in Practical course is based on the performance in the Laboratory. The Internal Assessment marks for Project work of a candidate is based on the dissertation and seminar. ER: Pretend is allowed to carry over all the previous uncleared (failed) theory papers and Practicals to subsequent semesters from the first to fourth semester B. The maximum period for the completion of the course shall be four years from the date of admission, 7 MINIMUM FOR PASS AND DECLARATION OF RESULTS A. For a pass in a semester, a candidate shall secure a minimum of 40% of the marks Prescribed for @ subject in the University Examination (Theory, Practical, Project work) and 20% of the marks in the aggregate inclusive of the Internal Assessment marks obtained in al subjects put together B. The candidates who do not satisfy 7(A) shall be deemed to have failed and have to tke ¢xams in the subjects in which he has secured less than 40% at the University examination, C.__ghrovision is made for rejection of results ofall the subjects of a Semester only once: ifthe Candidate decides to reappear forall the subjects of that semester. Such rejection should be nade within 30 days of announcement of result, by making a written application, through the Head of the Institution. If such rejection is in respect of the results of all the subjects of one semester and earn fresh Internal marks as well, D. The results of any semester will be declared as pass or fail as the case may be in accordance with regulation 7(A), Enero Ce cligible for the award of the MCA degree, a candidate shall have completed the scheme of training and passed in all subjects prescribed for the Course. F. Further to regulation 7(A). the classification followed by the University for all PG courses shall be made applicable for the declaration of results of each Semester. CLASSIFICATION OF RESULT FOR THE MCA COURSE AND DECLARATION OF RANKS: Further to regulations 7(A) and 7(F), the names of all successful candidates securing First Class with Distinction and First Class in the First attempt shall be arranged in the order of Merit and only first FIVE Ranks shall be declared. A candidate shall complete examinations of all Semesters of MCA Course within - FOUR years from the date of admissi Iv Paper Code Page 5 of 13 SCHEME OF STUDY AND EXAMINATION FOR MASTER OF COMPUTER IMCAL IMCA2 IMCA3 IMCA4 IMCAS IMCA6 IMCA7 IMCA8 2MCAI 2MCA2 2MCA3 2MCA4 2MCAS 2MCAG6 2MCAT 2MCAS 3MCAL 3MCA2 3MCA3 3MCA4 3MCAS 3MCA6 3MCA7 APPLICATIONS (MCA) Title of the paper The Art of Programming Discrete Mathematics Computer Organization and Architecture ‘Theory of Computation Object Oriented Programming Data Structures Data Structures Lab Object Oriented Lab Operating Systems Database Management Systems Computer Networks Software Engineering The Design and Analysis of Algorithm Antificial Intelligence Database Management Unix Programming Lab Open Elective Soft Core Research Methodology cctive 1 Elective I Elective 111 MINI PROJECT MAIN PROJECT Hours Week 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 120 Marks Exam 70 70 70 70 70 70 70 70 70 70 70 70 70 70 70 10 70 70 70 70 70 70 70 280 Total | Subject Sem be loo 4 oo 4 bor ie | | 100 | 4 |g oo # oo 4 too [2 | 100 2 | 10004 10 4 1004 1004 28 1oo | * loo | 4 oo 2 | | oo 2 | 0 3 100 | 3 oo 4 oo 46 oo 4 1004 10004 400 16 16 FIRST SEMESTER MCA IMCAL: THE ART OF COMPUTER PROGRAMMING Total Teaching Hours: 52 No. of Hours / Week: 04 UNIT -1 [13 Hours] Introduction: The Role of Algorithms in Computing, Algorithms as a technology, Analyzing algorithms, Designing algorithms, Growth of Functions, Asymptotic notation, Standard notations and common functions. Fundamental Algorithms: Exchanging the values of two variables, Counting, Summation of a set of numbers, Factorial Computation, Generating of the Fibonacci sequence, Reversing the digits of an integer, Base Conversion, Character to number conversion. UNIT-I [13 Hours} C Programming: Getting Started, Variables and Arithmetic expressions. Input and Output: Standard input and output, formatted output- printf, variable length argument list, formatted input- scanf. Control Flow: Statements and Blocks, If-else, else-if, switch, loops: while loop, for loop, do while, break and continue, goto and labels. Pointers and Arrays: pointers and address, pointers and function arguments, multidimensional array, initialization of pointer arrays, command line arguments, UNIT =I [13 Hours] Factoring Methods: Finding the square root of a number, the smallest Divisor of an integer, the greatest common divisor of two integers, generating prime numbers, computing the prime factors of an integer, generation of pseudo random numbers, raising a number to a large power, computing the nth Fibonacci Number. Array Techniques: Array order Reversal, Array counting or Histogramming, Finding the maximum number in a set, removal of duplicates from an ordered array, partitioning an array, Finding the kth smallest element, multiplication of two matrices. UNIT-IV [13 Hours} Merging: the two-way merge. Sorting: Sorting by selection, sorting by exchange, sorting by insertion, sorting by diminishing increment, sorting by partitioning. Searching: binary search, hash search. Text processing and Pattern searching: text line length adjustment, left and right Justification of text, keyword searching in text, text line editing, linear pattern search, sublinear pattern search, Text Books: 1. RG.Dromey, “How to Solve it by Computer", Pearson Education India, 2008. 2. Thomas H. Cormen, Charles EF. Leiserson, Ronald L. Rivest, Clifford Stein, “Introduction to Algorithms”, 3" Edition, The MIT Press Cambridge, Massachusetts London, England, 2009 3. Brain M. Kernighan, and Dennis M. Ritchie, “The C Programming Language", 2" edition, Princeton Hall Software Series, 2012 Reference Books: 1. Steven 8. Skiena, “The Algorithm Design Module”, 2nd Edition, Springer-Verlag London Limited, 2008. 2. Donald 6. Knuth, The Art of Computer Programming”, Volume 1: Fundamental Algorithms, 3” Edition, Addison Wesley Longman, 1997. 3. Donald E. Knuth, The Art of Computer Prograt 3 Edition, Addison Wesley Longman, 1998 4. Greg Perry and Dean Miller, “C programming Absolute Beginner's Guide”, 3"* edition, Pearson Education, Inc, 2014. imming”, Volume 2: Seminumerical Algorithms, Web Resources: 1. hiip:algorithmsforinterviews.com “Algorithms for Interviews” 1MCA2: DISCRETE MATHEMATICS Total Teaching Hours: 52 No. of Hours / Week: 04 UNIT -I [13 Hours} Set Theory and Logic: Fundamentals of Set theory, Set Operations and the Laws of Set Theory, Counting and Venn Diagrams, Cartesian Products and Relations, Functions-One-to-One, Onto Functions, Function Composition and Inverse Functions. Mathematical Induction, The well ordering principle, Recursive Definitions, Structural Induction, Recursive algorithms. Fundamentals of Logic, Propositional Logic, Logical Connectives and Truth Tables, Logic Equivalence, Predicates and Quantifiers, Nested Quantifiers, Rules of Inference, Introduction 10 Proofs. Proof Methods and strategy. UNIT - IL [13 Hours} Counting and Relations: Basics of counting, Pigconhole Principle, Permutation and Combinations, Binomial coefficients. Recurrence relations, Modeling with recurrence relations with examples of Fibonacci numbers and the tower of Hanoi problem. Divide and Conquer relations with examples (no theorems). Definition and types of relations, Representing relations using matrices and digraphs, Partial Orderings, Hasse diagrams, Maximal and Minimal elements, Lattices UNIT - 111 [13 Hours] Probability: ‘The Concept” of Probability-Sample Spaces, Probability as Relative Frequency, Axiomatic Definition of Probability, Properties of Probability, Additive Property, Conditional Probability, Multiplicative Law of Probability, Law of Total Probability, Bayes’ Formula, Independent Events. Random Variables, Distribution Functions, Discrete Random Variables, Continuous Random Variables, Probability Mass Function and Probability Density Function, Expectation and Variance, Functions of Random Variables, Some important Probability Distributions: Discrete - Bernoulli Trials and Binomial distribution, Geometric distribution and Poisson distribution, Continuous - Uniform distribution, Normal distribution and Exponential distribution. UNIT - IV [13 Hours] Graph Theory: Graphs: Introduction, Representing Graphs, Graph Isomorphism, Operations on graphs. Trees: Introduction, Applications of Trees, Tree Traversal, Spanning Trees, Minimum Spanning Trees, Prim’s and Kruskul’s Algorithms. Connectivity, Euler and Hamilton Paths, Planar Graphs. Directed graphs: Fundamentals of Digraphs, Computer Recognition - Zero-One Matrices and Directed Graphs, Out-degree, in-degree, connectivity, orientation, Eulerian and Hamilton directed graphs, tournaments. Text Books: 1. Ralph P. Grimaldi: Discrete and Combinatorial Mathematics, 5thEdition, Pearson Education, 2004, 2 C.L, Liu: Elements of Discrete Mathematics, Tata McGraw-Hill, 2000. 3. Sheldon M Ross: Introduction to Probability Models, 12th edition, Academie Press, 2019. 4. F. Harary: Graph Theory, Addition Wesley, 1969. 8 Reference Books: 4. Kenneth H Rosen: “Discrete Mathematics and its Applications", McGraw Hill publications, 7th edition, 2007. 2. J.P. Tremblay and R.P. Manohar: Discrete Mathematical Structures with applications to Computer Science, Me Graw Hill Ed. Ine. 1975 3. Sheldon M Ross: Introduction to Probability and Statistics for Engineers and Scientists, 6th edition, Academic Press, 2020. 4. Michael Baron: Probability and Statistics for Computer Scientists, 3rd Edition, CRC, 2019 Web Resources: 1. hittps://www.my-mooc.com/en/categorie/mathematics 2. hitp://www.nptelvideos. in/2012/1 I/discrete-mathematical-structures, html 3. https://ocw.mit.edu/courses/mathematics/ © 4 1MCA3: COMPUTER ORGANIZATION AND ARCHITECTURE, Total Teaching Hours: 52 No. of Hours / Week: 04 UNIT-1 [13Hours} ‘Number Systems: Binary, Octal, Hexa decimal numbers, base conversion, addition, subtraction ofbinary numbers, one's andtwo's complements, positiveand negative numbers, character codes ASCII, EBCDIC etc. Computer Arithmetic: Addition and Subtraction, Multiplication and Division algorithms, Floating-point Arithmetic Operations, Decimal arithmetic operations Structure of Computers: Computer types, Functional units, Basic operational concepts, Von- Neumann Architecture, Bus Structures, Software, Performance, Multiprocessors and Multicomputer, Digital Logic Circuits: Logic gates, Boolean algebra, Map Simplification Combinational Cire Half Adder, Full Adder, flip flops.Sequentialcircuits:Shiftregisters, Counters, integratedCircuits, Mux,Demux,Encoder, Decode Data representation: Fixed and Floating point, Error detection and correction codes. UNIT- 11 [13Hours} Basic Computer Organization and Design: Instruction codes, Computer Registers, Computer Instructions and Instruction cycle. Timing and Control, Memory-Reference Instructions, Input-Output and interrupt. Central processing unit: Stack organization, Instruction Formats, Addressing Modes, Data_Transfer_and Manipulation, Complex Instruction Set Computer (CISC) Reduced Instruction Set Computer (RISC), CISC vs RISC UNIT - TIL [13Hours] Register Transfer and Micro-operations: Register Transfer Language, Register Transfer, Bus and Memory Transfers, Arithmetic Micro-Operations, Logic Micro-Operations, Shift Micro-Operations, Arithmetic logic shift unit. Micro-programmed Control: Control Memory, Address Sequencing, Micro-Program example, Design of Control Unit. Input Output: /O interface, Programmed IO, Memory Mapped IO, Interrupt Driven 10, DMA. Instruction level parallelism: Instruction level parallelism (ILP)-over coming data hazards, limitations of ILP UNIT-IV (13Hours] Memory System: Memory Hierarchy, Semiconductor Memories, RAM(Random Access Memory), Read Only Memory (ROM), Types of ROM, Cache Memory, Performance considerations, Virtual memory, Paging, Secondary Storage, RAID. Multiprocessors And Thread level Parallelism: Characteristics of — multiprocessors, Multi-Threaded Architecture,Distributed Memory MIMD Architectures, Architecture of MultiThreaded Processor, principle of MultiThreading, Interconnection structures, Inter Processor Arbitration, Inter processor Communication and Synchronization, Cache Coherence. TEXT BOOKS: 1. Mano M Morris, Computer System Architecture”, 3rd edition Pearson India(2019) 2 William Stallings, “Computer Organization and Architecture designing for performance", 10th edition, Pearson(2016) REFERENCE BOOKS: 1 Subrata Ghoshal, “Computer Architecture And Organization", Pearson India(201 1). 2. Andrew S. Tanenbaum * Structured Computer Organization”, Sth edition, Pearson Education Inc(2006). $unCarl Hamacher, Zvonks Vranesic SafeaZaky, “Computer Architecture And Organization”, 5" edition McGraw Hill New Delhi, India(2002) 4 Kai Hwang, | “Advanced Computer Architecture - Parallelism, Scalability, Programmability”, Tata Mcgraw-Hill (2008) @ 1MCA4: THEORY OF COMPUTATION Total Teaching Hours: 52 No. of Hours / Week: 04 UNIT -1 (13 Hours} Introduction to Automata: The Principle of Mathematical Induction, Introduction to formal proof, Additional forms of Proof, Inductive Proofs. Finite Automata: Introduction, Deterministic Finite Automata (DFA) : Formal definition, simpler notations (state transition diagram, transition table), language of a DFA. Nondeterministic Finite Automata (NFA): Definition of NFA, language of an NPA, Equivalence of Deterministic and Nondeterministic Finite Automata, Applications of Finite Automata, Finite Automata with Epsilon Transitions, Eliminating Epsilon transitions, Minimization of Deterministic Finite Automata UNIT - I [13 Hours] Regular Expressions: Introduction, Identities of Regular Expressions, Finite Automata and Regular Expressions- Converting from DFA’s to Regular Expressions, Converting Regular Expressions to Automata, applications of Regular Expressions. Regular Grammars: Definition, regular grammars and FA, FA for regular grammar, Regular grammar for FA. Proving languages to be non-regular. Properties of Regular Languages: The Pumping Lemma for regular languages, Applications of the pumping lemma closure properties of regular languages, Decision properties of regular languages, Equivalence and minimization of automata. Context Pree Grammer (CFG): Derivation Trecs, Sentential Forms, Rightmost and Lefimost derivations of Strings. Ambiguity in CFG's,-Minimization-of-CFG’s,-CNF,- GNF, Pumping-Lemma~for CFL's, Enumeration of Properties of CFL. UNIT - 111 [13 Hours} Pushdown Automata Introduction: Definition, Formal definition of pushdown automata, A graphical notation for PDA’s, Instantaneous descriptions of a PDA. Pushdown Automata: Definition, Model, Acceptance of CFL, Acceptance by Final State and Acceptance by Empty stack and its Equivalence, Equivalence of CFG and PDA. Deterministic Pushdown Automata: Definition of a deterministic PDA, Regular languages and deterministic PDA’s, DPDA’s and context-free languages, DPDA’s and ambiguous grammars. Transducers: Moore machine, Mealy machine, Difference between Moore & Mealy machines, Properties, Equivalence of Moore & Mealy machines. Context Sensitive Languages: Linear bounded automata, Chomsky’s hierarchy of languages. UNIT-1V [13 Hours] Introduction to Turing Machines: The ‘Turing Machine: The instantaneous descriptions for Turing machines, Transition diagrams for Turing machines, The language of a Turing machine, Turing machines and halting programming techniques for Turing machines, Extensions to the basic Turing machine, Restricted Turing machines, Turing machines and computers. Undecidability: A language that is not recursively enumerable, Enumerating the binary strings, Codes for Turing machines, the diagonalization language, An undecidable problem that is RE: Recursive languages, Complements of recursive and RE languages, The universal languages, Undecidability of the universal language. Undecidable Problems About ‘Turing Machines: Reductions, Turing machines that accept the empty language. Post's correspondence problem: Definition of post's correspondence problem, The “Modified” PCP, Other undecidable problems: Undecidability of ambiguity for CFG’s. Unsolvable Problems and Computable Functions: A no recursive Language and Unsolvable Problem, Reducing one problem to another: The Halting Problem, Other unsolvable Problems involving TMs, Rice’s Theorem and More Unsolvable problems. © Text Books: 1. John E. Hoperoft, Rajeev Motwani, Jeffrey D. Ullman (2007), Introduction to Automata Theory, Languages and Computation, 3” Edition, Pearson Education, India 2. KL P Mishra, N. Chandrashekaran (2003), Theory of Computer Science-Automata Languages and Computation, 2nd Edition, Prentice Hall of India, India Reference Books: 1. Harry. R. Lewis and C. H. Papadimitriou - Elements of the Theory of Computation, Second Edition, PHI, 2003 2. John C. Martin - Introduction to Languages and the Theory of Computation, Fourth Edition, TMH, 2011. 3. Micheal Sipser - Introduction of the Theory and Computation, Thomson Brokecole, Second Edition, 1997, 4 C K. Nagpal - Formal Languages and Automata Theory, Oxford Higher Education, April 2011. Web Resources: 1, Youtube Channel: nptelhrd, Playlist name: Theory of automata, formal languages and computation. Qs 1MCAS: OBJECT ORIENTED PROGRAMMING Total Teaching Hours: 52 No. of Hours / Week: 04 UNIT-I (13 Hours} Evolution of Higher Level Programming Languages, Complexity of Software and their Attributes Object Orientated Programming Paradigm, Principles of Object Oriented Programming — Data Encapsulation, Polymorphism and Inheritance, Advantages of Object Oriented Programming, Application areas of Object Oriented Programming, Object Oriented Programming Languages, Limitations of Object Oriented Programming Introduction to the JAVA language - Evolution of Java, The Salient Features of the JAVA Language, The Java Byte Code and the JVM, The JAVA platform, JAVA, Internet and WWW, JAVA Environment, Tokens, Keywords and Identifiers, Constants and Variables, Data types, Console VO, Structure of a Java Program, Executing a Java program, Types of Errors, Operators JAVA, Precedence and Associativity of Operators, Type Conversion, Selection Structures- Simple-If statement, If-Else statement, Nested If-Blse statement, Else-if ladder, The Switch Statement, Looping Structures- The while loop, The For loop, The Do-While loop, Nested Loops, The Break Statement, The Continue Statement, Labelled Loops. UNIT-IT [13 Hours] Classes, Objects and Methods - Class Definition; Instance Variables and Member Methods, Declaration and Creation of Objects, Accessing Members, Classification of Member Methods, Constructors, Copy Constructor, this keyword , Objects as Arguments to methods, Methods returning an object, Static member data, Static member methods, Static Blocks, Nesting of Methods, Recursion, Nested Classes, Inner Classes, Static nested Classes, Local Classes, Anonymous Classes, Final members, Variable Arguments, Objects of one class as members of another class (Containment), Finalize Method and Garbage Collection. Inheritance — Single-level Inheritance, Multilevel inheritance, Hierarchical Inheritance, Multiple Inheritance, Hybrid Inheritance, Constructors and Inheritance, Abstract Classes and Methods, Dynamic Method Dispatch, Object Slicing, Object Typecasting, Final Classes Interfaces - Defining Interfaces, Implementing Interfaces, Polymorphism through interfaces, Implementing an Interface Partially, Extending Interfaces, Implementing Multiple Interfaces, Multiple Inheritance through Interfaces UNIT-IIL {13 Hours] Packages - Built-in Packages, User-defined Packages, Creating and using a Package, To create a Package spread across multiple files, Importing classes from a package, Nested packages, Extending an imported class, Classes and interfaces in a package and using them, Static importing, Access Control. Arrays — One Dimensional Arrays, Two Dimensional Arrays, Three Dimensional Arrays, Arrays and methods, Atrays within classes, Array of objects, Strings — The String Class, The StringBuffer Class, Exception Handling- Types of Exceptions, Default Exception Handling Mechanism, User-Defined Exception Handling Mechanism, Try blocks, Catch Blocks, Nested Try Blocks, Stack Unwinding, Throw Statement, Throws Statement, Finally Statement UNIT-IV (13 Hours} Multithreaded Programming - ‘The Java Thread Model, The Life Cycle of a Thread, The Thread Class, The Main Thread, Creating our own Threads -Extending the Thread Class, Implementing, the Runnable Interface, Thread Groups, Thread Priorities, Synchronization, Deadlock, Suspending and Resuming Threads, Producer-Consumer Relationship between ‘Threads, Daemon Threads, File Handling - The File Class, The Writer class and its subclasses, The Reader Class and its subclasses, The OutputStream and its subclasses, The InputStream Class and its subclasses, The DataOutputStream Class, The DatalnputStream Class, The ObjectOutputStream Class, ‘The ObjectInputStream Class, Random Access files Applets - Types of Applets, The Life Cycle of an Applet, Creating and Executing Applets, The Attributes in the tag, Working with Graphics Textbooks: 1. E, Balagurusamy, Programming with JAVA, McGraw Hill, New Delhi, 2007 Reference Books: 1. Raj Kumar Buyya, Object Oriented. Programming with JAVA, McGraw Hill, 2009 2. Herbert Schildt, Java A Beginner's Guide ~ Create, Compile, and Run Java Programs Today, Sixth Edition, Oracle Press, 2014 3. Ken Arnold, James Gosling, “The Java Programming Language, Fourth Edition, Addison Wisely, 2005 4. Herbert Schildt, ‘The Complete Reference Java, 7th Edition, McGraw Hill, 2007 Web Resources 1. hutps://docs. oracle.com/javase/tutorial/ 2. hitps:/fjavabeginnerstutorial.com/core-java-tutorial/ IMCA6: DATA STRUCTURES. Total Teaching Hours: 52 No. of Hours / Week: 04 UNIT-1 (13Hours} Introduction and Overview: Definition, Elementary data organization, Data Structures, data Structures operations, Abstract data types, algorithms complexity, time-space trade off. Preliminaries: Mathematical notations and functions, Algorithmic notations, control structures, Complexity of algorithms, asymptotic notations for complexity of algorithms. String Processing: Definition, Storing Strings, String as ADT, String operations, word/text processing, Pattern Matching algorithms. UNIT [13Hours} Arrays: Definition, Linear arrays, arrays as ADT, Representation of Linear Arrays in Memory, ‘Traversing Linear arrays, Inserting and deleting, Multi-dimensional arrays, Matrices and Sparse matrices. Linked list: Definition, Representation of Singly Linked List in memory, Traversing a Singly linked list, Searching in a Singly linked list, Memory allocation, Garbage collection, Insertion into a singly linked list, Deletion from a singly linked list; Doubly linked list, Header linked list, Circular linked list. Stacks: Definition, Array representation of stacks, Linked representation of stacks, Stack as ADT, Arithmetic Expressions: Polish Notation, Conversion of infix expression to postfix expression, Evaluation of Post fix expression, Application of Stacks, Recursion, Towers of Hanoi, Implementation of recursive procedures by stack. Queues: Definition, Array representation of queue, Linked list representation of queues. Types of queue: Simple queue, Circular queue, Double-ended queue, Priority queue, Operations on Queues, Applications of queues. UNIT-IL (13Hours} Binary Trees: Definitions, Tree Search, Traversal of Binary Tree, Tree Sort, Building a Binary Search Tree, Height Balance: AVL Trees, Contiguous Representation of Binary Trees: Heaps, Lexicographic Search Trees: Tries, External Searching: B-Trees, Applications of Trees. Graphs: Mathematical Back ground, Computer Representation, Graph Traversal, Topological Sorting, Greedy Algorithm, Graphs as Data Structure. UNIT-IV {13Hours} Searching: Introduction and Notation, Sequential Search, Binary Search, Comparison of Methods. Sorting: Introduction and Notation, Insertion Sort, Selection Sort, Shell Sort, Divide And Conquer, Merge sort for Linked List, Quick sort for Contiguous List. Hashing: Sparse Tables, Choosing a Hash function, Collision Resolution with Open Addressing, Collision Resolution by Chaining. Text Books: 1. Seymour Lipschutz, “Data Structures with C", Schaum's outLines, Tata Me Graw Hill, 2011 2. Robert Kruse, C.L. Tondo, Bruce Leung, Shashi Mogalla, “Data Structures and Program Design using ©", Pearson Education, 2009. ReferenceBooks: 1. Mark Allen Weiss," Data Structures and Algorithm Analysis in C", Second Edition, Pearson Education, 2013 () 2. Forouzan,"A Structured Programming Approach using C2" Edition, Cengage LearningIndia, 2008. 1MCAT7: DATA STRUCTURES LAB PROGRAMS. * Foralll the programs write the output, flowchart and number of basic operations performed. 1. Given {4,7,3,2,1,7,9,0, find the location of 7 using Binary search and also display its first occurrence. 2. Given {5,3,1,6,0,2,4} order the numbers in ascending order using Quick Sort 3. Perform the Merge sort on the input {75,8,1,16,48,3,7,0} and display the output in descending order. 4. Write a program to insert the elements 61,16,8,27 into singly linked li from the list. Display your list after each insertion and deletion. 5. Write a program to add 6x*+10x?+0x+5 and 4x?+2x+1 using linked list. 6. Write a program to push 5,9,34,17,32 into stack and pop 3 times from the stack, also display the popped numbers. 7. Write a recursive program to find GCD of 4,6,8. 8, Write a program to inert the elements {5,7,0,6,3,9} into circular queue and delete 6,9&5 from it(using linked list implementation). 9. Given $1=(“Flowers”} ; S2={“are beautiful”} , a) Find the length of SI. b) Concatenate S1 and $2, ©) Extract the substring “low” from $1 4) Find “are” in $2 and replace it with “is” 10, Write a program to convert an infix expression x“y/(5*z)+2 to its postfix expression. 11, Write a program to evaluate a postfix expression 5 3+8 2 - * 12, Write a program to create a binary tree with the elements 18,15,40,50,30,17,41 after creation insert 45 and 19 into tree and delete 15,17 and 41 from tree. Display the tree on each insertion and deletion operation, 13, Write a program to create binary search tree with the elements {2,5,1,3,9,0,6} and perform inorder, preorder and post order traversal, 14. Write a program to Sort the following elements using heap sort {9.16,32,8,4,1,5,8,0}. and delete 8,61,27 ul 12. 13. 14. 15. 16. 17. 18. 19. 20. 1MCA8: OBJECT ORIENTED PROGRAMMING WITH JAVA LAB PART-A, Develop a JAVA program to demonstrate the precedence and associativity among arithmetic operators. The program should also demonstrate how the default precedence can be overridden. Write a JAVA program to validate a date. The program should accept day, month and year and it should report whether they form a valid date or not, Write a JAVA program to display the following pattern. i 22 333 4444 55555 Write a JAVA program to print the first n members of Fibonacci series. Write a program to generate the multiplication tables of a range of numbers between m and ninclusive and m

You might also like