UGC NET CS Notes according to syllabus of Paper-III (Core group)

Section 1: Data Structures and Algorithms

• Definition, Simple and Composite structures,
  Arrays, Lists, Stacks queues, Priority queues.
  Binary trees, B – trees, Graphs.
• Sorting and Searching Algorithms, Analysis of Algorithms,
  Interpolation and Binary Search,
  Asymptotic notations-big ohm, omega and theta.
  Average case analysis of simple programs
  like finding of a maximum of n elements.
  Recursion and its systematic removal.
  Quicksort – Non – recursive implementation
  with minimal stack storage.
• Design of Algorithms (Divide and Conquer,
  Greedy method, Dynamic programming, Back tracking,
  Branch and Bound).
• Lower bound theory,
  Non – deterministic algorithm,
  Non – deterministic programming constructs.
  Simple non-deterministic programs.
  NP – hard and NP – complete problems.

1. Data Structures :
   • Array
   • Stack
   • Queue
   • Linked List
   • Binary Tree
   • Binary Search Tree
   • Heap Tree
   • Graph Data Structure
2. Asymptotic Analysis of Algorithms :
   • Analysis of Algorithms | Set 1 (Asymptotic Analysis)
   • Analysis of Algorithms | Set 2 (Worst, Average and Best Cases)
   • Analysis of Algorithms | Set 3 (Asymptotic Notations)
   • Analysis of Algorithms | Set 4 (Analysis of Loops)
   • Analysis of Algorithm | Set 5 (Amortized Analysis Introduction)
   • Analysis of algorithms | little o and little omega notations
   • What does ‘Space Complexity’ mean?
   • Articles | Analysis of Algorithms
3. Recurrence Relations :
   • Analysis of Algorithm | Set 4 (Solving Recurrences)
4. Divide and Conquer :
   • Divide and Conquer | Set 1 (Introduction)
   • Binary Search
   • Why is Binary Search preferred over Ternary Search?
   • Merge Sort
   • Merge Sort for Linked Lists
   • Merge Sort for Doubly Linked List
   • How to make Mergesort to perform O(n) comparisons in best case?
   • QuickSort
   • Iterative Quick Sort
   • QuickSort on Singly Linked List
   • QuickSort on Doubly Linked List
   • When does the worst case of Quicksort occur?
   • Why Quick Sort preferred for Arrays and Merge Sort for Linked Lists?
   • Write a program to calculate pow(x,n)
   • Median of two sorted arrays of same size
   • Count Inversions in an array | Set 1 (Using Merge Sort)
   • Divide and Conquer | Set 2 (Closest Pair of Points)
   • Divide and Conquer | Set 5 (Strassen’s Matrix Multiplication)
   • Sort a nearly sorted (or K sorted) array
   • Search in an almost sorted array
   • K-th Element of Two Sorted Arrays
   • K’th Smallest/Largest Element in Unsorted Array | Set 2 (Expected Linear Time)
   • Searching and Sorting
5. Greedy Techniques :
   • Greedy Algorithms | Set 1 (Activity Selection Problem)
   • Job Sequencing Problem | Set 1 (Greedy Algorithm)
   • Greedy Algorithms | Set 3 (Huffman Coding)
   • Greedy Algorithms | Set 4 (Efficient Huffman Coding for Sorted Input)
   • Greedy Algorithms | Set 2 (Kruskal’s Minimum Spanning Tree Algorithm)
   • Greedy Algorithms | Set 5 (Prim’s Minimum Spanning Tree (MST))
   • Greedy Algorithms | Set 6 (Prim’s MST for Adjacency List Representation)
   • Applications of Minimum Spanning Tree Problem
   • Greedy Algorithms | Set 7 (Dijkstra’s shortest path algorithm)
   • Greedy Algorithms | Set 8 (Dijkstra’s Algorithm for Adjacency List Representation)
   • Greedy Algorithm to find Minimum number of Coins
   • Strongly Connected Components
   • Greedy Algorithms
6. Graph Based Algorithms :
   • Graph and its representations
   • Breadth First Search or BFS for a Graph
   • Depth First Search or DFS for a Graph
   • Applications of Depth First Search
   • Detect Cycle in a Directed Graph
   • Disjoint Set (Or Union-Find) | Set 1 (Detect Cycle in an Undirected Graph)
   • Detect cycle in an undirected graph
   • Topological Sorting
   • Longest Path in a Directed Acyclic Graph
   • Dynamic Programming | Set 23 (Bellman–Ford Algorithm)
   • Dynamic Programming | Set 16 (Floyd Warshall Algorithm)
   • Shortest Path in Directed Acyclic Graph
   • Some interesting shortest path questions | Set 1
   • Shortest path with exactly k edges in a directed and weighted graph
   • Biconnected Components
   • Biconnected graph
   • Articulation Points (or Cut Vertices) in a Graph
   • Check if a graph is strongly connected | Set 1 (Kosaraju using DFS)
   • Bridges in a graph
   • Transitive closure of a graph
   • Graph Algorithms
