NDSS Academy
You can keep up to 10 CVs here -- delete one you don't need.

Computer Applications

MCA · Semester 2

6 MonthsDuration 8Subjects 42Chapters OnlineTests & result
Enquire now Nearest centre Syllabus PDF

Your roadmap · आपका रोडमैप

  1. 1
    Admission & first meetingप्रवेश और पहली मुलाकात

    Enquire at your nearest NDSS centre, meet the teacher, fix the batch time and get your study material.

  2. 2
    Semester 2 — subject classesसेमेस्टर 2 — विषयवार कक्षाएँ

    Every theory subject of the term, unit by unit, with notes, numericals and doubt classes.

    Theory of Automata & Formal LanguagesObject Oriented ProgrammingOperating SystemsDatabase Management SystemsData Structures & Analysis of Algorithms
  3. 3
    Labs, practicals & project workलैब, प्रैक्टिकल और प्रोजेक्ट

    Experiments / jobs / project work as in the syllabus, with practical file and viva preparation.

    Object Oriented Programming LabDatabase Management Systems LabData Structures & Analysis of Algorithms Lab
  4. 4
    Unit tests & mid-termयूनिट टेस्ट और मिड-टर्म

    A test after every unit and a mid-term in the university / board pattern.

  5. 5
    Semester 2 mock testमॉक टेस्ट

    A full mock test of all subjects before the exam, with analysis.

  6. 6
    Semester 2 exam (university / board)सेमेस्टर / वार्षिक परीक्षा

    Previous papers, important questions and full revision.

  7. 7
    Online tests & resultऑनलाइन टेस्ट और रिज़ल्ट

    Take the tests online; your marks and result show in your student login and at the centre.

Syllabus · पाठ्यक्रम

8 subjects · 42 chapters · 212 topics

Theory of Automata & Formal Languages5 chapters · 6 Months Subject page →
01Unit 1: Finite Automata 6 topics
  1. Alphabet, strings and languages
  2. Deterministic finite automata (DFA)
  3. Non-deterministic finite automata (NFA) and epsilon-NFA
  4. Equivalence of NFA and DFA: subset construction
  5. Minimisation of DFA
  6. Moore and Mealy machines and their conversion
02Unit 2: Regular Expressions and Regular Languages 6 topics
  1. Regular expressions and identities
  2. Arden's theorem
  3. Conversion of finite automata to regular expressions and back
  4. Pumping lemma for regular languages
  5. Closure and decision properties of regular languages
  6. Regular grammars
03Unit 3: Context-Free Grammars and Languages 6 topics
  1. Chomsky hierarchy of grammars
  2. Context-free grammars, derivations and parse trees
  3. Ambiguity in grammars
  4. Simplification: useless, null and unit productions
  5. Chomsky normal form and Greibach normal form
  6. Pumping lemma and closure properties of CFLs
04Unit 4: Pushdown Automata 5 topics
  1. Definition and instantaneous description of a PDA
  2. Acceptance by final state and by empty stack
  3. Design of PDA for given languages
  4. Equivalence of PDA and CFG
  5. Deterministic PDA and deterministic CFLs
05Unit 5: Turing Machines and Undecidability 6 topics
  1. Turing machine model and design
  2. Variants: multi-tape and non-deterministic TM
  3. Church-Turing thesis and universal TM
  4. Recursive and recursively enumerable languages
  5. Halting problem and undecidability
  6. Post's correspondence problem
Object Oriented Programming5 chapters · 6 Months Subject page →
01Unit 1: Introduction to Java and OOP 6 topics
  1. OOP concepts: class, object, encapsulation, abstraction, inheritance, polymorphism
  2. Java history, JDK, JRE, JVM and bytecode
  3. Data types, variables, operators and control statements
  4. Arrays and command-line arguments
  5. Classes, objects, methods and constructors
  6. this keyword, static members and access modifiers
02Unit 2: Inheritance, Packages and Interfaces 6 topics
  1. Types of inheritance and the super keyword
  2. Method overloading and overriding
  3. Dynamic method dispatch
  4. final keyword and abstract classes
  5. Interfaces and default methods
  6. Packages and import
