Spaces:
Running
Running
Create fine_labels.json
Browse files- fine_labels.json +76 -0
fine_labels.json
ADDED
|
@@ -0,0 +1,76 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
{
|
| 2 |
+
"General Aptitude": [
|
| 3 |
+
"Verbal Aptitude",
|
| 4 |
+
"Quantitative Aptitude",
|
| 5 |
+
"Analytical Aptitude",
|
| 6 |
+
"Spatial Aptitude"
|
| 7 |
+
],
|
| 8 |
+
"Engineering Mathematics": [
|
| 9 |
+
"Discrete Mathematics",
|
| 10 |
+
"Linear Algebra",
|
| 11 |
+
"Calculus",
|
| 12 |
+
"Probability and Statistics"
|
| 13 |
+
],
|
| 14 |
+
"Digital Logic": [
|
| 15 |
+
"Boolean algebra",
|
| 16 |
+
"Combinational and sequential circuits",
|
| 17 |
+
"Minimization",
|
| 18 |
+
"Number representations and computer arithmetic"
|
| 19 |
+
],
|
| 20 |
+
"Computer Organization and Architecture": [
|
| 21 |
+
"Machine instructions and addressing modes",
|
| 22 |
+
"ALU, data-path and control unit",
|
| 23 |
+
"Instruction pipelining, pipeline hazards",
|
| 24 |
+
"Memory hierarchy: cache, main memory and secondary storage",
|
| 25 |
+
"I/O interface"
|
| 26 |
+
],
|
| 27 |
+
"Programming and Data Structures": [
|
| 28 |
+
"Programming in C",
|
| 29 |
+
"Recursion",
|
| 30 |
+
"Arrays, stacks, queues, linked lists",
|
| 31 |
+
"Trees, binary search trees, binary heaps",
|
| 32 |
+
"Graphs"
|
| 33 |
+
],
|
| 34 |
+
"Algorithms": [
|
| 35 |
+
"Searching, sorting, hashing",
|
| 36 |
+
"Asymptotic worst case time and space complexity",
|
| 37 |
+
"Algorithm design techniques: greedy, dynamic programming and divide-and-conquer",
|
| 38 |
+
"Graph traversals, minimum spanning trees, shortest paths"
|
| 39 |
+
],
|
| 40 |
+
"Theory of Computation": [
|
| 41 |
+
"Regular expressions and finite automata",
|
| 42 |
+
"Context-free grammars and push-down automata",
|
| 43 |
+
"Regular and context-free languages, pumping lemma",
|
| 44 |
+
"Turing machines and undecidability"
|
| 45 |
+
],
|
| 46 |
+
"Compiler Design": [
|
| 47 |
+
"Lexical analysis, parsing, syntax-directed translation",
|
| 48 |
+
"Runtime environments",
|
| 49 |
+
"Intermediate code generation",
|
| 50 |
+
"Local optimisation, Data flow analyses"
|
| 51 |
+
],
|
| 52 |
+
"Operating System": [
|
| 53 |
+
"System calls, processes, threads",
|
| 54 |
+
"Inter-process communication, concurrency and synchronization",
|
| 55 |
+
"Deadlock",
|
| 56 |
+
"CPU and I/O scheduling",
|
| 57 |
+
"Memory management and virtual memory",
|
| 58 |
+
"File systems"
|
| 59 |
+
],
|
| 60 |
+
"Databases": [
|
| 61 |
+
"ER-model",
|
| 62 |
+
"Relational model: relational algebra, tuple calculus, SQL",
|
| 63 |
+
"Integrity constraints, normal forms",
|
| 64 |
+
"File organization, indexing",
|
| 65 |
+
"Transactions and concurrency control"
|
| 66 |
+
],
|
| 67 |
+
"Computer Networks": [
|
| 68 |
+
"Concept of layering: OSI and TCP/IP Protocol Stacks",
|
| 69 |
+
"Basics of packet, circuit and virtual circuit-switching",
|
| 70 |
+
"Data link layer: framing, error detection, Medium Access Control, Ethernet bridging",
|
| 71 |
+
"Routing protocols: shortest path, flooding, distance vector and link state routing",
|
| 72 |
+
"Fragmentation and IP addressing, IPv4, CIDR notation",
|
| 73 |
+
"Transport layer: flow control and congestion control, UDP, TCP, sockets",
|
| 74 |
+
"Application layer protocols: DNS, SMTP, HTTP, FTP, Email"
|
| 75 |
+
]
|
| 76 |
+
}
|