7. Dynamic Programming :
   • Dynamic Programming | Set 1 (Overlapping Subproblems Property)
   • Dynamic Programming | Set 2 (Optimal Substructure Property)
   • Dynamic Programming | Set 4 (Longest Common Subsequence)
   • Dynamic Programming | Set 8 (Matrix Chain Multiplication)
   • Dynamic Programming | Set 10 ( 0-1 Knapsack Problem)
   • Dynamic Programming | Set 6 (Min Cost Path)
   • Dynamic Programming | Set 25 (Subset Sum Problem)
   • Dynamic Programming | Set 23 (Bellman–Ford Algorithm)
   • Dynamic Programming | Set 16 (Floyd Warshall Algorithm)
   • Total number of non-decreasing numbers with n digits
   • Vertex Cover Problem | Set 2 (Dynamic Programming Solution for Tree)
   • Smallest power of 2 greater than or equal to n
   • Travelling Salesman Problem | Set 1 (Naive and Dynamic Programming)
   • Travelling Salesman Problem | Set 2 (Approximate using MST)
   • Dynamic Programming
8. Back Tracking :
   • Backtracking | Introduction
   • Backtracking | Set 1 (The Knight’s tour problem)
   • Backtracking | Set 2 (Rat in a Maze)
   • Backtracking | Set 3 (N Queen Problem)
   • Backtracking | Set 4 (Subset Sum)
   • Backtracking | Set 5 (m Coloring Problem)
   • Backtracking | Set 6 (Hamiltonian Cycle)
   • Backtracking | Set 7 (Sudoku)
   • Backtracking | Set 8 (Solving Cryptarithmetic Puzzles)
   • Backtracking | Set 9 (Magnet Puzzle)
   • Partition of a set into K subsets with equal sum
   • Write a program to print all permutations of a given string
   • Tug of War
   • Word Break Problem using Backtracking
   • Print all palindromic partitions of a string
   • Top 20 Backtracking Algorithm Interview Questions
9. Branch and Bound :
   • Branch and Bound | Set 1 (Introduction with 0/1 Knapsack)
   • Branch and Bound | Set 2 (Implementation of 0/1 Knapsack)
   • Branch and Bound | Set 3 (8 puzzle Problem)
   • Branch And Bound | Set 4 (Job Assignment Problem)
   • Branch and Bound | Set 5 (N Queen Problem)
   • Branch And Bound | Set 6 (Traveling Salesman Problem)
10. Searching and Sorting :
    • Linear Search
    • Linear Search vs Binary Search
    • Selection Sort
    • Bubble Sort
    • Insertion Sort
    • Heap Sort
    • Radix Sort
    • Counting Sort
11. Non-deterministic Algorithms, NPC and NPH :
    • NP-Completeness | Set 1 (Introduction)
    • Proof that Hamiltonian Path is NP-Complete

1. Data Structures :
   • Array
   • Stack
   • Queue
   • Linked List
   • Binary Trees
   • Binary Search Trees
   • Balanced Binary Search Trees
   • Heap
   • Tree Traversals
2. Asymptotic Analysis of Algorithms :
   • Analysis of Algorithms
3. Recurrence Relations :
   • Analysis of Algorithms (Recurrences)
4. Divide and Conquer :
   • Divide and Conquer
   • MergeSort
5. Greedy Techniques :
   • Greedy Algorithms
   • Graph Shortest Paths
   • Graph Minimum Spanning Tree
6. Graph Based Algorithms :
   • Graph
   • Graph Traversals
7. Dynamic Programming :
   • Dynamic Programming
8. Back Tracking :
   • Backtracking
9. Branch and Bound :
10. Searching and Sorting :
    • Searching
    • Sorting
11. Non-deterministic Algorithms, NPC and NPH :
    • NP Complete

Data Structures and Algorithms :

• Video – NPTEL lectures: Data Structure
• Video – GeeksforGeeks Videos
• Video – Lectures by Ravindrababu Ravula
• MIT – Introduction to Algorithms
• Book – CLRS Solutions Manual
• Visual – Data Structures and Algorithms.
• Notes – Big – O Notation
• Notes – Master Theorem
• Notes – Extended Master Theorem
• Notes – Master Theorem problems and answers

Section 2: OOPs and Scripting Languages

1. Object Oriented Programming and Design :
   • Object, messages, classes, encapsulation,
     inheritance, polymorphism, aggregation, abstract classes,
     generalization as extension and restriction.
   • Object oriented design.
     Multiple inheritance, metadata.
2. Markup Languages :
   • HTML, DHTML, XML
   • Scripting, Java, Servelets, Applets.

1. Object Oriented Programming and Design :
   • Basic Concepts of Object Oriented Programming using C++
   • Why C++ is partially Object Oriented Language?
   • Why Java is not a purely Object-Oriented Language?
   • Introduction to Object Oriented Programming in JavaScript
   • Commonly Asked OOP Interview Questions | Set 1
   • Object Oriented Programming | Set 1
   • Object Oriented Programming (OOP)
