1 |
Digital Logic |
Test - 1
Test - 2
Test - Full
|
Boolean Algebra, Minimization, K-Map And Combinational
Circuits
Combinational Circuits And Sequential Circuits
Complete Syllabus
|
2 |
Computer
Organization
And
Architecture |
Test - 1
Test - 2
Test - 3
Test - Full
|
Number System
Cache Memory
Assembly, Addressing Mode, Instruction Set Architecture
And Instruction Pipeline
Complete Syllabus (Including I/O Interface(Interrupt And
DMA), ALU, Data-Path And Control Unit)
|
3 |
Database
Management
System |
Test - 1
Test - 2
Test - 3
Test - Full
|
Relational Model, Structure Query Language
Relational Algebra And Normalization
Indexing, B-Tree, B+-Tree, Hashing, Transaction And
Concurrency Control
Complete Syllabus(Including ER-Model)
|
4 |
Operating
System |
Test - 1
Test - 2
Test - 3
Test - Full
|
Basics Of OS, Process Management, Thread
Management, CPU - Scheduling.
Inter-Process Communication, Concurrency And
Synchronization. And Deadlock.
Memory Management, Virtual Memory And File Systems.
Complete Syllabus
|
5 |
Computer
Network |
Test - 1
Test - 2
Test - 3
Test - Full
|
Layered Model: OSI And TCP/IP, Data Link
Layer (Framing, Error Control And Flow Control)
Data Link Layer (CSMA/CD, Ethernet 802.3, CSMA/CA
And Wi-Fi 802.11), Network Devices, Routers And Routing
Algorithms (Distance Vector, Link State) And Ipv4
Addressing, Formatting, CIDR And Basic Of Ipv6.
TCP/UDP, Sockets, Congestion Control, Application Layer
Protocols (DNS, SMTP, POP, FTP, HTTP) And Networkx
Security (Authentication, Basics Of Public Key And Private
Key Cryptography, Digital Signatures And Certificates).
Complete Syllabus
|
6 |
Data Structure
And
Algorithms |
Test - 1
Test - 2
Test - 3
Test - 4
Test - Full
|
Bubble Sort, Selection Sort, Insertion Sort, Heap Sort, Basic Concept Of Asymptotic Notation, Time Complexity
Recurrence Relation (Iterative, Master's And Tree Method), Complexity Of Code, Merge Sort, Quick Sort, Counting Sort, Radix Sort, Searching(Linear & Binary)
Stack, Recursion, Queue, Linked list, Binary Tree, Binary
Search Tree, Construction Of AVL Tree,
AVL Tree, Greedy & Dynamic Approach, 0/1 Knapsack Problem, Fractional Knapsack Problem, Job Scheduling With Deadline, Huffman Encoding, Dijkstra's & Bellman
Ford Algorithm, LCS Problem,Matrix Chain Multiplication
Problem, Optimal File Merge Pattern,
Complete Syllabus
|
7 |
Discrete
Mathematics |
Test - 1
Test - 2
Test - 3
Test - 4
Test - 5
Test - Full
|
Set Theory & Properties Of Relation & Equivalence
Relation
Partial Order Relation, Lattice & Function
Algebraic System (Group Theory)
Graph Theory
Logic
Complete Syllabus
|
8 |
Theory Of
Computation |
Test - 1
Test - 2
Test - 3
Test - Full
|
Chomsky Classification Of Grammar, Regular Expression, Finite Automata, Regular Language, DFA, NFA, Minimization Of DFA, NFA To DFA Conversion
Properties Of Regular Language, Pumping Lemma For Regular Language, CFL, PDA, CFG, Properties Of CFL
Pumping Lemma For CFL, Construction Of TM, Types Of TM, Decidability And Undecibility Of Language, Countable Finite And Infinite Language
Complete Syllabus
|
9 |
Compiler
Design |
Test - 1
Test - Full
|
Parameter Passing Techniques, Lexical Analysis, Syntax Analysis(LL, LR, SLR,CLR, LALR)
Complete Syllabus (Including Syntax-Directed Translation. Runtime Environments. Intermediate Code Generation.)
|
10 |
Mathematics |
Test - 1
Test - 2
Test - 3
Test - 4
Test - Full
|
Matrices
Calculus
Permutation & Combination
Probability
Complete Syllabus
|