Spaces:
Sleeping
Sleeping
| { | |
| "General Aptitude": [ | |
| "Verbal Aptitude", | |
| "Quantitative Aptitude", | |
| "Analytical Aptitude", | |
| "Spatial Aptitude" | |
| ], | |
| "Engineering Mathematics": [ | |
| "Discrete Mathematics", | |
| "Linear Algebra", | |
| "Calculus", | |
| "Probability and Statistics" | |
| ], | |
| "Digital Logic": [ | |
| "Boolean algebra", | |
| "Combinational and sequential circuits", | |
| "Minimization", | |
| "Number representations and computer arithmetic" | |
| ], | |
| "Computer Organization and Architecture": [ | |
| "Machine instructions and addressing modes", | |
| "ALU, data-path and control unit", | |
| "Instruction pipelining, pipeline hazards", | |
| "Memory hierarchy: cache, main memory and secondary storage", | |
| "I/O interface" | |
| ], | |
| "Programming and Data Structures": [ | |
| "Programming in C", | |
| "Recursion", | |
| "Arrays, stacks, queues, linked lists", | |
| "Trees, binary search trees, binary heaps", | |
| "Graphs" | |
| ], | |
| "Algorithms": [ | |
| "Searching, sorting, hashing", | |
| "Asymptotic worst case time and space complexity", | |
| "Algorithm design techniques: greedy, dynamic programming and divide-and-conquer", | |
| "Graph traversals, minimum spanning trees, shortest paths" | |
| ], | |
| "Theory of Computation": [ | |
| "Regular expressions and finite automata", | |
| "Context-free grammars and push-down automata", | |
| "Regular and context-free languages, pumping lemma", | |
| "Turing machines and undecidability" | |
| ], | |
| "Compiler Design": [ | |
| "Lexical analysis, parsing, syntax-directed translation", | |
| "Runtime environments", | |
| "Intermediate code generation", | |
| "Local optimisation, Data flow analyses" | |
| ], | |
| "Operating System": [ | |
| "System calls, processes, threads", | |
| "Inter-process communication, concurrency and synchronization", | |
| "Deadlock", | |
| "CPU and I/O scheduling", | |
| "Memory management and virtual memory", | |
| "File systems" | |
| ], | |
| "Databases": [ | |
| "ER-model", | |
| "Relational model: relational algebra, tuple calculus, SQL", | |
| "Integrity constraints, normal forms", | |
| "File organization, indexing", | |
| "Transactions and concurrency control" | |
| ], | |
| "Computer Networks": [ | |
| "Concept of layering: OSI and TCP/IP Protocol Stacks", | |
| "Basics of packet, circuit and virtual circuit-switching", | |
| "Data link layer: framing, error detection, Medium Access Control, Ethernet bridging", | |
| "Routing protocols: shortest path, flooding, distance vector and link state routing", | |
| "Fragmentation and IP addressing, IPv4, CIDR notation", | |
| "Transport layer: flow control and congestion control, UDP, TCP, sockets", | |
| "Application layer protocols: DNS, SMTP, HTTP, FTP, Email" | |
| ] | |
| } |