Sr. no | Chapter |
---|---|
1 | Sorting Algorithms Updated on: |
2 | Growth of Functions Updated on: |
3 | Divide-and-Conquer Updated on: |
4 | Iterative Method Updated on: |
5 | Heap Sort Algorithm Updated on: |
6 | Quicksort Updated on: |
7 | Stacks and Queues Updated on: |
8 | Hashing Updated on: |
9 | Dynamic programming Updated on: |
10 | Greedy Algorithms Updated on: |
11 | Greedy Algorithms - Minimum Spanning Tree Updated on: |
12 | Single source and All Pair Shortest Path Updated on: |
13 | NP Completeness and Approximation Algorithms Updated on: |
Sr. no | Chapter |
---|---|
1 | Number systems Updated on: |
2 | Digital systems Updated on: |
3 | Number representations Updated on: |
4 | Boolean Algebra and Logic Gates Updated on: |
5 | Computer Arithmetic Updated on: |
6 | Gate level Minimization Updated on: |
7 | Dont care condition - Ex-OR Gate Updated on: |
8 | Combinational Circuits Updated on: |
9 | Combinational Circuits - BCD ADDER Updated on: |
10 | DECODERS, ENCODERS AND MULTIPLEXERS Updated on: |
11 | Synchronous Sequential Logic Updated on: |
12 | STORAGE ELEMENTS : FLIP FLOPS Updated on: |
13 | ANALYSIS OF CLOCKED SEQUENTIAL CIRCUITS Updated on: |
14 | Registers and Counters Updated on: |
15 | General Shift Register Updated on: |
16 | SYNCHRONOUS COUNTERS Updated on: |
Sr. no | Chapter |
---|---|
1 | Introduction to Database Systems Updated on: |
2 | Introduction to Database Languages Updated on: |
3 | RELATIONAL DATABASES Updated on: |
4 | Introduction to SQL Updated on: |
5 | Additional Basic Operations of SQL Updated on: |
6 | Null Values Updated on: |
7 | Nested Subqueries Updated on: |
8 | Intermediate SQL (Join Conditions) Updated on: |
9 | Integrity Constraints Updated on: |
10 | Authorization Updated on: |
11 | The Relational Algebra Updated on: |
12 | Tuple Relational Calculus Updated on: |
13 | Database Design and the E-R Model Updated on: |
14 | Extended E-R Features - Specialization Updated on: |
15 | Functional-Dependency Theory Updated on: |
16 | Storage and File Structure Updated on: |
17 | Transactions Updated on: |
18 | Concurrency Control Updated on: |
Sr. no | Chapter |
---|---|
1 | The Foundations: Logic and Proofs Updated on: |
2 | Logic and Bit Operations Updated on: |
3 | Constructing New Logical Equivalences Updated on: |
4 | Nested Quantifiers Updated on: |
5 | Rules of Inference Updated on: |
6 | Sets, Functions, Sequences, Sums, and Matrices Updated on: |
7 | Set Operations Updated on: |
8 | Inverse Functions and Compositions of Functions Updated on: |
9 | Algorithms and Counting Problems Updated on: |
10 | Complex Counting Problems Updated on: |
11 | Permutations and Combinations Updated on: |
12 | Discrete Probability Updated on: |
13 | Expected Value and Variance Updated on: |
14 | Composite Relations Updated on: |
15 | Connectivity of Graphs, Planar graphs Updated on: |
Sr. no | Chapter |
---|---|
1 | Introduction to Operating Systems Updated on: |
2 | Process Management Updated on: |
3 | Multithreaded Programming Updated on: |
4 | Scheduling Algorithms - First-Come, First-Served Scheduling Updated on: |
5 | Multilevel Queue Scheduling Updated on: |
6 | Synchronization Updated on: |
7 | Deadlocks Updated on: |
8 | Deadlock-avoidance approach Updated on: |
9 | Memory Management approach Updated on: |
10 | Contiguous Memory Allocation Updated on: |
11 | Translation Look-aside Buffer Updated on: |
12 | Page-replacement algorithm Updated on: |
13 | Frame Allocation algorithm Updated on: |
Sr. no | Topic |
---|---|
1 | Structure of a C Program Updated on: |
2 | Types, Operators and Expressions Updated on: |
3 | Increment and Decrement Operators Updated on: |
4 | Control Flow Updated on: |
5 | Functions and Program Structure Updated on: |
6 | Initialization in Program Structure Updated on: |
7 | Pointers and Arrays Updated on: |
8 | Structures Updated on: |
9 | Data structures - Linked List Updated on: |
10 | Stack Data Structure Updated on: |
11 | Queue Data Structure Updated on: |
12 | Binary Tree Data Structure Updated on: |
13 | Binary Heap Data Structure Updated on: |
Chapter | Chapter |
---|---|
1. INTRODUCTION TO COMPUTER THEORY Updated on: | 2. RECURSIVE DEFINITIONS Updated on: |
3. REGULAR LANGUAGES Updated on: | 4. Examples of equivalences Updated on: |
5. FINITE AUTOMATA Updated on: | 6. TRANSITION GRAPHS Updated on: |
7. TRANSITION GRAPHS (Examples) Updated on: | 6. KLEENES THEOREM Updated on: |
8. NONDETERMINISM Updated on: | 9. Moore machine Updated on: |
10. Convert Mealy machine to Moore machine Updated on: | 11. NONREGULAR LANGUAGES Updated on: |
12. CONTEXT-FREE GRAMMARS Updated on: | 13. TREES Updated on: |
14. Parse Tree - Tracing Updated on: | 15. CHOMSKY NORMAL FORM Updated on: |
16. PUSHDOWN AUTOMATA Updated on: | 17. CFG = PDA : THEOREM Updated on: |
18. NON-CONTEXT-FREE LANGUAGES Updated on: | 19. NTERSECTION AND COMPLEMENT Updated on: |
20. PARSING Updated on: | 21. DECIDABILITY Updated on: |
22. TURING MACHINES Updated on: | 23. EXAMPLES - TURING MACHINES Updated on: |
24. POST MACHINES Updated on: |
Chapter | Chapter |
---|---|
Digital Computer Updated on: | Logic Gates Updated on: |
Combinational Circuits Updated on: | Sequential Circuits Updated on: |
Integrated Circuits Updated on: | Binary Counters Updated on: |
Number Systems Updated on: | Register Transfer Language Updated on: |
Logic Microoperations Updated on: | Basic Computer Organization and Design Updated on: |
Common Bus System Updated on: | Instruction Cycle Updated on: |
Control Flowchart Updated on: | Central Processing Unit Updated on: |
Stack Organization Updated on: | Addressing Modes Updated on: |
Parallel Processing Updated on: | Data Dependency Updated on: |
Asynchronous Data Transfer Updated on: | Modes of Transfer Updated on: |
Daisy-Chaining Priority Updated on: | Memory Organization Updated on: |
Match Logic Updated on: | Page Replacement Updated on: |
Multiprocessors Updated on: |