File size: 2,933 Bytes
1ffab5b
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
[
  "General Aptitude: Verbal",
  "General Aptitude: Quantitative",
  "General Aptitude: Analytical",
  "General Aptitude: Spatial",

  "Engineering Mathematics: Discrete Mathematics",
  "Engineering Mathematics: Linear Algebra",
  "Engineering Mathematics: Calculus",
  "Engineering Mathematics: Probability & Statistics",

  "Digital Logic: Boolean Algebra",
  "Digital Logic: Combinational Circuits",
  "Digital Logic: Sequential Circuits",
  "Digital Logic: Minimization",
  "Digital Logic: Number Representations & Arithmetic",

  "Computer Organization & Architecture: Machine Instructions & Addressing Modes",
  "Computer Organization & Architecture: ALU/Data-path & Control Unit",
  "Computer Organization & Architecture: Pipelining & Hazards",
  "Computer Organization & Architecture: Memory Hierarchy",
  "Computer Organization & Architecture: I/O (Interrupt & DMA)",

  "Programming & Data Structures: C Programming",
  "Programming & Data Structures: Recursion",
  "Programming & Data Structures: Arrays",
  "Programming & Data Structures: Stacks & Queues",
  "Programming & Data Structures: Linked Lists",
  "Programming & Data Structures: Trees & BSTs",
  "Programming & Data Structures: Heaps",
  "Programming & Data Structures: Graphs",

  "Algorithms: Searching",
  "Algorithms: Sorting",
  "Algorithms: Hashing",
  "Algorithms: Complexity Analysis",
  "Algorithms: Greedy Techniques",
  "Algorithms: Dynamic Programming",
  "Algorithms: Divide & Conquer",
  "Algorithms: Graph Traversals",
  "Algorithms: Minimum Spanning Trees",
  "Algorithms: Shortest Paths",

  "Theory of Computation: Regular Languages & Automata",
  "Theory of Computation: Context-Free Grammars & Push-down Automata",
  "Theory of Computation: Pumping Lemma",
  "Theory of Computation: Turing Machines & Undecidability",

  "Compiler Design: Lexical Analysis",
  "Compiler Design: Parsing",
  "Compiler Design: Syntax-Directed Translation",
  "Compiler Design: Intermediate Code Generation",
  "Compiler Design: Runtime Environments",
  "Compiler Design: Local Optimizations & Data-flow Analysis",

  "Operating Systems: Processes & Threads",
  "Operating Systems: IPC & Synchronization",
  "Operating Systems: Deadlock",
  "Operating Systems: CPU & I/O Scheduling",
  "Operating Systems: Memory Management & Virtual Memory",
  "Operating Systems: File Systems",

  "Databases: ER Model",
  "Databases: Relational Algebra & SQL",
  "Databases: Normal Forms & Integrity Constraints",
  "Databases: Indexing & File Organization",
  "Databases: Transactions & Concurrency Control",

  "Computer Networks: Layering (OSI & TCP/IP)",
  "Computer Networks: Switching (Packet/Circuit/Virtual)",
  "Computer Networks: Data Link Layer (Framing, MAC)",
  "Computer Networks: Routing Protocols",
  "Computer Networks: IP Addressing & Fragmentation",
  "Computer Networks: Transport Layer (UDP, TCP)",
  "Computer Networks: Application Layer Protocols"
]