1 DM: Combinatory (62)
5 Integration (11)
1.1 Generating Functions (6)
1.2 Modular Arithmetic (1)
1.3 Permutations And Combinations (42)
1.4 Pigeonhole Principle (4)
1.5 Recurrence (6)
1.6 Summation (3)
2 DM: Graph Theory (75)
2.1 Adjacency Matrix (1)
2.2 Counting (7)
2.3 Degree Of Graph (16)
2.4 Euler Graph (1)
2.5 Graph Coloring (11)
2.6 Graph Connectivity (22)
2.7 Graph Isomorphism (2)
2.8 Graph Matching (1)
2.9 Graph Planarity (4)
2.10 Graph Search (1)
2.11 Line Graph (2)
2.12 Regular Graph (1)
2.13 Spanning Tree (2)
2.14 Trees (3)
2.15 Vertex Cover (1)
3 DM: Mathematical Logic (82)
3.1 First Order Logic (34)
3.2 Logical Reasoning (10)
3.3 Propositional Logic (38)
4 DM: Set Theory & Algebra (178)
4.1 Binary Operation (8)
4.2 Countable Set (1)
4.3 Fields (1)
4.4 Functions (34)
4.5 Groups (24)
4.6 Lattice (9)
4.7 Mathematical Induction (2)
4.8 Number Theory (9)
4.9 Partial Order (13)
4.10 Polynomials (9)
4.11 Relations (32)
4.12 Ring (1)
4.13 Sets (35)
5 EM: Calculus (55)
5.1 Area Under Curve (1)
5.2 Continuity (4)
5.3 Differentiability (8)
5.4 Functions (5)
5.
5.6 Limits (12)
5.7 Maxima Minima (14)
6 EM: Linear Algebra (79)
6.1 Determinant (5)
6.2 Eigen Value (23)
6.3 Inequality (1)
6.4 Lines Curves (1)
6.5 Matrices (29)
6.6 Rank Of Matrix (1)
6.7 System Of Equations (12)
6.8 Vector Space (7)
7 EM: Probability (103)
7.1 Binomial Distribution (7)
7.2 Conditional Probability (11)
7.3 Expectation (10)
7.4 Exponential Distribution (1)
7.5 Normal Distribution (1)
7.6 Poisson Distribution (4)
7.7 Probability (59)
7.8 Random Variable (7)
7.9 Uniform Distribution (3)
8 GA: Numerical Ability (226)
8.1 Absolute Value (5)
8.2 Age Relation (1)
8.3 Algebra (1)
8.4 Arithmetic Series (2)
8.5 Bar Charts (2)
8.6 Binomial Distribution (1)
8.7 Cartesian Coordinates (3)
8.8 Circle (2)
8.9 Clock Time (5)
8.10 Complex Number (1)
8.11 Compound Interest (1)
8.12 Conditional Probability (3)
8.13 Cost Market Price (4)
8.14 Currency Money (1)
8.15 Data Interpretation (17)
8.16 Direction Sense (4)
8.17 Factors (7)
8.18 Fractions (4)
8.19 Functions (3)
8.20 Geometry (12)
8.21 Limits (1)
8.22 Logarithms (2)
8.23 Logical Reasoning (25)
8.24 Maxima Minima (3)
 8.25 Modular Arithmetic (1)