2. Markup Languages :
   • HTML | Basics
   • HTML | Attributes
   • HTML | Subscript and Superscript Tags
   • HTML | Paragraph
   • HTML | Text Formatting
   • HTML | Quotations
   • HTML | Style Tag
   • HTML | Tables
   • HTML | SVG-Basics
   • HTML | Responsive Modal Login Form
   • HTML | Class Attribute
   • HTML | Lists
   • HTML | Canvas Basics
   • HTML | Iframes
   • HTML | Responsive full page image using CSS
   • HTML | Comments
   • HTML | Links
   • HTML5 | Video
   • HTML | Images
   • HTML5 | Audio
   • HTML | Adding Youtube videos
   • HTML | Heading
   • HTML | Design Form
   • HTML | Paragraph
   • HTML | style attribute
   • HTML | Doctypes
   • HTML | Color Styles and HSL
   • HTML | Object tag
   • TAG ARCHIVES: HTML
   • XML | Basics
   • Displaying XML Using CSS
   • Displaying XML Using XSLT
   • Difference between Scripting and Programming Languages
   • Java Programming Language
   • Introduction to Java Servlets
   • Servlet Collaboration
   • Difference between Servlet and JSP
   • Java Applet Basics
   • Draw a ellipse and a rectangle in Java Applet

1. Object Oriented Programming and Design :
   • OOP Concepts
   • Class and Object
2. Markup Languages :
   • HTML and XML
   • Quizzes on Java Language
   • Java Multiple Choice Questions

OOPs and Scripting Languages :

Section 3: Programming Languages Concepts and TOC

1. Programming Languages Concepts :
   • Programming language concepts, paradigms and models.
   • Data: Data types, Operators,
     Expressions, Assignment. Flow of Control.
   • Control structures, I / O statements,
     User – defined and built – in functions, Parameter passing.
   • Principles, classes, inheritance, class hierarchies,
     polymorphism, dynamic binding,
     reference semantics and their implementation.
   • Principles, functions, lists,
     types and polymorphisms, higher order functions,
     lazy evaluation, equations and pattern matching.
   • Principles, horn clauses and their execution,
     logical variables, relations, data structures,
     controlling the search order, program development in prolog,
     implementation of prolog, example programs in prolog.
   • Principles of parallelism, coroutines,
     communication and execution.
   • Parallel Virtual Machine (PVM) and
     Message Passing Interface (MPI) routines and calls.
   • Parallel programs in PVM paradigm as well as
     MPI paradigm for simple problems like matrix multiplication.
   • Preconditions, post-conditions,
     axiomatic approach for semantics, correctness,
     denotational semantics.
2. Theory of Computation :
   • Finite Automata, Pushdown Automata.
     Non-determinism and NFA, DPDA, and PDAs and
     languages accepted by these structures.
   • Grammars, Languages – types of grammars – type 0,
     type 1, type 2, and type 3.
   • The relationship between types of grammars,
     and finite machines.
     Pushdown automata and Context Free Grammars.
   • Lexical Analysis-regular expressions and regular languages.
   • LEX package on Unix. Conversion of NFA to DFA.
     Minimizing the number of states in a DFA Compilation
     and Interpretation.
3. Compiler Design :
   • Compiler structure, compiler construction tools,
     compilation phases, Bootstrap compilers.
   • Context free grammars. Parsing and parse trees.
   • Representation of parse (derivation) trees
     as rightmost and leftmost derivations.
   • Bottom up parsers-shift-reduce, operator precedence, and LR.
   • YACC package on Unix system. Top down parsers-left recursion
     and its removal. Recursive descent parser. Predictive parser
   • Intermediate codes – Quadruples, triples.
     Intermediate code generation, code generation. Code optimization.

1. Programming Languages Concepts :
2. Theory of Computation :
   • Introduction of Theory of Computation
   • Finite Automata Introduction
   • Chomsky Hierarchy
   • Regular Expressions, Regular Grammar and Regular Languages
   • Pumping Lemma
   • Designing Finite Automata from Regular Expression
   • NFA with epsilon move to DFA Conversion
   • Conversion from NFA to DFA
   • Minimization of DFA
   • Regular expression from finite automata
   • Union & Intersection of Regular languages with CFL
   • Mealy and Moore Machines
   • DFA of a string with at least two 0’s and at least two 1’s
   • Star Height of Regular Expression/Language
   • Pushdown Automata
   • Pushdown Automata Acceptance by Final State
   • Construct Pushdown Automata for given languages
   • Construct Pushdown Automata for all length palindrome
   • Closure Properties of Context Free Languages
   • Ambiguity in Context free Grammar and Context free Languages
   • Simplifying Context Free Grammars
   • Converting Context Free Grammar to Chomsky Normal Form
   • Converting Context Free Grammar to Greibach Normal Form
   • Relationship between grammar and language
3. Compiler Design :
   • Compiler vs Interpreter
   • Introduction of Compiler design
   • Phases of a Compiler
   • Symbol Table in Compiler
   • Error Handling in Compiler Design
   • Error detection and Recovery in Compiler
   • Lexical Analysis
   • C program to detect tokens in a C program
   • Flex (Fast Lexical Analyzer Generator)
   • Classification of Context Free Grammars
   • Ambiguous Grammar
   • Why FIRST and FOLLOW?
   • FIRST Set in Syntax Analysis
   • FOLLOW Set in Syntax Analysis
   • First and Follow sets of given grammar
   • Introduction to Syntax Analysis
   • Parsing | Set 1
   • Parsing | Set 2
   • Parsing | Set 3
   • Shift Reduce Parser in Compiler
   • Classification of top down parsers
   • Operator grammar and precedence parser
   • Syntax Directed Translation
   • Runtime Environments
   • Intermediate Code Generation
   • Three address code in Compiler
   • Code Optimization
   • Introduction of Object Code
   • Data flow analysis in Compiler