03Unit 3: Exceptions, Multithreading, Strings and I-O 6 topics
  1. Exception hierarchy: checked and unchecked exceptions
  2. try, catch, finally, throw and throws; custom exceptions
  3. Thread life cycle; Thread class and Runnable interface
  4. Synchronisation and inter-thread communication
  5. String, StringBuffer and StringBuilder
  6. Byte and character streams; file reading and writing
04Unit 4: Java New Features and Collections 6 topics
  1. Functional interfaces and lambda expressions
  2. Method references and the Stream API
  3. Collections framework hierarchy
  4. ArrayList, LinkedList, HashSet, TreeSet
  5. HashMap, TreeMap and Iterator
  6. Generics, Comparable and Comparator
05Unit 5: Spring Framework and Spring Boot 6 topics
  1. Spring core: inversion of control and dependency injection
  2. Beans, bean scopes and autowiring
  3. Annotations: @Component, @Autowired, @Configuration
  4. Spring Boot: starters and auto-configuration
  5. Building a simple REST controller
  6. Spring Boot application structure
Operating Systems5 chapters · 6 Months Subject page →
01Unit 1: Introduction 5 topics
  1. Operating system functions and services
  2. Types: batch, multiprogramming, time-sharing, real-time, distributed
  3. System calls and system programs
  4. OS structure: monolithic, layered, microkernel
  5. Kernel and user mode
02Unit 2: Concurrent Processes 6 topics
  1. Process concept, PCB and process states
  2. Principle of concurrency and critical section
  3. Mutual exclusion: Dekker's and Peterson's solutions
  4. Semaphores and their operations
  5. Classical problems: producer-consumer, readers-writers, dining philosophers
  6. Inter-process communication
03Unit 3: CPU Scheduling and Deadlocks 6 topics
  1. Scheduling criteria
  2. FCFS, SJF, SRTF, priority and round-robin scheduling
  3. Multilevel queue and multilevel feedback queue
  4. Deadlock characterisation
  5. Deadlock prevention and avoidance: Banker's algorithm
  6. Deadlock detection and recovery
04Unit 4: Memory Management 6 topics
  1. Contiguous allocation and fragmentation
  2. Paging and page tables
  3. Segmentation
  4. Virtual memory and demand paging
  5. Page replacement: FIFO, optimal, LRU
  6. Thrashing and working set
05Unit 5: I-O Management, Disk Scheduling and File Systems 6 topics
  1. I-O devices and buffering
  2. Disk structure
  3. Disk scheduling: FCFS, SSTF, SCAN, C-SCAN, LOOK
  4. File concept, access methods and directories
  5. File allocation: contiguous, linked and indexed
  6. Free-space management
Database Management Systems5 chapters · 6 Months Subject page →
01Unit 1: Introduction and ER Model 6 topics
  1. File system versus DBMS
  2. Data models, schema and instances
  3. Three-schema architecture and data independence
  4. Database languages and DBA
  5. ER model: entities, attributes, keys and relationships
  6. Generalisation, specialisation, aggregation and ER to tables
02Unit 2: Relational Model and SQL 6 topics
  1. Relational model concepts and integrity constraints
  2. Relational algebra operations
  3. Tuple and domain relational calculus
  4. SQL DDL and DML commands
  5. Joins, aggregate functions, GROUP BY and subqueries
  6. Views, indexes, triggers and cursors
03Unit 3: Database Design and Normalisation 5 topics
  1. Functional dependencies and Armstrong's axioms
  2. Attribute closure and candidate keys
  3. Normal forms: 1NF, 2NF, 3NF and BCNF
  4. Multivalued dependencies and 4NF; join dependencies and 5NF
  5. Lossless join and dependency-preserving decomposition
04Unit 4: Transaction Processing and Recovery 6 topics
  1. Transaction concept and ACID properties
  2. Schedules: serial and non-serial
  3. Conflict and view serializability
  4. Recoverable and cascadeless schedules
  5. Log-based recovery and checkpoints
  6. Deadlock handling in databases