8.26 Number Representation (2)
8.27 Number Series (11)
8.28 Numerical Computation (16)
8.29 Odd One (3)
8.30 Percentage (9)
8.31 Permutations And Combinations (9)
8.32 Pie Chart (4)
8.33 Pigeonhole Principle (1)
8.34 Polynomials (1)
8.35 Probability (13)
8.36 Profit Loss (1)
8.37 Quadratic Equations (4)
8.38 Ratio Proportions (8)
8.39 Sequence Series (6)
8.40 Sets (2)
8.41 Speed Time Distance (9)
8.42 Statement Argument (1)
8.43 Statement Sufficiency (1)
8.44 Statistics (3)
8.45 Summation (1)
8.46 System Of Equations (1)
8.47 Variance (1)
8.48 Venn Diagrams (3)
8.49 Work Time (5)
9 GA: Verbal Ability (146)
9.1 Closest Word (3)
9.2 English Grammar (20)
9.3 Grammatically Incorrect Sentence (2)
9.4 Logical Reasoning (5)
9.5 Meaning (17)
9.6 Most Appropriate Alternative (4)
9.7 Most Appropriate Word (32)
9.8 Noun Verb Adjective (1)
9.9 Odd One (3)
9.10 Opposite (2)
9.11 Passage Reading (21)
9.12 Phrasal Verbs (1)
9.13 Statements Follow (1)
9.14 Synonym (4)
9.15 Tenses (3)
9.16 Verbal Inference (2)
9.17 Verbal Reasoning (19)
9.18 Word Pairs (6)
1 Algorithms (323)
1.1 Algorithm Design (8)
1.2 Algorithm Design Techniques (5)
1.3 Asymptotic Notations (22)
1.4 Dynamic Programming (12)
1.5 Graph Algorithms (48)
1.6 Graph Connectivity (1)
1.7 Greedy Algorithm (8)
1.8 Huffman Code (2)
1.9 Identify Function (37)
1.10 Minimum Maximum (4)
1.11 Minimum Spanning Trees (2)
1.12 Numerical Computation (2)
1.13 P Np Npc Nph (12)
1.14 Recurrence (32)
1.15 Searching (8)
1.16 Sorting (55)
1.17 Spanning Tree (31)
1.18 Time Complexity (34)
2 Compiler Design (175)
2.1 Abstract Syntax Tree (1)
2.2 Assembler (6)
2.3 Code Optimization (4)
2.4 Compilation Phases (9)
2.5 Expression Evaluation (2)
2.6 Grammar (39)
2.7 Intermediate Code (8)
2.8 Left Recursion (1)
2.9 Lexical Analysis (6)
2.10 Linking (3)
2.11 Live Variable (1)
2.12 Macros (3)
2.13 Parameter Passing (14)
2.14 Parsing (43)
2.15 Register Allocation (2)
2.16 Runtime Environments (18)
2.17 Static Single Assignment (2)
2.18 Syntax Directed Translation (6)
2.19 Target Code Generation (4)
2.20 Variable Scope (2)
2.21 Viable Prefix (1)
3 P & DS: DS (208)
3.1 Abstract Data Type (1)
3.2 Arrays (14)
3.3 Binary Search Tree (29)
3.4 Binary Tree (50)
3.5 Graph Search (1)
3.6 Graphs (6)
3.7 Hashing (17)
 3.8 Heap (24)
3.9 Infix Postfix (2)
3.10 Linked Lists (20)
3.11 Priority Queue (1)
3.12 Queues (12)
3.13 Stack (16)
3.14 Trees (15)
4 P & DS: Programming (104)
4.1 Aliasing (1)
4.2 Goto (2)
4.3 Identify Function (4)
4.4 Loop Invariants (8)
4.5 Parameter Passing (2)
4.6 Programming Constructs (1)
4.7 Programming In C (62)
4.8 Programming Paradigms (2)
4.9 Pseudo Code (1)
4.10 Recursion (18)
4.11 Structures (1)
4.12 Type Checking (1)
4.13 Variable Binding (1)
5 Theory of Computation (281)
5.1 Closure Property (10)
5.2 Context Free Language (31)
5.3 Countable Set (1)
5.4 Decidability (23)
5.5 Finite Automata (65)
5.6 Grammar (2)
5.7 Identify Class Language (33)
5.8 Minimal State Automata (2)
5.9 Non Determinism (7)
5.10 P Np Npc Nph (5)
5.11 Pumping Lemma (1)
5.12 Pushdown Automata (13)
5.13 Recursive & Recursively EL (13)
5.14 Regular Expressions (27)
5.15 Regular Grammar (3)
5.16 Regular Languages (37)
5.17 Turing Machine (8)
1 CO & Architecture (184)
1.1 Addressing Modes (17)
1.2 Cache Memory (54)
1.3 Cisc Risc Architecture (2)
1.4 Clock Frequency (2)
1.5 Conflict Misses (1)
1.6 Control Unit (2)
1.7 Data Dependences (2)
1.8 Data Path (4)
1.9 Dma (2)
1.10 Expanding Opcode (1)
1.11 Instruction Execution (5)
1.12 Instruction Format (5)
1.13 Instruction Prefetch (1)
1.14 Interrupts (6)
1.15 Io Handling (5)
1.16 Machine Instructions (18)
1.17 Memory Interfacing (2)
1.18 Microprogramming (12)
1.19 Pipelining (36)
1.20 Runtime Environments (2)
1.21 Speedup (2)
1.22 Virtual Memory (3)
2 Computer Networks (197)
2.1 Application Layer Protocols (8)
2.2 Bit Stuffing (1)
2.3 Bridges (2)
2.4 Communication (3)
2.5 Congestion Control (7)
2.6 Crc Polynomial (3)
2.7 Cryptography (2)
2.8 Csma Cd (5)
2.9 Distance Vector Routing (6)
2.10 Dns (1)
2.11 Encoding (1)
2.12 Error Detection (6)
2.13 Ethernet (4)
2.14 Firewall (1)
2.15 Hamming Code (1)
2.16 Icmp (1)
2.17 Ip Packet (8)
2.18 Ipv4 (8)
2.19 Lan Technologies (6)
2.20 Link State Routing (1)
2.21 Mac Protocol (4)
2.22 Manchester Encoding (2)
2.23 Network Addressing (1)
2.24 Network Communication (1)
2.25 Network Flow (6)
2.26 Network Layering (5)
2.27 Network Protocols (5)
2.28 Network Security (14)
2.29 Network Switching (4)
2.30 Routers Bridge Hubs Switches (1)
2.31 Routing (8)
2.32 Rsa Security Networks (1)
 2.33 Serial Communication (9)