1. Programming Languages Concepts :
2. Theory of Computation :
   • Regular languages and finite automata
   • Practice problems on finite automata
   • Practice problems on finite automata | Set 2
   • Context free languages and Push-down automata
   • Automata Theory | Set 1
   • Automata Theory | Set 2
   • Automata Theory | Set 3
   • Automata Theory | Set 4
   • Automata Theory | Set 5
   • Automata Theory | Set 6
3. Compiler Design :
   • MCQ on Memory allocation and compilation process
   • Lexical analysis
   • Parsing and Syntax directed translation
   • Code Generation and Optimization
   • Compiler Theory | Set 1
   • Compiler Theory | Set 2

1. Programming Languages Concepts :
2. Theory of Computation :
   • Video – NPTEL TOC Lectures
   • Video – TOC Lectures by Ravindrababu Ravula
   • Notes – NFA and DFA
   • Notes – Non Regular language
   • Notes – PDA
3. Compiler Design :
   • Video – NPTEL Lectures
   • Video – Lectures by Ravindrababu Ravula
   • Notes – Bivas Mitra IITgp
   • Notes – LR Parsing
   • Notes – Syntax Directed Translation
   • Notes – Intermediate Code Generation

Section 4: Operating Systems

• Introduction, Memory management,
  Support for concurrent process, Scheduling,
  System deadlock, Multiprogramming system,
  I/O management, Distributed operating systems,
  Study of Unix and Windows NT.

1. Processes, threads, CPU scheduling :
   • What happens when we turn on computer?
   • Introduction of Operating System
   • Types of Operating Systems
   • Dual Mode operations in OS
   • 32-bit and 64-bit operating systems
   • Real time systems
   • Process Management | Introduction
   • States of a process
   • Process Table and Process Control Block (PCB)
   • Process Scheduler
   • Difference between dispatcher and scheduler
   • Process Management | CPU Scheduling
   • Program for FCFS Scheduling | Set 1
   • Program for FCFS Scheduling | Set 2 (Processes with different arrival times)
   • Convoy Effect in Operating Systems
   • Program for preemptive priority CPU scheduling
   • Program for Round Robin scheduling | Set 1
   • Program for Shortest Job First (or SJF) scheduling | Set 1 (Non- preemptive)
   • Program for Shortest Job First (SJF) scheduling | Set 2 (Preemptive)
   • Shortest Job First scheduling with predicted burst time
   • Highest Response Ratio Next (HRRN) Scheduling
   • Program for Priority Scheduling | Set 1
   • Priority Scheduling with different arrival time | Set 2
   • Multilevel Queue Scheduling
   • Multilevel Feedback Queue Scheduling
   • Multiple-Processor Scheduling
   • Measure the time spent in context switch
   • Starvation and Aging in Operating Systems
   • Introduction of System Call
   • Operating System | Thread
   • Threads and its types
   • Multi threading models
   • Benefits of Multithreading
   • Process-based and Thread-based Multitasking
   • User Level thread Vs Kernel Level thread
   • Microkernel
   • Monolithic Kernel and key differences from Microkernel
   • Difference between multitasking, multithreading and multiprocessing
2. Interprocess communication, concurrency and synchronization :
   • Process Synchronization | Introduction
   • Critical Section
   • Inter Process Communication
   • IPC using Message Queues
   • IPC through shared memory
   • Semaphores in operating system
   • Mutex vs Semaphore
   • Lock variable synchronization mechanism
   • Peterson’s Algorithm for Mutual Exclusion | Set 1 (Basic C implementation)
   • Peterson’s Algorithm for Mutual Exclusion | Set 2 (CPU Cycles and Memory Fence)
   • Peterson’s Algorithm (Using processes and shared memory)
   • Readers-Writers Problem | Set 1 (Introduction and Readers Preference Solution)
   • Reader-Writers solution using Monitors
   • Process Synchronization | Monitors
   • Dining-Philosophers Solution Using Monitors
   • Dining Philosopher Problem Using Semaphores
   • Dekker’s algorithm
   • Bakery Algorithm
   • Priority Inversion : What the heck !
   • What’s difference between Priority Inversion and Priority Inheritance ?
3. Deadlock :
   • Process Management | Deadlock Introduction
   • Deadlock Prevention And Avoidance
   • Deadlock Detection And Recovery
   • Resource Allocation Graph (RAG)
   • Banker’s Algorithm
   • Program for Banker’s Algorithm | Set 1 (Safety Algorithm)
   • Banker’s Algorithm : Print all the safe state
   • Deadlock detection algorithm
