Spaces:
Running
Running
Create labels.json
Browse files- labels.json +76 -0
labels.json
ADDED
@@ -0,0 +1,76 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
[
|
2 |
+
"General Aptitude: Verbal",
|
3 |
+
"General Aptitude: Quantitative",
|
4 |
+
"General Aptitude: Analytical",
|
5 |
+
"General Aptitude: Spatial",
|
6 |
+
|
7 |
+
"Engineering Mathematics: Discrete Mathematics",
|
8 |
+
"Engineering Mathematics: Linear Algebra",
|
9 |
+
"Engineering Mathematics: Calculus",
|
10 |
+
"Engineering Mathematics: Probability & Statistics",
|
11 |
+
|
12 |
+
"Digital Logic: Boolean Algebra",
|
13 |
+
"Digital Logic: Combinational Circuits",
|
14 |
+
"Digital Logic: Sequential Circuits",
|
15 |
+
"Digital Logic: Minimization",
|
16 |
+
"Digital Logic: Number Representations & Arithmetic",
|
17 |
+
|
18 |
+
"Computer Organization & Architecture: Machine Instructions & Addressing Modes",
|
19 |
+
"Computer Organization & Architecture: ALU/Data-path & Control Unit",
|
20 |
+
"Computer Organization & Architecture: Pipelining & Hazards",
|
21 |
+
"Computer Organization & Architecture: Memory Hierarchy",
|
22 |
+
"Computer Organization & Architecture: I/O (Interrupt & DMA)",
|
23 |
+
|
24 |
+
"Programming & Data Structures: C Programming",
|
25 |
+
"Programming & Data Structures: Recursion",
|
26 |
+
"Programming & Data Structures: Arrays",
|
27 |
+
"Programming & Data Structures: Stacks & Queues",
|
28 |
+
"Programming & Data Structures: Linked Lists",
|
29 |
+
"Programming & Data Structures: Trees & BSTs",
|
30 |
+
"Programming & Data Structures: Heaps",
|
31 |
+
"Programming & Data Structures: Graphs",
|
32 |
+
|
33 |
+
"Algorithms: Searching",
|
34 |
+
"Algorithms: Sorting",
|
35 |
+
"Algorithms: Hashing",
|
36 |
+
"Algorithms: Complexity Analysis",
|
37 |
+
"Algorithms: Greedy Techniques",
|
38 |
+
"Algorithms: Dynamic Programming",
|
39 |
+
"Algorithms: Divide & Conquer",
|
40 |
+
"Algorithms: Graph Traversals",
|
41 |
+
"Algorithms: Minimum Spanning Trees",
|
42 |
+
"Algorithms: Shortest Paths",
|
43 |
+
|
44 |
+
"Theory of Computation: Regular Languages & Automata",
|
45 |
+
"Theory of Computation: Context-Free Grammars & Push-down Automata",
|
46 |
+
"Theory of Computation: Pumping Lemma",
|
47 |
+
"Theory of Computation: Turing Machines & Undecidability",
|
48 |
+
|
49 |
+
"Compiler Design: Lexical Analysis",
|
50 |
+
"Compiler Design: Parsing",
|
51 |
+
"Compiler Design: Syntax-Directed Translation",
|
52 |
+
"Compiler Design: Intermediate Code Generation",
|
53 |
+
"Compiler Design: Runtime Environments",
|
54 |
+
"Compiler Design: Local Optimizations & Data-flow Analysis",
|
55 |
+
|
56 |
+
"Operating Systems: Processes & Threads",
|
57 |
+
"Operating Systems: IPC & Synchronization",
|
58 |
+
"Operating Systems: Deadlock",
|
59 |
+
"Operating Systems: CPU & I/O Scheduling",
|
60 |
+
"Operating Systems: Memory Management & Virtual Memory",
|
61 |
+
"Operating Systems: File Systems",
|
62 |
+
|
63 |
+
"Databases: ER Model",
|
64 |
+
"Databases: Relational Algebra & SQL",
|
65 |
+
"Databases: Normal Forms & Integrity Constraints",
|
66 |
+
"Databases: Indexing & File Organization",
|
67 |
+
"Databases: Transactions & Concurrency Control",
|
68 |
+
|
69 |
+
"Computer Networks: Layering (OSI & TCP/IP)",
|
70 |
+
"Computer Networks: Switching (Packet/Circuit/Virtual)",
|
71 |
+
"Computer Networks: Data Link Layer (Framing, MAC)",
|
72 |
+
"Computer Networks: Routing Protocols",
|
73 |
+
"Computer Networks: IP Addressing & Fragmentation",
|
74 |
+
"Computer Networks: Transport Layer (UDP, TCP)",
|
75 |
+
"Computer Networks: Application Layer Protocols"
|
76 |
+
]
|