2.34 Sliding Window (17)
2.35 Sockets (4)
2.36 Stop And Wait (4)
2.37 Subnetting (16)
2.38 Tcp (13)
2.39 Token Bucket (2)
2.40 Udp (4)
2.41 Wifi (1)
3 Databases (209)
3.1 B Tree (22)
3.2 Candidate Keys (5)
3.3 Conflict Serializable (1)
3.4 Data Independence (1)
3.5 Database Normalization (27)
3.6 Er Diagram (9)
3.7 Functional Dependencies (14)
3.8 Indexing (10)
3.9 Joins (7)
3.10 Multivalued Dependency 4nf (1)
3.11 Natural Join (3)
3.12 Referential Integrity (3)
3.13 Relational Algebra (25)
3.14 Relational Calculus (13)
3.15 Safe Query (1)
3.16 Sql (40)
3.17 Timestamp Ordering (1)
3.18 Transaction And Concurrency (1)
3.19 Transactions (25)
4 Digital Logic (250)
4.1 Adder (7)
4.2 Array Multiplier (2)
4.3 Boolean Algebra (5)
4.4 Boolean Expressions (22)
4.5 Boolean Operations (4)
4.6 Booths Algorithm (5)
4.7 Canonical Normal Form (7)
4.8 Carry Generator (2)
4.9 Circuit Output (34)
4.10 Conjunctive Normal Form (1)
4.11 Decoder (1)
4.12 Digital Circuits (4)
4.13 Digital Counter (8)
4.14 Dual Function (1)
4.15 Fixed Point Representation (1)
4.16 Flip Flop (10)
4.17 Floating Point Representation (9)
4.18 Functional Completeness (4)
4.19 Gray Code (2)
4.20 Half Adder (2)
4.21 Hamming Code (1)
4.22 Ieee Representation (3)
4.23 K Map (17)
4.24 Logic Gates (5)
4.25 Memory Interfacing (3)
4.26 Min No Gates (4)
4.27 Min Product Of Sums (1)
4.28 Min Sum Of Products Form (12)
4.29 Multiplexer (11)
4.30 Number Representation (48)
4.31 Pla (1)
4.32 Prime Implicants (2)
4.33 Priority Encoder (1)
4.34 Rom (4)
4.35 Shift Registers (1)
4.36 Static Hazard (1)
4.37 Synchronous Asynchronous Ckt (4)
5 Operating System (288)
5.1 Context Switch (3)
5.2 Deadlock Prevention & Avoidance (2)
5.3 Disk Scheduling (13)
5.4 Disks (30)
5.5 Dma (1)
5.6 File System (5)
5.7 Fork (4)
5.8 Inter Process Communication (1)
5.9 Interrupts (7)
5.10 Io Handling (6)
5.11 Memory Management (7)
5.12 Os Protection (3)
5.13 Overlay (1)
5.14 Page Replacement (29)
5.15 Precedence Graph (2)
5.16 Process (4)
5.17 Process Schedule (37)
5.18 Process Synchronization (52)
5.19 Resource Allocation (27)
5.20 Runtime Environments (3)
5.21 Semaphore (7)
5.22 Threads (7)
5.23 Virtual Memory (37)