4. Main memory management :
   • Mapping virtual address to physical addresses
   • Memory Management |Partition Allocation Method
   • Paging
   • Page Table Entries
   • Inverted Page Table
   • Segmentation
   • Program for First Fit algorithm in Memory Management
   • Program for Next Fit algorithm in Memory Management
   • Working with Shared Libraries | Set 1
   • Static and Dynamic Libraries | Set 1
   • Buddy System
   • Allocating kernel memory
5. Virtual memory :
   • Virtual Memory
   • Secondary memory – Hard disk drive
   • Page Fault Handling
   • Page Replacement Algorithms
   • Program for Optimal Page Replacement Algorithm
   • Techniques to handle Thrashing
   • What exactly Spooling is all about?
   • Overlays in Memory Management
   • Swap Space
6. I/O Management and Distributed OS :
   • File Systems
   • File Directory | Path Name
   • File Allocation Methods
   • Difference between FAT32, exFAT, and NTFS File System
   • Disk Scheduling Algorithms
   • CATEGORY ARCHIVES: OPERATING SYSTEMS
   • Last Minute Notes – Operating Systems
7. Study of Unix and Windows NT :

1. Processes, threads, CPU scheduling :
   • Process Management
   • CPU Scheduling
2. Inter-process communication, concurrency and synchronization :
   • Concurrency and synchronization
3. Deadlock :
   • Deadlock
4. Main memory management :
   • Memory Management
5. Virtual memory :
   • Virtual Memory | Questions
6. I/O Management and Distributed OS :
   • Input Output Systems
7. Study of Unix and Windows NT :
   • Unix

Operating Systems :

• Video – NPTEL Lectures
• Video – Lectures by Ravindrababu Ravula
• Notes – VirginiaTech Univ. Web resource
• Notes – Galvin Lecture Slides
• Book – William Stallings Practice Problems and Solutions
• Notes – Virtual Memory and Cache
• Notes – Segmentation and Paging
• Notes – Some Interesting problems on Virtual memory

Section 5: Database Management Systems

• Database Concepts, ER diagrams,
  Data Models, Design of Relational Database
• Normalisation,
• SQL and QBE, Query Processing and Optimisation,
  Centralised and Distributed Database, Security,
  Concurrency and Recovery in Centralised
  and Distributed Database Systems
• Object Oriented Database Management Systems
  (Concepts, Composite objects, Integration
  with RDBMS applications), ORACLE.

1. Introduction and ER model :
   • Database Management System – Introduction | Set 1
   • Database Management System Introduction | Set 2 (3-Tier Architecture)
   • DBMS Architecture 2-Level, 3-Level
   • Need for DBMS
   • Advantages of DBMS over File system
   • Data Abstraction and Data Independence
   • ER Model
   • Recursive Relationships
   • Minimization of ER Diagram
   • Enhanced ER Model
   • Mapping from ER Model to Relational Model
2. Data Models and Relational Model :
   • Relational Model
   • Relational Algebra – Overview
   • DBMS | Anomalies in Relational Model
   • Relational Model Introduction and Codd Rules
   • Keys in Relational Model (Candidate, Super, Primary, Alternate and Foreign)
   • Relational Algebra-Basic Operators
   • Relational Algebra – Extended Operators
   • DBMS | How to solve Relational Algebra problems for GATE -1
   • DBMS | How to solve Relational Algebra problems for GATE -2
3. Database design (integrity constraints, normal forms) :
   • Database Normalization | Introduction
   • Database Normalization | Normal Forms
   • Functional Dependency and Attribute Closure
   • Finding Attribute Closure and Candidate Keys using Functional Dependencies
   • Number of possible Superkeys
   • Lossless Decomposition
   • Dependency Preserving Decomposition
   • Lossless Join and Dependency Preserving Decomposition
   • DBMS | How to find the highest normal form of a relation
   • Equivalence of Functional Dependencies
   • Armstrong’s Axioms in Functional Dependency
   • Canonical Cover
   • Denormalization in Databases
4. Concurrency and Recovery :
   • Concurrency Control -Introduction
   • Database Recovery Techniques
   • ACID Properties in DBMS
   • Log based recovery
   • Transaction Isolation Levels in DBMS
   • Conflict Serializability
   • Precedence Graph For Testing Conflict Serializability
   • How to test if two schedules are View Equal or not ?
   • Recoverability of Schedules
   • Deadlock in DBMS
   • Starvation in DBMS
   • Concurrency Control Protocols | Lock Based Protocol
   • Concurrency Control Protocol | Two Phase Locking (2-PL)-I
   • Concurrency Control Protocol | Two Phase Locking (2-PL)-II
   • Concurrency Control Protocol | Two Phase Locking (2-PL)-III
   • Concurrency Control Protocol | Thomas Write Rule
   • Concurrency Control Protocols | Timestamp Ordering Protocols
   • Concurrency Control Protocol | Multiple Granularity Locking
   • Concurrency Control Protocol | Graph Based Protocol
   • Introduction to TimeStamp and Deadlock Prevention Schemes
5. SQL and QBE :
   • Structured Query Language (SQL)
   • Inner VS Outer Join
   • Having Vs Where Clause
   • Database Objects
   • Nested Queries in SQL
   • SQL Tutorial
6. Oracle :

1. Introduction and ER model :
   • ER and Relational Models
   • Database Design (Normal Forms)
   • Transactions and concurrency control
   • SQL