05Unit 5: Concurrency Control 6 topics
  1. Lock-based protocols: shared and exclusive locks
  2. Two-phase locking and its variants
  3. Timestamp-ordering protocol and Thomas write rule
  4. Validation-based protocols
  5. Multiple granularity locking
  6. Multi-version schemes
Data Structures & Analysis of Algorithms5 chapters · 6 Months Subject page →
01Unit 1: Introduction, Arrays and Linked Lists 6 topics
  1. Data structures and abstract data types
  2. Algorithm complexity: time and space
  3. Asymptotic notations: big-O, Omega, Theta
  4. Arrays: row-major and column-major address calculation
  5. Singly, doubly and circular linked lists
  6. Polynomial representation using linked lists
02Unit 2: Stacks, Queues, Searching, Sorting and Hashing 6 topics
  1. Stack operations and applications
  2. Infix to postfix conversion and postfix evaluation
  3. Queues, circular queues, deques and priority queues
  4. Linear and binary search
  5. Insertion, selection, bubble, quick, merge and heap sort
  6. Hashing: hash functions and collision resolution
03Unit 3: Trees 6 topics
  1. Binary tree terminology and representation
  2. Tree traversals: preorder, inorder, postorder
  3. Binary search tree operations
  4. AVL trees and rotations
  5. Heaps and B-trees
  6. Huffman coding
04Unit 4: Graphs 6 topics
  1. Graph terminology and representations
  2. Breadth-first and depth-first search
  3. Minimum spanning tree: Prim's and Kruskal's algorithms
  4. Single-source shortest path: Dijkstra and Bellman-Ford
  5. All-pairs shortest path: Floyd-Warshall
  6. Topological sort
05Unit 5: Algorithm Design Techniques 6 topics
  1. Divide and conquer and the master theorem
  2. Greedy method: fractional knapsack, activity selection
  3. Dynamic programming: 0/1 knapsack, LCS, matrix chain multiplication
  4. Backtracking: N-Queens, subset sum
  5. Branch and bound
  6. P, NP, NP-complete and NP-hard classes
Object Oriented Programming Lab5 chapters · 6 Months Subject page →
01Exp Group 1: Java Basics, Classes and Objects 4 topics
  1. Compile and run a program with javac and java
  2. Command-line arguments
  3. Class with constructors and constructor overloading
  4. Static variables and methods
02Exp Group 2: Inheritance, Polymorphism and Interfaces 4 topics
  1. Multilevel inheritance with super
  2. Method overriding and dynamic method dispatch
  3. Abstract class Shape with area()
  4. Interfaces and multiple inheritance of type
03Exp Group 3: Packages and Exception Handling 4 topics
  1. Creating and importing a user package
  2. try-catch-finally with multiple catch
  3. throw and throws
  4. User-defined exception (InsufficientBalanceException)
04Exp Group 4: Multithreading 4 topics
  1. Thread by extending Thread and implementing Runnable
  2. Thread priorities and join()
  3. Synchronised method for a shared counter
  4. Producer-consumer with wait() and notify()
05Exp Group 5: Strings, Files, Collections and Lambdas 5 topics
  1. String and StringBuilder operations
  2. Reading and writing text files
  3. ArrayList, HashMap and Iterator
  4. Sorting with Comparator and lambda
  5. Stream API: filter, map and collect
Database Management Systems Lab6 chapters · 6 Months Subject page →
01Exp Group 1: DDL and Constraints 3 topics
  1. CREATE, ALTER, DROP and TRUNCATE
  2. Primary key, foreign key, unique, check and not null
  3. Describing table structure
02Exp Group 2: DML and Basic Queries 3 topics
  1. INSERT, UPDATE and DELETE
  2. SELECT with WHERE, ORDER BY, LIKE, IN and BETWEEN
  3. COMMIT, ROLLBACK and SAVEPOINT
03Exp Group 3: Functions, Grouping and Joins 4 topics
  1. Aggregate functions
  2. GROUP BY and HAVING
  3. Inner, outer, self and cross joins
  4. String and date functions
04Exp Group 4: Subqueries, Views and Indexes 4 topics
  1. Single-row and multi-row subqueries
  2. Correlated subqueries
  3. Creating and using views
  4. Creating indexes and sequences
