course_id course_name
1 Digital Logic
2 Computer Organization
3 Engineering Mathemati
4 Programming and Data
5 Algorithms
6 Theory of Computation
7 Operating Systems
8 Computer Networks
9 Compiler Design
Courses
Section Topic
1 Discrete Mathematics
1 Discrete Mathematics
1 Discrete Mathematics
1 Discrete Mathematics
1 Discrete Mathematics
1 Discrete Mathematics
1 Discrete Mathematics
1 Discrete Mathematics
1 Discrete Mathematics
1 Discrete Mathematics
1 Discrete Mathematics
1. Engineering
Combinatorics
Mathematics
1. Engineering
Combinatorics
Mathematics
1. Engineering
Combinatorics
Mathematics
1. Engineering
Linear Algebra
Mathematics
1. Engineering
Linear Algebra
Mathematics
1. Engineering
Linear Algebra
Mathematics
1. Engineering
Linear Algebra
Mathematics
1. Engineering
Linear Algebra
Mathematics
1. Engineering
Calculus
Mathematics
1. Engineering
Calculus
Mathematics
1. Engineering
Calculus
Mathematics
1. Engineering
Calculus
Mathematics
1. Engineering
Calculus
Mathematics
1. Engineering Probability and
Mathematics Statistics
1. Engineering Probability and
Mathematics Statistics
1. Engineering Probability and
Mathematics Statistics
1. Engineering Probability and
Mathematics Statistics
1. Engineering Probability and
Mathematics Statistics
1. Engineering Probability and
Mathematics Statistics
1. Engineering Probability and
Mathematics Statistics
1. Engineering Probability and
Mathematics Statistics
1. Engineering Probability and
Mathematics Statistics
1. Engineering Probability and
Mathematics Statistics
1. Engineering Probability and
Mathematics Statistics
1. Engineering Probability and
Mathematics Statistics
2. Digital Logic Boolean Algebra
Combinational and
2. Digital Logic
Sequential Circuits
Combinational and
2. Digital Logic
Sequential Circuits
Combinational and
2. Digital Logic
Sequential Circuits
Combinational and
2. Digital Logic
Sequential Circuits
3. Computer Machine Instructions
Organization and and Addressing
Architecture Modes
3. Computer Machine Instructions
Organization and and Addressing
Architecture Modes
3. Computer Machine Instructions
Organization and and Addressing
Architecture Modes
3. Computer Machine Instructions
Organization and and Addressing
Architecture Modes
3. Computer Machine Instructions
Organization and and Addressing
Architecture Modes
3. Computer
Organization and Memory Hierarchy
Architecture
3. Computer
Organization and Memory Hierarchy
Architecture
3. Computer
Organization and Memory Hierarchy
Architecture
3. Computer
Organization and Memory Hierarchy
Architecture
3. Computer
Organization and Memory Hierarchy
Architecture
4. Programming and
Programming in C
Data Structures
4. Programming and
Recursion
Data Structures
4. Programming and
Arrays
Data Structures
4. Programming and
Stacks
Data Structures
4. Programming and
Queues
Data Structures
4. Programming and
Linked Lists
Data Structures
4. Programming and
Trees
Data Structures
4. Programming and
Binary Search Trees
Data Structures
4. Programming and
Binary Heaps
Data Structures
4. Programming and
Graphs
Data Structures
5. Algorithms Searching
5. Algorithms Sorting
5. Algorithms Hashing
Asymptotic
5. Algorithms
Complexity
Algorithm Design
5. Algorithms
Techniques
Algorithm Design
5. Algorithms
Techniques
Algorithm Design
5. Algorithms
Techniques
5. Algorithms Graph Traversals
Minimum Spanning
5. Algorithms
Trees
5. Algorithms Shortest Paths
6. Theory of Regular Expressions
Computation and Finite Automata
6. Theory of Regular Expressions
Computation and Finite Automata
Context-Free
6. Theory of
Grammars and Push-
Computation
Down Automata
Context-Free
6. Theory of
Grammars and Push-
Computation
Down Automata
6. Theory of
Languages
Computation
6. Theory of
Languages
Computation
6. Theory of
Pumping Lemma
Computation
6. Theory of Turing Machines and
Computation Undecidability
6. Theory of Turing Machines and
Computation Undecidability
7. Compiler Design Lexical Analysis
7. Compiler Design Parsing
Syntax-Directed
7. Compiler Design
Translation
Runtime
7. Compiler Design
Environments
Intermediate Code
7. Compiler Design
Generation
7. Compiler Design Local Optimization
7. Compiler Design Data Flow Analyses
7. Compiler Design Data Flow Analyses
7. Compiler Design Data Flow Analyses
8. Operating System System Calls
8. Operating System Processes
8. Operating System Threads
Inter-Process
8. Operating System
Communication
Concurrency and
8. Operating System
Synchronization
8. Operating System Deadlock
8. Operating System CPU Scheduling
8. Operating System I/O Scheduling
Memory
8. Operating System
Management
8. Operating System Virtual Memory
8. Operating System File Systems
9. Databases ER-Model
9. Databases Relational Model
9. Databases Relational Model
9. Databases Relational Model
9. Databases Integrity Constraints
9. Databases Normal Forms
9. Databases File Organization
9. Databases Indexing
Transactions and
9. Databases
Concurrency Control
Transactions and
9. Databases
Concurrency Control
10. Computer Networks Concept of Layering
10. Computer Networks Concept of Layering
10. Computer Networks Data Link Layer
10. Computer Networks Data Link Layer
10. Computer Networks Data Link Layer
10. Computer Networks Data Link Layer
10. Computer Networks Routing Protocols
10. Computer Networks Routing Protocols
10. Computer Networks Routing Protocols
10. Computer Networks Routing Protocols
Fragmentation and IP
10. Computer Networks
Addressing
Fragmentation and IP
10. Computer Networks
Addressing
Fragmentation and IP
10. Computer Networks
Addressing
Fragmentation and IP
10. Computer Networks
Addressing
Basics of IP Support
10. Computer Networks
Protocols
Basics of IP Support
10. Computer Networks
Protocols
Basics of IP Support
10. Computer Networks
Protocols
Network Address
10. Computer Networks
Translation (NAT)
10. Computer Networks Transport Layer
10. Computer Networks Transport Layer
10. Computer Networks Transport Layer
10. Computer Networks Transport Layer
10. Computer Networks Transport Layer
Application Layer
10. Computer Networks
Protocols
Application Layer
10. Computer Networks
Protocols
Application Layer
10. Computer Networks
Protocols
Application Layer
10. Computer Networks
Protocols
Application Layer
10. Computer Networks
Protocols
description
Focuses on the design and analysis of digital circuits using logic gates, combinational and sequential circuits, and Boolean alge
Examines the internal structure of computers, including the organization of CPUs, memory systems, and the principles of instr
Covers mathematical concepts essential for solving problems in computer science, including linear algebra, calculus, probabilit
Involves the fundamentals of programming, including syntax and semantics of programming languages, and essential data stru
Covers the design and analysis of algorithms, including sorting, searching, and optimization techniques, as well as complexity a
Explores theoretical aspects of computation, including formal languages, automata theory, computability, and complexity the
Focuses on the management of computer systems’ resources, including process management, memory management, and file
Examines the fundamentals of networking, including network models, protocols, and the operation of network devices.
Focuses on the theory and practice of designing compilers, including lexical analysis, syntax analysis, and code optimization.
Subtopic
Propositional and first-order logic
Sets
Relations
Functions
Partial orders
Lattices
Monoids
Groups
Graphs: Connectivity
Graphs: Matching
Graphs: Coloring
Counting
Recurrence relations
Generating functions
Matrices
Determinants
System of linear equations
Eigenvalues and eigenvectors
LU decomposition
Limits
Continuity and differentiability
Maxima and minima
Mean value theorem
Integration
Random variables
Uniform distributions
Normal distributions
Exponential distributions
Poisson distributions
Binomial distributions
Mean
Median
Mode
Standard deviation
Conditional probability
Bayes' theorem
Boolean algebra
Minimization
Number representations
Computer arithmetic: Fixed point
Computer arithmetic: Floating point
ALU
Data-path
Control unit
Instruction pipelining
Pipeline hazards
Cache
Main memory
Secondary storage
I/O interface: Interrupt mode
I/O interface: DMA mode
Programming in C
Recursion
Arrays
Stacks
Queues
Linked lists
Trees
Binary search trees
Binary heaps
Graphs
Searching
Sorting
Hashing
Asymptotic worst-case time and space complexity
Greedy
Dynamic programming
Divide-and-conquer
Graph traversals
Minimum spanning trees
Shortest paths
Regular expressions
Finite automata
Context-free grammars
Push-down automata
Regular languages
Context-free languages
Pumping lemma
Turing machines
Undecidability
Lexical analysis
Parsing
Syntax-directed translation
Runtime environments
Intermediate code generation
Local optimization
Constant propagation
Liveness analysis
Common subexpression elimination
System calls
Processes
Threads
Inter-process communication
Concurrency and synchronization
Deadlock
CPU scheduling
I/O scheduling
Memory management
Virtual memory
File systems
ER-model
Relational algebra
Tuple calculus
SQL
Integrity constraints
Normal forms
File organization
Indexing (e.g., B and B+ trees)
Transactions
Concurrency control
OSI and TCP/IP Protocol Stacks
Basics of packet, circuit, and virtual circuit-switching
Framing
Error detection
Medium Access Control
Ethernet bridging
Shortest path routing
Flooding
Distance vector routing
Link state routing
Fragmentation
IP addressing
IPv4
CIDR notation
ARP
DHCP
ICMP
Network Address Translation (NAT)
Flow control
Congestion control
UDP
TCP
Sockets
DNS
SMTP
HTTP
FTP
Email
catagory
Electronics Stream
Computer Science
Engineering
Computer Science
Computer Science
Computer Science
Computer Science
Computer Science
Computer Science
INSERT INTO table_name VALUES('1','Digital Logic','Focuses on the design and analysis of digital circuits using logic gates, com
INSERT INTO table_name VALUES('2','Computer Organization and Architecture','Examines the internal structure of computers
INSERT INTO table_name VALUES('3','Engineering Mathematics','Covers mathematical concepts essential for solving problems
INSERT INTO table_name VALUES('4','Programming and Data Structures','Involves the fundamentals of programming, includin
INSERT INTO table_name VALUES('5','Algorithms','Covers the design and analysis of algorithms, including sorting, searching, an
INSERT INTO table_name VALUES('6','Theory of Computation',' Explores theoretical aspects of computation, including formal l
INSERT INTO table_name VALUES('7','Operating Systems','Focuses on the management of computer systems’ resources, includ
INSERT INTO table_name VALUES('8','Computer Networks','Examines the fundamentals of networking, including network mod
INSERT INTO table_name VALUES('9','Compiler Design','Focuses on the theory and practice of designing compilers, including le
uits using logic gates, combinational and sequential circuits, and Boolean algebra.','Electronics Stream')
al structure of computers, including the organization of CPUs, memory systems, and the principles of instruction sets and data processing
ential for solving problems in computer science, including linear algebra, calculus, probability, statistics, discrete mathematics, and numeri
of programming, including syntax and semantics of programming languages, and essential data structures such as arrays, linked lists, stac
uding sorting, searching, and optimization techniques, as well as complexity analysis.','Computer Science')
utation, including formal languages, automata theory, computability, and complexity theory.','Computer Science')
systems’ resources, including process management, memory management, and file systems.','Computer Science')
ng, including network models, protocols, and the operation of network devices.','Computer Science')
ning compilers, including lexical analysis, syntax analysis, and code optimization.','Computer Science')
ction sets and data processing.','Computer Science')
rete mathematics, and numerical methods.','Engineering')
uch as arrays, linked lists, stacks, and queues.','Computer Science')
140 Propositional and first-order logic
141 Sets
142 Relations
143 Functions
144 Partial orders
145 Lattices
146 Monoids
147 Groups
148 Graphs: Connectivity
149 Graphs: Matching
150 Graphs: Coloring
151 Counting
152 Recurrence relations
153 Generating functions
154 Matrices
155 Determinants
156 System of linear equations
157 Eigenvalues and eigenvectors
158 LU decomposition
159 Limits
160 Continuity and differentiability
161 Maxima and minima
162 Mean value theorem
163 Integration
164 Random variables
165 Uniform distributions
166 Normal distributions
167 Exponential distributions
168 Poisson distributions
169 Binomial distributions
170 Mean
171 Median
172 Mode
173 Standard deviation
174 Conditional probability
175 Bayes' theorem
176 Boolean algebra
177 Minimization
178 Number representations
179 Computer arithmetic: Fixed point
180 Computer arithmetic: Floating point
181 ALU
182 Data-path
183 Control unit
184 Instruction pipelining
185 Pipeline hazards
186 Cache
187 Main memory
188 Secondary storage
189 I/O interface: Interrupt mode
190 I/O interface: DMA mode
191 Programming in C
192 Recursion
193 Arrays
194 Stacks
195 Queues
196 Linked lists
197 Trees
198 Binary search trees
199 Binary heaps
200 Graphs
201 Searching
202 Sorting
203 Hashing
204 Asymptotic worst-case time and space complexity
205 Greedy
206 Dynamic programming
207 Divide-and-conquer
208 Graph traversals
209 Minimum spanning trees
210 Shortest paths
211 Regular expressions
212 Finite automata
213 Context-free grammars
214 Push-down automata
215 Regular languages
216 Context-free languages
217 Pumping lemma
218 Turing machines
219 Undecidability
220 Lexical analysis
221 Parsing
222 Syntax-directed translation
223 Runtime environments
224 Intermediate code generation
225 Local optimization
226 Constant propagation
227 Liveness analysis
228 Common subexpression elimination
229 System calls
230 Processes
231 Threads
232 Inter-process communication
233 Concurrency and synchronization
234 Deadlock
235 CPU scheduling
236 I/O scheduling
237 Memory management
238 Virtual memory
239 File systems
240 ER-model
241 Relational algebra
242 Tuple calculus
243 SQL
244 Integrity constraints
245 Normal forms
246 File organization
247 Indexing (e.g., B and B+ trees)
248 Transactions
249 Concurrency control
250 OSI and TCP/IP Protocol Stacks
251 Basics of packet, circuit, and virtual circuit-switching
252 Framing
253 Error detection
254 Medium Access Control
255 Ethernet bridging
256 Shortest path routing
257 Flooding
258 Distance vector routing
259 Link state routing
260 Fragmentation
261 IP addressing
262 IPv4
263 CIDR notation
264 ARP
265 DHCP
266 ICMP
267 Network Address Translation (NAT)
268 Flow control
269 Congestion control
270 UDP
271 TCP
272 Sockets
273 DNS
274 SMTP
275 HTTP
276 FTP
277 Email
Discrete Mathematics
Discrete Mathematics
Discrete Mathematics
Discrete Mathematics
Discrete Mathematics
Discrete Mathematics
Discrete Mathematics
Discrete Mathematics
Discrete Mathematics
Discrete Mathematics
Discrete Mathematics
Combinatorics
Combinatorics
Combinatorics
Linear Algebra
Linear Algebra
Linear Algebra
Linear Algebra
Linear Algebra
Calculus
Calculus
Calculus
Calculus
Calculus
Probability and Statistics
Probability and Statistics
Probability and Statistics
Probability and Statistics
Probability and Statistics
Probability and Statistics
Probability and Statistics
Probability and Statistics
Probability and Statistics
Probability and Statistics
Probability and Statistics
Probability and Statistics
Boolean Algebra
Combinational and Sequential Circuits
Combinational and Sequential Circuits
Combinational and Sequential Circuits
Combinational and Sequential Circuits
Machine Instructions and Addressing Modes
Machine Instructions and Addressing Modes
Machine Instructions and Addressing Modes
Machine Instructions and Addressing Modes
Machine Instructions and Addressing Modes
Memory Hierarchy
Memory Hierarchy
Memory Hierarchy
Memory Hierarchy
Memory Hierarchy
Programming in C
Recursion
Arrays
Stacks
Queues
Linked Lists
Trees
Binary Search Trees
Binary Heaps
Graphs
Searching
Sorting
Hashing
Asymptotic Complexity
Algorithm Design Techniques
Algorithm Design Techniques
Algorithm Design Techniques
Graph Traversals
Minimum Spanning Trees
Shortest Paths
Regular Expressions and Finite Automata
Regular Expressions and Finite Automata
Context-Free Grammars and Push-Down Automata
Context-Free Grammars and Push-Down Automata
Languages
Languages
Pumping Lemma
Turing Machines and Undecidability
Turing Machines and Undecidability
Lexical Analysis
Parsing
Syntax-Directed Translation
Runtime Environments
Intermediate Code Generation
Local Optimization
Data Flow Analyses
Data Flow Analyses
Data Flow Analyses
System Calls
Processes
Threads
Inter-Process Communication
Concurrency and Synchronization
Deadlock
CPU Scheduling
I/O Scheduling
Memory Management
Virtual Memory
File Systems
ER-Model
Relational Model
Relational Model
Relational Model
Integrity Constraints
Normal Forms
File Organization
Indexing
Transactions and Concurrency Control
Transactions and Concurrency Control
Concept of Layering
Concept of Layering
Data Link Layer
Data Link Layer
Data Link Layer
Data Link Layer
Routing Protocols
Routing Protocols
Routing Protocols
Routing Protocols
Fragmentation and IP Addressing
Fragmentation and IP Addressing
Fragmentation and IP Addressing
Fragmentation and IP Addressing
Basics of IP Support Protocols
Basics of IP Support Protocols
Basics of IP Support Protocols
Network Address Translation (NAT)
Transport Layer
Transport Layer
Transport Layer
Transport Layer
Transport Layer
Application Layer Protocols
Application Layer Protocols
Application Layer Protocols
Application Layer Protocols
Application Layer Protocols
course_id title
3 Discrete Mathematics
3 Combinatorics
3 Linear Algebra
3 Calculus
3 Probability and Statistics
1 Boolean Algebra
1 Combinational and Sequential Circuits
2 Machine Instructions and Addressing Modes
2 Memory Hierarchy
4 Programming in C
4 Recursion
4 Arrays
4 Stacks
4 Queues
4 Linked Lists
4 Trees
4 Binary Search Trees
4 Binary Heaps
4 Graphs
5 Searching
5 Sorting
5 Hashing
5 Asymptotic Complexity
5 Algorithm Design Techniques
5 Graph Traversals
5 Minimum Spanning Trees
5 Shortest Paths
6 Regular Expressions and Finite Automata
6 Context-Free Grammars and Push-Down Automata
6 Languages
6 Pumping Lemma
6 Turing Machines and Undecidability
9 Lexical Analysis
9 Parsing
9 Syntax-Directed Translation
9 Runtime Environments
9 Intermediate Code Generation
9 Local Optimization
9 Data Flow Analyses
7 System Calls
7 Processes
7 Threads
7 Inter-Process Communication
7 Concurrency and Synchronization
7 Deadlock
7 CPU Scheduling
7 I/O Scheduling
7 Memory Management
7 Virtual Memory
7 File Systems
10 ER-Model
10 Relational Model
10 Integrity Constraints
10 Normal Forms
10 File Organization
10 Indexing
10 Transactions and Concurrency Control
8 Concept of Layering
8 Data Link Layer
8 Routing Protocols
8 Fragmentation and IP Addressing
8 Basics of IP Support Protocols
8 Network Address Translation (NAT)
8 Transport Layer
8 Application Layer Protocols
chapter_order
1
2
3
4
5
1
2
1
2
1
2
3
4
5
6
7
8
9
10
1
2
3
4
5
6
7
8
1
2
3
4
5
1
2
3
4
5
6
7
1
2
3
4
5
6
7
8
9
10
11
1
2
3
4
5
6
7
1
2
3
4
5
6
7
8
insert into chapters(course_id,title,chapter_order) values ('3','Discrete Mathematics','1');
insert into chapters(course_id,title,chapter_order) values ('3','Combinatorics','2');
insert into chapters(course_id,title,chapter_order) values ('3','Linear Algebra','3');
insert into chapters(course_id,title,chapter_order) values ('3','Calculus','4');
insert into chapters(course_id,title,chapter_order) values ('3','Probability and Statistics','5');
insert into chapters(course_id,title,chapter_order) values ('1','Boolean Algebra','1');
insert into chapters(course_id,title,chapter_order) values ('1','Combinational and Sequential Circuits','2');
insert into chapters(course_id,title,chapter_order) values ('2','Machine Instructions and Addressing Modes','1');
insert into chapters(course_id,title,chapter_order) values ('2','Memory Hierarchy','2');
insert into chapters(course_id,title,chapter_order) values ('4','Programming in C','1');
insert into chapters(course_id,title,chapter_order) values ('4','Recursion','2');
insert into chapters(course_id,title,chapter_order) values ('4','Arrays','3');
insert into chapters(course_id,title,chapter_order) values ('4','Stacks','4');
insert into chapters(course_id,title,chapter_order) values ('4','Queues','5');
insert into chapters(course_id,title,chapter_order) values ('4','Linked Lists','6');
insert into chapters(course_id,title,chapter_order) values ('4','Trees','7');
insert into chapters(course_id,title,chapter_order) values ('4','Binary Search Trees','8');
insert into chapters(course_id,title,chapter_order) values ('4','Binary Heaps','9');
insert into chapters(course_id,title,chapter_order) values ('4','Graphs','10');
insert into chapters(course_id,title,chapter_order) values ('5','Searching','1');
insert into chapters(course_id,title,chapter_order) values ('5','Sorting','2');
insert into chapters(course_id,title,chapter_order) values ('5','Hashing','3');
insert into chapters(course_id,title,chapter_order) values ('5','Asymptotic Complexity','4');
insert into chapters(course_id,title,chapter_order) values ('5','Algorithm Design Techniques','5');
insert into chapters(course_id,title,chapter_order) values ('5','Graph Traversals','6');
insert into chapters(course_id,title,chapter_order) values ('5','Minimum Spanning Trees','7');
insert into chapters(course_id,title,chapter_order) values ('5','Shortest Paths','8');
insert into chapters(course_id,title,chapter_order) values ('6','Regular Expressions and Finite Automata','1');
insert into chapters(course_id,title,chapter_order) values ('6','Context-Free Grammars and Push-Down Automata','2');
insert into chapters(course_id,title,chapter_order) values ('6','Languages','3');
insert into chapters(course_id,title,chapter_order) values ('6','Pumping Lemma','4');
insert into chapters(course_id,title,chapter_order) values ('6','Turing Machines and Undecidability','5');
insert into chapters(course_id,title,chapter_order) values ('9','Lexical Analysis','1');
insert into chapters(course_id,title,chapter_order) values ('9','Parsing','2');
insert into chapters(course_id,title,chapter_order) values ('9','Syntax-Directed Translation','3');
insert into chapters(course_id,title,chapter_order) values ('9','Runtime Environments','4');
insert into chapters(course_id,title,chapter_order) values ('9','Intermediate Code Generation','5');
insert into chapters(course_id,title,chapter_order) values ('9','Local Optimization','6');
insert into chapters(course_id,title,chapter_order) values ('9','Data Flow Analyses','7');
insert into chapters(course_id,title,chapter_order) values ('7','System Calls','1');
insert into chapters(course_id,title,chapter_order) values ('7','Processes','2');
insert into chapters(course_id,title,chapter_order) values ('7','Threads','3');
insert into chapters(course_id,title,chapter_order) values ('7','Inter-Process Communication','4');
insert into chapters(course_id,title,chapter_order) values ('7','Concurrency and Synchronization','5');
insert into chapters(course_id,title,chapter_order) values ('7','Deadlock','6');
insert into chapters(course_id,title,chapter_order) values ('7','CPU Scheduling','7');
insert into chapters(course_id,title,chapter_order) values ('7','I/O Scheduling','8');
insert into chapters(course_id,title,chapter_order) values ('7','Memory Management','9');
insert into chapters(course_id,title,chapter_order) values ('7','Virtual Memory','10');
insert into chapters(course_id,title,chapter_order) values ('7','File Systems','11');
insert into chapters(course_id,title,chapter_order) values ('10','ER-Model','1');
insert into chapters(course_id,title,chapter_order) values ('10','Relational Model','2');
insert into chapters(course_id,title,chapter_order) values ('10','Integrity Constraints','3');
insert into chapters(course_id,title,chapter_order) values ('10','Normal Forms','4');
insert into chapters(course_id,title,chapter_order) values ('10','File Organization','5');
insert into chapters(course_id,title,chapter_order) values ('10','Indexing','6');
insert into chapters(course_id,title,chapter_order) values ('10','Transactions and Concurrency Control','7');
insert into chapters(course_id,title,chapter_order) values ('8','Concept of Layering','1');
insert into chapters(course_id,title,chapter_order) values ('8','Data Link Layer','2');
insert into chapters(course_id,title,chapter_order) values ('8','Routing Protocols','3');
insert into chapters(course_id,title,chapter_order) values ('8','Fragmentation and IP Addressing','4');
insert into chapters(course_id,title,chapter_order) values ('8','Basics of IP Support Protocols','5');
insert into chapters(course_id,title,chapter_order) values ('8','Network Address Translation (NAT)','6');
insert into chapters(course_id,title,chapter_order) values ('8','Transport Layer','7');
insert into chapters(course_id,title,chapter_order) values ('8','Application Layer Protocols','8');
1 Discrete Mathematics
2 Combinatorics
3 Linear Algebra
4 Calculus
5 Probability and Statistics
6 Boolean Algebra
7 Combinational and Sequential Circuits
8 Machine Instructions and Addressing Modes
9 Memory Hierarchy
10 Programming in C
11 Recursion
12 Arrays
13 Stacks
14 Queues
15 Linked Lists
16 Trees
17 Binary Search Trees
18 Binary Heaps
19 Graphs
20 Searching
21 Sorting
22 Hashing
23 Asymptotic Complexity
24 Algorithm Design Techniques
25 Graph Traversals
26 Minimum Spanning Trees
27 Shortest Paths
28 Regular Expressions and Finite Automata
29 Context-Free Grammars and Push-Down Automata
30 Languages
31 Pumping Lemma
32 Turing Machines and Undecidability
33 Lexical Analysis
34 Parsing
35 Syntax-Directed Translation
36 Runtime Environments
37 Intermediate Code Generation
38 Local Optimization
39 Data Flow Analyses
40 System Calls
41 Processes
42 Threads
43 Inter-Process Communication
44 Concurrency and Synchronization
45 Deadlock
46 CPU Scheduling
47 I/O Scheduling
48 Memory Management
49 Virtual Memory
50 File Systems
51 ER-Model
52 Relational Model
53 Integrity Constraints
54 Normal Forms
55 File Organization
56 Indexing
57 Transactions and Concurrency Control
58 Concept of Layering
59 Data Link Layer
60 Routing Protocols
61 Fragmentation and IP Addressing
62 Basics of IP Support Protocols
63 Network Address Translation (NAT)
64 Transport Layer
65 Application Layer Protocols