Database Management Systems :

• Video – NPTEL Lectures
• Notes – Lecture Slides Silberschatz, Korth and Sudarshan
• Notes – Lecture Slides Raghu Ramakrishnan and Johannes Gehrke
• Notes – Stanford DBMS course Lecture Slides
• Notes – Jeff Ullman’s Lecture Slides
• Notes – Canonical Cover

Section 6: Computer Organization and Microprocessor

• Combinational Circuit Design,
  Sequential Circuit Design
• Hardwired and Micro Programmed processor design,
  Instruction formats, Addressing modes,
  Memory types and organisation,
  Interfacing peripheral devices, Interrupts
• Microprocessor architecture,
  Instruction set and Programming (8085, P – III / P – IV),
  Microprocessor applications.

1. Combinational Circuit Design :
   • Half Adder
   • Full Adder
   • Half Subtractor
   • Full Subtractor
   • Half Adder and Half Subtractor using NAND NOR gates
   • Encoders and Decoders
   • Encoder
   • Binary Decoder
   • Combinational circuits using Decoder
   • Multiplexers
   • Carry Look-Ahead Adder
   • Parallel Adder & Parallel Subtractor
   • BCD Adder
   • Magnitude Comparator
   • BCD to 7 Segment Decoder
   • Programmable Logic Array
   • Programming Array Logic
   • Read-Only Memory (ROM)
2. Sequential Circuit Design :
   • Introduction of Sequential Circuits
   • Flip-flop types and their Conversion
   • Synchronous Sequential Circuits
   • Counters
   • n-bit Johnson Counter
   • Ripple Counter
   • Design counter for given sequence
   • Master Slave JK Flip Flop
   • Asynchronous Sequential Circuits
   • Shift Registers
   • Design 101 sequence detector
   • Amortized analysis for increment in counter
3. Hardwired and Microprogrammed processor Design :
   • Hardwired v/s Micro-programmed Control Unit
4. Instruction Formats and Addressing Modes :
   • Von Neumann architecture
   • Basic Computer Instructions
   • Instruction Formats (Zero, One, Two and Three Address Instruction)
   • Problem Solving on Instruction Format
   • Addressing Modes
   • Machine Instructions
   • Difference between CALL and JUMP instructions
   • Simplified Instructional Computer (SIC)
   • Flynn’s taxonomy
   • Generations of computer
   • Pipelining | Set 1 (Execution, Stages and Throughput)
   • Pipelining | Set 2 (Dependencies and Data Hazard)
   • Pipelining | Set 3 (Types and Stalling)
   • Different Instruction Cycles
   • Micro-Operation
5. Memory organization and Interrupts :
   • Cache Memory
   • Cache Organization | Introduction
   • What’s difference between CPU Cache and TLB?
   • Types of computer memory (RAM and ROM)
   • Different Types of RAM
   • I/O Interface (Interrupt and DMA Mode)
   • Priority Interrupts | (S/W Polling and Daisy Chaining)
   • Asynchronous input output synchronization
   • Clusters In Computer Organisation
6. Microprocessor and 8085 :
   • Microprocessor Tutorials

Computer Organization and Microprocessor :

• Digital Logic
• Computer Organization and Architecture
• Microprocessor

Computer Organization and Microprocessor :

• Video – NPTEL Lectures: Digital logic
• Video – Lectures by Ravindrababu Ravula: Digital logic
• Video – NPTEL Lectures: CO
• Notes – Pipelining
• Notes – Cache Memory
• Notes – Cache Associativity

Section 7: Data Transmission and Computer Networks

• Analog and Digital transmission,
  Asynchronous and Synchronous transmission,
  Transmission media, Multiplexing and Concentration,
  Switching techniques, Polling.
• Topologies, Networking Devices, OSI Reference Model,
  Protocols for – (i) Data link layer, (ii) Network layer,
  (iii) Transport layer, TCP / IP protocols,
  Networks security, Network administration.

1. Type of Transmission and Media :
   • Types of Transmission Media
   • Data Communication | Transmission Impairment
   • Transmission Modes in Computer Networks (Simplex, Half-Duplex and Full-Duplex)
2. Switching Techniques and Polling :
   • Switching techniques: Message switching
   • Circuit Switching
   • Packet Switching and Delays
   • Circuit Switching VS Packet Switching
3. Introduction of Computer Network and OSI Model :
   • Basics of Computer Networking
   • Network Topologies
   • Types of area networks – LAN, MAN and WAN
   • MANET: Mobile Ad hoc Network
   • Types of Transmission Media
   • Transmission Modes in Computer Networks (Simplex, Half-Duplex and Full-Duplex)
   • Collision Domain and Broadcast Domain
   • Redundant link problems
   • Digital Subscriber Line (DSL)
   • What is Scrambling?
   • Difference between Unipolar, Polar and Bipolar Line Coding Schemes
   • Analog to digital conversion
   • Digital to Analog Conversion
   • Analog to Analog Conversion (Modulation)
   • Difference between Broadband and Baseband Transmission
   • Let’s experiment with Networking
   • Layers of OSI Model
   • TCP/IP Model
   • Network Devices (Hub, Repeater, Bridge, Switch, Router, Gateways and Brouter)