05Exp Group 5: PL-SQL Programming 4 topics
  1. PL-SQL block structure and variables
  2. Conditions and loops
  3. Stored procedures and functions
  4. Exception handling in PL-SQL
06Exp Group 6: Cursors and Triggers 4 topics
  1. Implicit and explicit cursors
  2. Cursor FOR loop
  3. Row-level and statement-level triggers
  4. Audit trigger on salary update
Data Structures & Analysis of Algorithms Lab6 chapters · 6 Months Subject page →
01Exp Group 1: Arrays and Linked Lists 4 topics
  1. Array insertion and deletion
  2. Singly linked list operations
  3. Doubly and circular linked lists
  4. Reversing a linked list
02Exp Group 2: Stacks and Queues 4 topics
  1. Stack using array and linked list
  2. Infix to postfix and postfix evaluation
  3. Circular queue
  4. Priority queue
03Exp Group 3: Searching and Sorting 4 topics
  1. Linear and binary search
  2. Insertion, selection and bubble sort
  3. Quick sort and merge sort
  4. Heap sort and timing comparison
04Exp Group 4: Trees 3 topics
  1. Binary search tree insertion and deletion
  2. Recursive traversals
  3. Height and leaf count of a tree
05Exp Group 5: Graphs 4 topics
  1. Adjacency matrix and list
  2. BFS and DFS
  3. Prim's and Kruskal's algorithms
  4. Dijkstra's algorithm
06Exp Group 6: Algorithm Design Techniques 3 topics
  1. Fractional knapsack by greedy method
  2. 0/1 knapsack and LCS by dynamic programming
  3. N-Queens by backtracking

About this course

You will be able to

  • Complete Theory of Automata & Formal Languages syllabus with regular tests
  • Complete Object Oriented Programming syllabus with regular tests
  • Complete Operating Systems syllabus with regular tests
  • Complete Database Management Systems syllabus with regular tests
  • Complete Data Structures & Analysis of Algorithms syllabus with regular tests
  • Complete Object Oriented Programming Lab syllabus with regular tests
  • Complete Database Management Systems Lab syllabus with regular tests
  • Complete Data Structures & Analysis of Algorithms Lab syllabus with regular tests

Who it is for

  • MCA students of Semester 2 (AKTU, Lucknow)
  • Students preparing for GATE / UGC-NET computer science who need theory of computation basics

What you need

  • Discrete mathematics: sets, relations, functions and proof by induction
Online tests & result Practice and unit tests online; marks and result show in your student login and at the centre. Student login →

Questions

Which syllabus does this Theory of Automata & Formal Languages course follow?

It follows the AKTU (Lucknow) MCA syllabus for Semester 2. If your own university's syllabus differs, the centre follows your university's syllabus and unit order.

This subject feels abstract. How is it taught?

Every topic is taught with drawn state diagrams and many solved design problems, then practised in short tests.

How are students tested at the centre?

Unit-wise MCQ tests, numerical / problem practice, previous AKTU question papers and a final mock paper before the semester exam.

Which syllabus does this Object Oriented Programming course follow?

It follows the AKTU (Lucknow) MCA syllabus for Semester 2. If your own university's syllabus differs, the centre follows your university's syllabus and unit order.

Is the subject taught with programming practice?

Yes. Every concept is shown with a running Java program, and students write programs in the Object Oriented Programming Lab.

Which syllabus does this Operating Systems course follow?

It follows the AKTU (Lucknow) MCA syllabus for Semester 2. If your own university's syllabus differs, the centre follows your university's syllabus and unit order.

Are there many numericals?

Yes. CPU scheduling, Banker's algorithm, page replacement and disk scheduling numericals are solved step by step with practice sheets.

Which syllabus does this Database Management Systems course follow?

It follows the AKTU (Lucknow) MCA syllabus for Semester 2. If your own university's syllabus differs, the centre follows your university's syllabus and unit order.

Download the syllabus (PDF)

Tell us who you are — your copy is made with your name, and our counsellor can help you choose the right course and centre.

Want to join right away? Enquire now — our centre will call you.