4. Data Link Layer :
   • Multiple Access Protocols
   • P2P(Peer To Peer) File Sharing
   • Framing In Data Link Layer
   • LAN Technologies | ETHERNET
   • Ethernet Frame Format
   • Difference between Byte stuffing and Bit stuffing
   • Hamming Code
   • Carrier sense multiple access (CSMA)
   • Controlled Access Protocols
   • Back-off Algorithm for CSMA/CD
   • Collision Detection in CSMA/CD
   • Efficiency of CSMA/CD
   • Efficiency Of Token Ring
   • Computer Networks | Error Detection
   • Stop and Wait ARQ
   • Sliding Window Protocol | Set 1 (Sender Side)
   • Sliding Window Protocol | Set 2 (Receiver Side)
   • Sliding Window Protocol | Set 3 (Selective Repeat)
   • Sliding Window protocols Summary With Questions
   • Program to remotely Power On a PC over the internet using the Wake-on-LAN protocol
   • Program to calculate the Round Trip Time (RTT)
   • Introduction of MAC Address
   • Collision Avoidance in wireless networks
   • Maximum data rate (channel capacity) for noiseless and noisy channels
5. Network Layer :
   • Internetworking
   • Line Configuration in Computer Networks
   • Difference between Unicast, Broadcast and Multicast
   • Collision Domain and Broadcast Domain
   • IP Addressing | Introduction and Classful Addressing
   • Network Layer | Introduction and IPv4 Datagram Header
   • Network Layer | Ipv4 Datagram Fragmentation and Delays
   • Fragmentation at Network Layer
   • Internet Protocol v6 | IPv6
   • Internet Protocol version 6 (IPv6) Header
   • IP Addressing | Classless Addressing
   • Supernetting
   • Computer Networks | Longest Prefix Matching in Routers
   • Program to determine class, Network and Host ID of an IPv4 address
   • C Program to find IP Address, Subnet Mask & Default Gateway
   • Network address translation (NAT)
   • Types of Network address translation (NAT)
   • Classification of Routing Algorithms – Set 1
   • Types of routing – Set 2
   • Classes of routing protocols – Set 3
   • Distance vector routing v/s Link state routing
   • Fixed and Flooding Routing algorithms
   • Routing v/s Routed Protocols
   • Unicast Routing – Link State Routing
   • Routing Protocols Set 1 (Distance Vector Routing)
   • Route Poisoning and Count to infinity problem
   • Onion Routing
   • Router on a stick
   • Internet Control Message Protocol (ICMP) | Computer Networks
   • Hot Standby Router Protocol (HSRP)
   • OSPF protocol fundamentals
   • OSPF protocol States
   • OSPF router roles and configuration
   • Root Bridge Election in Spanning Tree Protocol
   • Types of Spanning Tree Protocol (STP)
   • EIGRP fundamentals
   • Features of Enhanced Interior Gateway Routing Protocol (EIGRP)
   • Routing Information Protocol (RIP)
   • Link state advertisement (LSA)
   • Administrative Distance (AD) and Autonomous System (AS)
   • Circuit Switching
   • Packet Switching and Delays
   • Differences between Virtual Circuits & Datagram Networks
   • Computer Network | Circuit Switching VS Packet Switching
   • Traceroute
   • How ARP works?
   • ARP, Reverse ARP(RARP), Inverse ARP(InARP), Proxy ARP and Gratuitous ARP
   • Packet flow in the same network
   • Packet flow in different network
   • What’s difference between Ping and Traceroute?
6. Transport Layer :
   • Transport Layer responsibilities
   • Congestion Control
   • Leaky Bucket Algorithm
   • TCP Congestion Control
   • TCP 3-Way Handshake Process
   • TCP Connection Establishment
   • TCP Connection Termination
   • Error Control in TCP
   • TCP Timers
   • User Datagram Protocol (UDP)
   • Multiplexing and Demultiplexing in Transport Layer
7. Network Security :
   • Basic Network Attacks
   • Types of Viruses
   • Introduction to Firewall
   • Deniel of Service and Prevention
   • Digital Signatures and Certificates
   • LZW (Lempel–Ziv–Welch) Compression technique
   • RC4 Encryption Algorithm
   • RSA Algorithm in Cryptography
   • RSA Algorithm using Multiple Precision Arithmetic Library
   • Weak RSA decryption with Chinese-remainder theorem
   • Implementation of Diffie-Hellman Algorithm
   • DNA Cryptography
   • Port security
   • Unicode
   • Message Authentication Codes
   • How message authentication code works?
   • Hash Functions in System Security
   • The CIA triad
   • Image Steganography
   • Access-lists (ACL)
   • Last Minute Notes – Computer Networks

Data Transmission and Computer Networks :

• Computer Networks
• Data Link Layer
• Network Layer
• IP Addressing
• Transport Layer
• Application Layer
• Network Security

Data Transmission and Computer Networks :

• Video – NPTEL Lectures
• Video – Lectures by Ravindrababu Ravula
• Notes – Lecture Notes IIT Kanpur
• Notes – Web Resources on Computer Networks by Tanenbaum
• Visual – Sliding Window Animation

Section 8: Software Engineering

• Software development models,
  Requirement analysis and specifications, Software design
• Programming techniques and tools
• Software validation and quality assurance techniques
• Software maintenance and advanced concepts, Software management.

1. Software Models :
   • Classical Waterfall Model
   • Iterative Waterfall Model
   • Incremental process model
   • Prototyping Model
   • COCOMO Model
   • Spiral Model
   • Rapid application development model (RAD)
   • RAD Model vs Traditional SDLC
2. Requirement Analysis and Specifications :
   • Classification of Software Requirements
   • Project size estimation techniques
   • Requirements Engineering Process
3. Programming Techniques and Tools :
4. Software Validation and QAT :
   • Classification of Software
   • Software Testing | Basics
   • Black box testing
   • White box Testing
   • Requirements Elicitation
   • Challenges in eliciting requirements
   • Capability maturity model (CMM)
   • Debugging
5. Software Maintenance and Management :
   • Project Management Process
   • System configuration management

Software Engineering :

• Software Engineering

Software Engineering :

Section 9: Computer Graphics

• Display systems, Input devices,
  2D Geometry, Graphic operations, 3D Graphics,
  Animation, Graphic standard, Applications.
• Concepts, Storage Devices,
  Input Tools, Authoring Tools, Application, Files.

1. Display System and Input Devices :
   • Vector vs Raster Graphics
   • Segments in Computer Graphics
   • A-Buffer Method
   • Z-Buffer or Depth-Buffer method
   • Back-Face Detection Method
2. Graphics Operations and 3D Graphics :
   • 2D Transformation in Computer Graphics | Set 1 (Scaling of Objects)
   • 2D Transformation | Rotation of objects
   • Point Clipping Algorithm in Computer Graphics
   • Line Clipping | Set 1 (Cohen–Sutherland Algorithm)
   • Polygon Clipping | Sutherland–Hodgman Algorithm
   • Snowflakes Fractal
   • Koch Curve or Koch Snowflake
   • Klee’s Algorithm (Length Of Union Of Segments of a line)
   • Cubic Bezier Curve
   • Fractals in C/C++
   • DDA Line generation Algorithm in Computer Graphics
   • Bresenham’s Line Generation Algorithm
   • Bresenham’s circle drawing algorithm
   • Neighbors of a point on a circle using Bresenham’s algorithm
   • Bresenham’s Algorithm for 3-D Line Drawing
   • Mid-Point Line Generation Algorithm
   • Program to find line passing through 2 Points
   • Anti-aliased Line | Xiaolin Wu’s algorithm
   • Mid-Point Circle Drawing Algorithm
   • Boundary Fill Algorithm
   • Draw a circle without floating point arithmetic
   • Chain Code for 2D Line
3. Storage Devices and Tools :

Computer Graphics :

Computer Graphics :

Section 10: Artificial Intelligence

• Definitions, AI approach for solving problems.
• Automated Reasoning with prepositional logic
  and predicate logic-fundamental proof procedure,
  refutation, resolution, refinements to resolution
  (ordering / pruning / restriction strategies).
• State space representation of problems,
  bounding functions, breadth first, depth first, A, A*, AO*, etc.
  Performance comparison of various search techniques.
• Frames, scripts, semantic nets, production systems,
  procedural representations. Prolog programming.
• Components of an expert system, Knowledge representation
  and Acquisition techniques, Building expert system and Shell.
• RTNs, ATNs, Parsing of Ambiguous CFGs.
  Tree Adjoining Grammars (TAGs).
• Systems approach to planning, Designing,
  Development, Implementation and Evaluation of MIS.
• Decision-making processes, evaluation of DSS,
  Group decision support system and case studies,
  Adaptive design approach to DSS development,
  Cognitive style in DSS,
  Integrating expert and Decision support systems.

Artificial Intelligence :

• Getting started with Machine Learning
• Artificial Intelligence | An Introduction
• Machine Learning
• An introduction to Machine Learning | Set 2
• Introduction to Data in Machine Learning
• Introduction to Deep Learning
• Demystifying Machine Learning
• Machine Learning – Applications
• Machine Learning and Artificial Intelligence
• Difference between Machine learning and Artificial Intelligence
• Agents in Artificial Intelligence
• Types of Learning – Supervised Learning
• Types of Learning – Part 2
• Supervised and Unsupervised learning
• Reinforcement learning
• Regression and Classification | Supervised Machine Learning
• Logistic Regression
• Multivariate Regression
• Confusion Matrix in Machine Learning
• A single neuron neural network
• Clustering in Machine Learning
• Different Types of Clustering Algorithm
• K means Clustering – Introduction
• Analysis of test data using K-Means Clustering
• Introduction to Artificial Neutral Networks | Set 1
• Introduction to Artificial Neural Network | Set 2
• Introduction to ANN (Artificial Neural Networks) | Set 3 (Hybrid Systems)
• Fuzzy Logic | Introduction
• Fuzzy Logic | Set 2 (Classical and Fuzzy Sets)
• Machine Learning
• Fuzzy Logic and Misc

Artificial Intelligence :

Artificial Intelligence :