View 1190 Notes detailed notes on GATE (Graduate Aptitude Test in Engineering) Computer Science & IT (CS)
π Study Material (1190 Notes): 2024-2025 Syllabus
Rs. 1000.00 -OR-
3 Year Validity (Multiple Devices)
π See Sample NotesDetails
We have 1190 Notes in GATE (Graduate Aptitude Test in Engineering) Computer Science & IT (CS) course arranged below by topic-subtopic. Topic-wise count & %effort is given in brackets. Green bars show topic progress as you mark the titles complete (Show me how).
%
Mathematical Logic [38 Notes- 2% Effort]
Propositional Logic [33 Notes- 2% Effort]
- 1
- Computer Arithmetic
- Propositional Boolean Logic
- 2
- Logical Connectives
- Combining Propositions
- 3
- Rules for Combining Propositions
- Applications
- 4
- Satisfiability and Tautology
- Satisfiability and Tautology, Contradictions, Symbolism, Contingency
- 5
- Concept of Satisfiability
- Propositional Logic: Proposition, Implication, Biconditional or Double Implication
- 6
- Derived Argument Forms - Rule of Inference
- Derived Argument Forms: Modus Ponens
- 7
- Derived Argument Forms: Modus Tollens
- Derived Argument Forms: Hypothetical, Disjunctive, Constructive, Destructive Syllogism, Tautology & Exportation
- 8
- Miscellaneous Terms in Propositional Logic: Validity, Soundness, Fallacy, Satisfiability
- Resolution: Resolution Rule, What Steps Do We Follow for Resolution
- 9
- Refutation: Who Uses this Mechanism
- Refinements to Resolution: DPLL, Negative and Linear Resolution
- 10
- Automated Reasoning with Prepositional Logic
- Predicate Logic: Why Do We Need Predicate Logic
- 11
- Predicate Logic: Syntactical Components of Predicate
- Predicate Logic: Universal Quantifier
- 12
- Predicate Logic: Existential Quantification, Existential Quantifier and Connective or, Nested Quantifiers
- Predicate Logic: Universal Statement, Order of Application of Quantifiers, Quantifiers Using Negation
- 13
- Predicate Logic: Other Quantifiers; Precedence of Quantifiers
- Predicate Logic: Well-Formed Formula (WFF) - Rules and Interpretation
- 14
- Predicate Logic: Satisfiable, Unsatisfiable and Valid WWF
- Predicate Logic: Special Types of Variables- Bound and Free Variables
- 15
- Inference Rules
- Resolution
- 16
- Function Composition
- Function Composition: Properties
- 17
- Function Composition: Domain of Composite Function, Composed with Itself
First Order Logic [5 Notes- Negligible Effort]
Probability [1 Notes- Negligible Effort]
Distributions [1 Notes- Negligible Effort]
Set Theory & Algebra [35 Notes- 2% Effort]
Sets [12 Notes- Negligible Effort]
- 1
- Discrete Mathematics - Sets
- Discrete Mathematics: Relations
- 2
- Discrete Mathematics: Functions, Injective Functions, Surjective Functions, Bijective Functions, Constant Function, Composition of Functions, Inverse of a Function, Floor and Ceiling Functions
- Digital Computer
- 3
- Performance Metrics
- The Performance Equation
- 4
- Benchmarks and MIPS as Measure of Performance
- Binary Multiplication
- 5
- Binary Division and Restoring Division
- IEEE 754 Arithmetic and Rounding
- 6
- Summarizing Performance
- IoT, SDN & Wrapup, Internet of Things (IoT)
Functions [1 Notes- Negligible Effort]
Partial Orders [1 Notes- Negligible Effort]
Boolean Algebra [6 Notes- Negligible Effort]
- 1
- Boolean Algebra
- Gates Used in Boolean Algebra
- 2
- Minimization of Boolean Functions
- Minimization of Boolean Functions: The Map
- 3
- Minimization of Boolean Functions: Types of Groupings
- Special Cases of the Karnaugh Map
Groups [15 Notes- Negligible Effort]
- 1
- Groups β Finite Fields and Error Correcting Codes
- Finite Fields
- 2
- Group
- Subgroup
- 3
- Semi Groups
- Quotients of Products
- 4
- Isomorphism
- Homomorphism
- 5
- Automorphism
- Rings
- 6
- Integral Domains
- Fields
- 7
- Applications of Group Theory: Galois Theory, Algebraic Topology, Algebraic Geometry and Cryptography, Harmonic Analysis, Combinatorics, Music, Physics, Chemistry and Materials Science, Statistical Mechanics
- Groups
- 8
- Rings and Fields
Combinatorics [3 Notes- Negligible Effort]
Counting [3 Notes- Negligible Effort]
Graph Theory [14 Notes- 1% Effort]
Connectivity [3 Notes- Negligible Effort]
- 1
- Tree and Rooted Tree
- Eccentricity of a Vertex Radius and Diameter of a Graph: Eccentricity,Radius, Diameter
- 2
- Graph Theory
Spanning Trees [5 Notes- Negligible Effort]
- 1
- Graph - Spanning Trees: Introducton
- Minimum Spanning Tree: Spanning Tree
- 2
- Minimum Spanning Tree: Mathematical Properties
- Minimum Spanning Tree: PrimΥs Algorithm
- 3
- Minimum Spanning Tree: Cheapest Edges
Cut Vertices & Edges [2 Notes- Negligible Effort]
Matching [3 Notes- Negligible Effort]
- 1
- Hamiltonian and Eulerian Graphs, Planar Graphs
- Planar Graphs and Coloring
- 2
- Tries: Trie Nodes as ADT, Types of Tries- Advantage, Operations, Standard, Compressed, Suffix Trie
Colorings [1 Notes- Negligible Effort]
Linear Algebra [1 Notes- Negligible Effort]
Systems of Linear Equations [1 Notes- Negligible Effort]
Digital Logic [23 Notes- 1% Effort]
Design and Synthesis of Combinational and Sequential Circuits [16 Notes- 1% Effort]
- 1
- Logic Families
- Characteristics of Logic Families: Significance of the Logic Families
- 2
- Transistor β Transistor Logic (TTL)
- Classification of TTL
- 3
- Characteristics, Applications and Disadvantages of the TTL
- Emitter Coupled Logic: Introdution
- 4
- Characteristics of the ECL: Advantages and Disadvantages, Application of the ECL
- Complementary Metal β Oxide β Semiconductor or CMOS
- 5
- Characteristics and Applications of CMOS
- Flip-Flops
- 6
- Types of Flip-Flops - Circuitous Representation: SR Flip Flop; D Flip Flop
- Types of Flip-Flops: JK Flip Flop & T Flip Flop
- 7
- Race Conditions in Flip-Flop
- Comparisons in Flip-Flop
- 8
- Design of Combinational and Sequential Circuits: Combinational Logic Circuits
- Design of Combinational and Sequential Circuits: Classfication of Sequential Logic Circuits
Number Representation and Computer Arithmetic [7 Notes- Negligible Effort]
Computer Organization and Architecture [85 Notes- 7% Effort]
Machine Instructions and Addressing Modes [23 Notes- 2% Effort]
- 1
- Computer Organization and Microprocessor
- Instruction Formats: Instruction Cycle
- 2
- Instruction Formats: Instruction Pipelining, Generic Pipeline, Performance of a Pipelined Processor
- Instruction Formats: Operation Field
- 3
- Instruction Formats: Instruction Length
- Instruction Formats: Instruction Types, Expanding Opcodes
- 4
- Addressing Modes: Immediate Mode-Immediate Mode, Implied Mode, Register Mode, Register Indirect Mode, Direct Mode
- Addressing Modes: Indirect Addressing Mode, Relative Address Mode, Index, Displacement Mode, Autoincrement and Autodecrement Mode, Stack Addressing
- 5
- Instruction Set and Programming: Control Instructions, Logical Instructions
- Instruction Set and Programming: Branched, Conditional, Unconditional & Arithmetic Instructions
- 6
- Instruction Set and Programming: Data Transfer Instructions
- Register Transfer Language
- 7
- Stored Program Organization: Fixed Program Computers, Stored Program Computers
- Arithmetic Pipeline
- 8
- Vector Processing Array Processors: Pipe Lined Vector Computer Classification
- Computer Architecture
- 9
- Instruction Set Architecture
- Execution of Complete Instruction
- 10
- Microprogrammed Control
- Features Considered in Designing the Instruction Set Architecture
- 11
- MIPS Architecture
- Implementation of Datapath and Load Word and Store Word Instruction
- 12
- Execution of Different Types of Instruction
ALU and Data-Path [7 Notes- Negligible Effort]
- 1
- 1Υs Complement Arithmetic
- 2Υs Complement Arithmetic
- 2
- Floating Point Representation (Rev.)
- Computer Arithmetic: Addition and Subtraction
- 3
- Computer Arithmetic: Multiplication and Division Algorithms
- Fixed Point Arithmetic β Ripple, Binary, Carry & 2-Level Carry Adders
- 4
- Floating Point Numbers and Arithmetic Unit
CPU Control Design [2 Notes- Negligible Effort]
- 1
- Microprocessor
- Hardwired and Micro Programmed Processor Design: Hardwired Control, Micro-Programmed Control Unit
Memory Interface [24 Notes- 2% Effort]
- 1
- Computer Structure and Organization: Computer Architecture
- Computer Structure and Organization: Typical Computer Organization, Random Access Memory or RAM
- 2
- Computer Structure and Organization: Central Processing Unit or CPU- IR, CU, ALU, GPRs, Status Register
- Computer Structure and Organization: Flags, MAR, MBR, PC
- 3
- Computer Structure and Organization: Von Neumann Architecture, Harvard Architecture, CISC, RISC
- Memory Types and Organization: Primary Memory, Random Access Memory or RAM & Its Types
- 4
- Memory Types and Organization: Secondary Memory, Cache Memory
- Memory Types and Organization: Assembly Language Registers, General Purpose Register, Address Registers
- 5
- Memory Types and Organization: Control Registers, Carry Flag, Parity Flag, Auxiliary Carry Flag, Zero Flag, Sign Flag, Overflow Flag, Trap Flag, Interrupt Flag, Direction Flag
- Bus and Memory Transfers
- 6
- Auxiliary Memory: Magnetic Disks, Magnetic Tape
- Associative Memory
- 7
- Cache Memory: Importance of Cache Memory, Type of Cache Memory, Cache Memory Mapping
- Memory Management Hardware
- 8
- Exceptional Handling and Floating-Point Pipelines
- Interrupts
- 9
- Basics of Cache Memory
- Cache Optimizations (Access Times, Multilevel Caches, Prioritization, and Victim Cache)
- 10
- Cache Optimizations (Misses, Associativity)
- Compiler Optimizations
- 11
- Cache Optimization: Non-Blocking Caches, Multi-Banked Caches
- Techniques to Reduce Hit Time
- 12
- Synchronization in Multiprocessor System
- Barrier Synchronization
Instruction Pipelining, Cache and Main Memory [24 Notes- 1% Effort]
- 1
- Pipeline Hazards
- Control Hazards
- 2
- Ways of Introducing Instruction in Delay Slots
- Dynamic Branch Prediction
- 3
- Types of Dynamic Branch Predictors
- Integrated Instruction Fetch Unit and Integrated Branch Prediction
- 4
- Advanced Concepts of ILP
- Dynamic Scheduling
- 5
- Dynamic Scheduling β Loop Based Example
- Dynamic Scheduling with Speculation
- 6
- Exploiting ILP with Software Approaches
- Exploiting ILP with Software Approaches: Loop Unrolling
- 7
- Exploiting ILP with Software Approaches: Software Pipelining
- Hardware Parallelism and Software Parallelism
- 8
- Multiple Issue Processor
- VLIW (Very Long Instruction Word) Processors
- 9
- Comparison between SuperscalarΥs and VLIW Processors
- Thread Level Parallelism β SMT and CMP
- 10
- Exploiting Data Level Parallelism
- Improving the Performance of Vector Processors
- 11
- Programming Vector Architectures
- Case Studies of Multicore Architectures: Intel
- 12
- Case Studies of Multicore Architectures: Sun and IBM
- Case Studies: PPE in Power Architecture
Secondary Storage [5 Notes- Negligible Effort]
Programming and Data Structures [208 Notes- 22% Effort]
Programming in C [72 Notes- 7% Effort]
- 1
- Programming in C and C ++
- C and C ++
- 2
- Programming in C
- Compilation of C Program
- 3
- Elements of C
- Tokens: Types of Tokens (Rev.)
- 4
- Tokens: Special Symbols
- Tokens: Relational Operators
- 5
- Data Types in C
- Data Types in C: Enum Data Type
- 6
- Data Types in C: User Defined Data Types
- Data Types in C: Derived Data Types
- 7
- Data Types in C: Pointers (Rev.)
- Data Types in C: Special Cases of Pointers
- 8
- Data Types in C: Functions
- Data Types in C: Pointers and Functions
- 9
- Control Structures in C
- Types of Control Structures
- 10
- Using Control Structures in C: Decision Control Statements (Rev.)
- Using Control Structures in C: Case Control Statements
- 11
- Terms Used in the Control Structures
- Exception Handling
- 12
- Program Loops
- Subroutines
- 13
- Input-Output Programming
- Programming Language Syntax
- 14
- Scalar and Composite Data Types: Scalar or Simple Data Types, Structured or Composite Data Types
- Sequence Control: Expressions, Statements, Declarative Programming, Subprograms
- 15
- File Handling
- Command Line Arguments
- 16
- Pre-Processors
- Event Handling
- 17
- Multifile Programs
- Basic Programming, Data Structures and Data Types: Introduction, Design Principles, Type, Pre & Post-Conditions
- 18
- Input-Output Streams in C ++
- Pre-Defined Streams: Input/Output Operations in C ++ and Input/Output Operations Using Overloaded Shift Operators
- 19
- Pre-Defined Streams: Input/Output (with Default Format) Using Member Functions of I/O Streams and Unformatted Input/Output Operations Using Member Functions of I/O Streams
- Formatted Input-Output Operations in C ++
- 20
- Formatting Using Manipulators
- Difference between Formatting Using IOS Function and Manipulator and the State of Streams
- 21
- Working with Files in C ++
- Text & Binary I/O Using Files
- 22
- Reading/Writing from/to Binary File
- Binary Files in C ++
- 23
- Checking Error in File Operation
- Modify and Delete Object Stored in Binary File and Random Access: Reading Nth Object from Binary File
- 24
- Namespace in C ++
- Accessing & Importing Elements of Namespace
- 25
- Examples to Understand Use of Directive and Declaration at Various Scopes
- Overriding Name when Same Name is Imported from Different Namespaces in Same Scope
- 26
- Namespace Aliasing, Extending Namespace and Does Namespace Introduce Any Overhead?
- Introduction to C ++ Programming
- 27
- Introduction to C ++ Programming
- Basic Components of Program
- 28
- Compiling and Executing C ++ Program
- Operator Functions
- 29
- Exception Handling β Catch Multiple Exceptions
- Re-Throw and Exception
- 30
- The Need for Two Different Functions
- Exception Handling β Traditional Methods
- 31
- Exception Handling, Designer and User of Library and Object Destroy Problem
- Components of EH System
- 32
- Propagation of Control and Throwing Within a Called Function
- Overview of C ++
- 33
- Character Sets: New Data Types in C ++ and Advantage of Using Boolean Data Type
- Classes and Objects β ADT
- 34
- Classes and Objects β Static Data
- Static Data Members
- 35
- Syntax of Union in C ++
- Public Static Data Members and Nested Classes
- 36
- Object as a Data Member
- Functions in C ++ : Declare, Define, Call
Functions [8 Notes- Negligible Effort]
- 1
- Constructors and Destructors
- Constructor: Default, User Defined and Parameterized Constructor
- 2
- Default Arguments in Constructor
- Performance, MIL, and the Order of Initialization
- 3
- Constructor and Destructors: User Defined Copy Constructor
- Destructors
- 4
- The Important Trio: Destructor, Copy Constructor and Overloaded Assignment
- Need of User Defined Important Trio and Matrix Class with Dynamic Construction
Parameter Passing [3 Notes- Negligible Effort]
- 1
- Inline Functions
- Parameter Passing in C ++ Functions
- 2
- Static Functions, Const Function and Volatile Functions
Binding [6 Notes- Negligible Effort]
- 1
- Types of Inheritance in C ++
- Functions in C ++ : Prototype, Overload, Arguments
- 2
- Friend Functions, Pointer to Function and Member Function
- Operator Overloading
- 3
- Operator Overloading with Friend Functions
- Operators That Cannot be Overloaded Using Friend Functions
Abstract Data Types [47 Notes- 6% Effort]
- 1
- Object Oriented Programming Concepts: From C to C ++
- Class in C ++ (Rev.) : Introducrion
- 2
- Object in C ++
- Instantiation
- 3
- Abstract Class
- Inheritance
- 4
- Polymorphism (Rev.)
- Abstraction
- 5
- Encapsulation
- Templates
- 6
- Streams and Files
- The Standard Template Library
- 7
- Sequence Containers: Vector
- Other Containers and Generic Algorithms
- 8
- Map, Set and Algorithms
- Introduction to the C ++ Object Model
- 9
- Four Paradigms to Code: C Style, ADT Style, Object Based or Object-Oriented Type
- C ++ Object Model Layout
- 10
- Constructors and Embedded Objects
- A Class with Virtual Function is Inherited
- 11
- How Object Model Changes the Program
- What Are the Additions if the Compiler Offers NRV and ADT or Hierarchy?
- 12
- Object Model Changes the Program
- Object Oriented Programming Concepts: Classes and Objects
- 13
- Classes and Objects β Assigning Object
- Pointer to Class and Data Member, Const Objects and Memory Allocation of Classes and Objects
- 14
- Function Templates
- Implementing Runtime Polymorphism
- 15
- OO Programming Methodology and Need for Virtual Destructors
- Runtime Polymorphism by Virtual Functions
- 16
- Base and Derived Classes
- Virtual Functions
- 17
- Multiple and Virtual Inheritance
- Multiple Copies of Multiple Inherited Base Class and the Order of Constructors and Destructors Calls
- 18
- Inheritance- The Inside View
- Protected Inheritance
- 19
- Inheriting Further: Many Levels of Inheritance
- Varieties of Inheritance
- 20
- Inheritance in C ++
- Private Inheritance and Observations (for Questions)
- 21
- Class Templates
- C ++ Template for Safe Array
- 22
- Static Members in Classes
- Class Specialization
- 23
- Access Specification and Defining Member Functions Outside the Class
- Public Interface of Time Class and Unions in C ++
- 24
- Local Classes and Defining Class Globally
Arrays [8 Notes- Negligible Effort]
- 1
- Arrays
- Array Operations: Sequential Traversal
- 2
- Array - Applications, Uses
- Arrays and Strings
- 3
- String: Initialization is Not Straightforward
- Strings: Finding a Character or a Substring
- 4
- Strings: Dealing with Multiple Strings
- Strings: Using Functions with Strings
Stacks [9 Notes- Negligible Effort]
- 1
- Stacks: Basic Theory
- Applications of Stack: Balanced Parentheses Problem, Reversal of Strings
- 2
- Applications of Stack - Undo/Redo in Editor
- Applications of Stack: Backtracking
- 3
- Applications of Stack: Infix to Postfix Expression
- Stack ADT: Uses of Stack in Computing ADT, ADT Stack Operations, Implementation of ADT Stack
- 4
- Implementation of Stack ADT: Array, Performance and Limitation, Growable Array, Multiple Stack, Full Condition, Using List ADT
- Application of Stack β 1: Stack and Its Application, Algebraic Expression, Reverse Polish (Postfix) Notation, Using Stacks
- 5
- Application of Stack II: Balanced Parentheses Using Stack, the Importance of Stack in Function Call and Recursion, Backtracking
Queues [13 Notes- 1% Effort]
- 1
- Queues: Enqueue
- Queues: Implementing the Queue
- 2
- Queue Variations: Double-Ended Queue
- Queue Variations: Circular Queue
- 3
- Queue Applications: CPU Scheduling or Disk Scheduling, Asynchronous Data Transfer
- Queue Applications: Interrupt Handling
- 4
- Queue Applications: Checking for Palindromes, Applications of Priority Queues
- Queue Variations - Priority Queue, Heap
- 5
- Queue ADT: Queue, Applications of Queue Data Structure
- Implementation of Queue ADT: Queue Data Structure, Dynamic Queue Implementation Using Arrays
- 6
- Applications of Queue ADT: Printing Job Management, Customer Service at State Bank of India, Round- Robin Scheduler, Queue Application β Breadth First Application, Using Queue β Coding Message
- Priority Queue and Applications: Priority Queue ADT, Entry ADT, Operations, Comparator, Implementation with an Unsorted Sequence, Sorted Sequence, Applications of Priority Queue, Sorting
- 7
- Priority Queue and Heaps: Implementation of Priority Queue, Binary Heap
Linked Lists [9 Notes- 1% Effort]
- 1
- Linked Lists: Pointer Power
- Linked Lists - Part 2
- 2
- Type of Linked List: Doubly Linked List, Insertion, Deletion, Reverse
- Type of Linked List: Circular Linked List, Multiply Linked List, Empty Lists, Chunk List
- 3
- Applications of Linked List
- Sparse Matrix
- 4
- List and List ADT: Everyday List, Properties, Categories of Linear Lists, Operations, Three Forms of General Lists
- Array Implementation of List ADT: Implementation of ADT Static Implementation of ADT List, List Implementation Using Arrays, Problem Associated with Dynamic Arrays
- 5
- Linked List Implementation of List ADT: Pointer, Easy and Fast Insertions and Deletions, Traversal & Printing, Circular, Doubly, Empty-Doubly Linked List, Performance, Advantages and Disadvantages, Polynomial ADT, Analysis
Trees [32 Notes- 3% Effort]
- 1
- Tress
- Tress - Height of a Tree; Height of Node, Depth, Path, Forest, Subtree
- 2
- Trees - Binary Tree & Types
- Tress: Balanced Binary Tree
- 3
- Tress: Deletion
- Tree Traversal
- 4
- Miscellaneous Trees: Insertion and Rotation
- Miscellaneous Trees: Red Black Tree, Black Depth & Black Height
- 5
- Miscellaneous Trees: Heap Tree
- Miscellaneous Trees: B Tree
- 6
- Miscellaneous Trees: B + Tree
- Tree ADT- I: Tree, Terminology, Kinds of Trees, Importance, Representation, Recursive Data Structure, Problem with General Tree and Solution, Converting a General Tree to a Binary Tree
- 7
- Tree ADT β II: Binary Tree, ADT, Examples, Special Type, Complete and Balanced, Operations, Array Representation, Linked Representation, Level Order Traversal, Euler Tour Traversal
- Binary Search Trees β I: Other Properties of Binary Search Tree, Ordered Dictionaries, Searching BST
- 8
- Binary Search Tree β II: Traversal, Construction, Removing or Deleting from Binary Search Tree
- Balanced Binary Search Trees and AVL Trees: Prevent the Degeneration of the Binary Search Tree, Rotations
- 9
- Insertion and Deletion β AVL Trees: Insertion into AVL Trees, Algorithm, Rebalancing, Deletion, Pros and Cons of AVL Trees
- Red Black Tree β I: Red Black Tree Properties, Black-Height of a Node, Operations, Rotations and Red-Black Tree, Modifying Operations, Insertion
- 10
- Red Black Trees β II: Deletion from Red-Black Trees, Bottom-Up Deletion, Concept, Deletion β Case 1 and Case 2, Steps of the Deletion Procedures, Deletion and Violation of Red-Black Properties
- Splay Trees: Six Cases of Splaying, Operations, Types of Rotation, Splaying During Other Operations, Splaying Operation with Splitting Trees, Analysis, Advantages
- 11
- Multi-Way Trees and 2 - 3 Trees: Multi-Way Search Tree, Efficiency, Deletion Algorithm, 2 - 3 Trees vs Binary Tree
- B Trees: Properties, Bounds on the Number of Keys of a Node, Insertion, Deletion, B Tree Index, Advantages
- 12
- 2 - 3-4 Trees: Features, Insertion, Splitting Nodes During Insertion, Deleting, Cases of Upgrading in 2 - 3-4 Tree, Turning a 2-Node into 3-Node, Efficiency, Drawback of 2 - 3-4 Tree
- Introduction to Graphs: Types, Degree, Trees as Graphs, Application, Representation
- 13
- Graph ADT and Graph Traversals: Graph ADTs, Graphs and Circuits, Graph-Searching Algorithms, Depth First Search (DFS)
- Minimum Spanning Trees-I: Spanning Tree, Properties, MST Algorithms
- 14
- Minimum Spanning Trees- Kruskal: Algorithm, Concept of KruskalΥs Algorithm, Walk through
- Minimum Spanning Trees β PrimΥs Algorithm: PrimΥs Algorithm Analysis of the PrimΥs Algorithm
- 15
- Topological Sorting: Digraphs, DAG, Conclusion, Cyclic Graphs, Complexity Analysis, Applications
- Topological Sorting as an Application of DFS: Topological Sort, Depth First Search Algorithm and Edge Classification, Time Complexity. Algorithm Using DFS
- 16
- Shortest Path Algorithm - I: Shortest Path Variants, Algorithms
- Shortest Path Algorithm II: Dijkstra and Negative-Weight Edges, Bellman-Ford Algorithm, Bellman -Ford (G, W, S) , All-Pair Shortest Path Algorithm, Floyd-War Shall
Binary Search Trees [1 Notes- Negligible Effort]
Algorithms [92 Notes- 6% Effort]
Analysis [25 Notes- 1% Effort]
- 1
- Analysis, Design of Algorithms and Graph Theory
- Algorithms
- 2
- Algorithms: Expressing Algorithms
- Types of Algorithms: Algorithms by Implementation - Recursion, Logical, Serial, Deterministic, Quantum Algorithm
- 3
- Types of Algorithms: Design Paradigm - Brute Force, Divide & Conquer, Search & Enumeration, Randomized, Reduced and Backtracking Algorithm
- Types of Algorithms: Optimization Problems - Linear, Dynamic, Greedy, Branch and Bound & Heuristics Method
- 4
- Types of Algorithms: Algorithm Field of Study, Algorithms by Complexity
- Analysis of Algorithms
- 5
- Design of Algorithms
- Space and Time Complexity: Time Complexity
- 6
- Space and Time Complexity: Space Complexity
- Space and Time Complexity: Memory Usage While Execution
- 7
- Analysis of Algorithms: Time Complexity, Asymptotic Algorithm Analysis, Primitive Operation, Recurrences and Running Time
- Design of Algorithms: Techniques, Recursive Algorithms, Brute Force, Decrease and Conquer Technique, Divide, Transform and Conquer, Two Knapsack Problems, Dynamic Programming, Genetic Algorithm
- 8
- Introduction of Computing
- Types of Problems and Types of Computational Problems
- 9
- Fundamental Stages of Problem Solving
- Algorithm Verification and Validation
- 10
- Basics of Algorithm Writing
- Writing Elementary Algorithm
- 11
- Analysis of Iterative Algorithms
- Step Count
- 12
- Exhaustive Searching and Combinatorial Optimization Problems
- Complexity Analysis
- 13
- Complexity Analysis: Assignment Problem
Asymptotic Notation [8 Notes- Negligible Effort]
- 1
- Asymptotic Notations β Big Ohm, Omega and Theta:
- Asymptotic Notations, Big Notation
- 2
- Asymptotic Notations β Big Ohm, Omega and Theta: Constant Time
- Asymptotic Notations: Factorial Notation
- 3
- Asymptotic Notations: Omega Notation
- Asymptotic Notations: Theta Notation, Little O (O) Notation
- 4
- Asymptotic Notations: Little Omega Notation
- Complexity Theory (P and NP Class Problems) : P- Polynomial Time Solving, Complexity Class P
Greedy Approach [1 Notes- Negligible Effort]
Dynamic Programming [1 Notes- Negligible Effort]
Divide-And-Conquer [15 Notes- Negligible Effort]
- 1
- Divide and Conquer Technique
- Merge Sort and Quicksort
- 2
- Partitioning Algorithms
- Multiplication of Long Integers and Strassen Multiplication Algorithm
- 3
- Complexity Analysis: Strassen Matrix Multiplication Algorithm
- Strassen Matrix Multiplication
- 4
- Closest Pair and Convex Hull Problems Using Divide and Conquer
- Complexity Analysis: Convex Hull, Quick Hull, Merge Hull
- 5
- More Applications of Divide and Conquer
- Decrease and Conquer Design Paradigm
- 6
- Permutations
- Transform and Conquer Design Paradigm
- 7
- Algorithm Uniqueness
- Gaussian Elimination Method
- 8
- More Transform and Conquer Problems
Shortest Paths [3 Notes- Negligible Effort]
- 1
- Single-Source Shortest Path Problems
- Transitive Closure and Shortest Path Algorithms
- 2
- Distance Vector Algorithm, Routing Information Protocol (RIP)
Hashing [8 Notes- Negligible Effort]
- 1
- Hashing - Easy to Compute
- Hashing: Collision Resolution
- 2
- Hashing: Theorem and Performance
- Inverted Lists
- 3
- Studying Data Structures and Databases
- Dictionary ADT: Operations
- 4
- Hash and Hashing Functions: Types, Characteristics of Good Hashing Function, Applications
- Hashing and Collisions: Direct Addressing and Collision, Collision Resolution, Chaining, Open Addressing, Rehashing Strategies
Sorting [28 Notes- 2% Effort]
- 1
- Sorting and Searching Algorithms: In-Place Sorting
- Sorting and Searching Algorithms: Adaptive and Non-Adaptive Sorting, Internal and External Sorting
- 2
- Sorting and Searching Algorithms: Bubble Sort
- Sorting and Searching Algorithms: Selection Sort
- 3
- Sorting and Searching Algorithms: Insertion Sort
- Sorting and Searching Algorithms: Merge Sort
- 4
- Sorting and Searching Algorithms: Shell Sort
- Sorting and Searching Algorithms: Quick Sort
- 5
- Sorting and Searching Algorithms: Lomuto Partition Scheme, Hoare Partition Scheme
- Sorting and Searching Algorithms: Possible Permutation of Array
- 6
- Sorting and Searching Algorithms: Heapsort
- Sorting and Searching Algorithms: Variations, Bottom-Up Heapsort
- 7
- Sorting and Searching Algorithms: Radix Sort
- Sorting and Searching Algorithms: Iterative Version
- 8
- Sorting and Searching Algorithms: Variants
- Sorting and Searching Algorithms: Bucket Sort
- 9
- Sorting and Searching Algorithms: Intro Sort, Tim Sort
- Sorting and Searching Algorithms: Cube Sort, Tree Sort, Cycle Sort
- 10
- Sorting and Searching Algorithms: Library Sort, Patience Sorting
- Sorting and Searching Algorithms: Tournament Sort, Cocktail Sort, Comb Sort
- 11
- Sorting and Searching Algorithms: Gnome Sort, Odd β Even Sort, Pigeonhole Sort
- Sorting and Searching Algorithms: Counting Sort, Spread Sort, Burst Sort, Flash Sort
- 12
- Sorting and Searching Algorithms: Bead Sort, Pancake Sorting, Spaghetti Sort
- Sorting and Searching Algorithms: Brittonic Merge Sort, Bogo Sort, Stooge Sort, Sleep Sort
- 13
- Searching Algorithms: Linear Search
- Searching Algorithms: Binary Search, Approximate Matches
- 14
- Searching Algorithms: Variants, Interpolation Search,
- Parallel Algorithms for Sorting: Enumeration Sort, Odd-Even Transposition Sort, Parallel Merge Sort, Hyper Quick Sort, Parallel Quicksort, Odd-Even Merge
Searching [2 Notes- Negligible Effort]
- 1
- Performance Comparison of Various Search Techniques
- Searching and Merging: Interval Search, Jump Search, Interpolation Search, Exponential Search, Fibonacci Search
Upper and Lower Bounds [1 Notes- Negligible Effort]
Theory of Computation [59 Notes- 3% Effort]
Regular Languages and Finite Automata [15 Notes- Negligible Effort]
- 1
- Computability
- Computability: David Hilbert
- 2
- Computability: Computable Function
- Computability: Paradox Leads to Contradiction
- 3
- Theory of Computation (Introduction)
- Theory of Computation (Introduction) : An Infinite Language
- 4
- Deterministic Finite Automaton
- Deterministic Finite Automaton: Classes of Automata
- 5
- Deterministic Finite Automaton: Transition Function
- Non-Deterministic Finite Automaton
- 6
- Non-Deterministic Finite Automaton: Graphical Representation
- Equivalence of DFA and NDFA
- 7
- Equivalence of DFA and NDFA: Algorithmic Steps
- Minimizing Number of States in DFA Compilation and Interpretation
- 8
- Minimizing Number of States in DFA Compilation and Interpretation: DFA Minimization Using Equivalence Theorem
Context Free Languages and Push-Down Automata [33 Notes- 1% Effort]
- 1
- Regular Languages
- Regular Grammars
- 2
- Regular Expressions
- Regular Expressions: Set of Vowels
- 3
- Properties of Regular Language: Equivalent Formalism & Closure Property
- Properties of Regular Language: Closure Property
- 4
- Properties of Regular Language: Decidability Properties
- Pumping Lemma
- 5
- Pumping Lemma: Applications of the Pumping Lemma & for Context-Free Languages
- Non-Regular Languages
- 6
- Lexical Analysis
- Context Free Language
- 7
- Pushdown Automaton
- Pushdown Automaton: Definition, Instantaneous Description
- 8
- Pushdown Automaton: Final State Acceptability & Empty Stack Acceptability
- Pushdown Automaton: Construct a PDA
- 9
- Non-Deterministic Pushdown Automaton
- Context Free Grammar
- 10
- Context Free Grammar: Extended Context-Free Grammar
- Greibach Normal Form
- 11
- Greibach Normal Form: The Production Rule
- Ambiguity
- 12
- Ambiguity: Parse Trees Exist
- Ambiguity: Ambiguous and Unambiguous Grammer
- 13
- Equivalence of PDAΥs and Context Free Grammars
- Properties of Context Free Language
- 14
- Context-Sensitive Languages
- Unrestricted Grammars
- 15
- Chomsky Hierarchy of Languages & 4 Types of Grammar
- Chomsky Hierarchy of Languages: Type 1 Grammar
- 16
- Regular Expressions: Mealy & Moore Machine
- Regular Expressions: Conversion from Mealy Machine to Moore Machine
- 17
- Regular Expressions: Conversion from Moore Machine to Mealy Machine
Recursively Enumerable Sets and Turing Machines [9 Notes- Negligible Effort]
- 1
- Turing Machines
- Turing Machines: Formal Definition of Turing Machine
- 2
- Standard Turing Machine and Its Variations
- Universal Turing Machines
- 3
- Models of Computation and Church-Turing Thesis
- Recursive and Recursively-Enumerable Languages
- 4
- Construction of TM for Simple Problems
- Construction of TM for Simple Problems: Turing Machine for Multiplication
- 5
- Construction of TM for Simple Problems: Approach is Concerned
Undecidability [2 Notes- Negligible Effort]
Compiler Design [44 Notes- 3% Effort]
Lexical Analysis [7 Notes- Negligible Effort]
- 1
- Bootstrap Compilers
- Lexical Analysis: Longest Match Rule, Look Ahead, Lex, Lexical Error
- 2
- Chomsky Hierarchy of Languages
- Studying System Software and Compilers
- 3
- Chomsky Normal Form
- Chomsky Normal Form: Problem in the Step Wise Manner
- 4
- Chomsky Normal Form: Grammar
Parsing [8 Notes- Negligible Effort]
- 1
- Context Free Grammars
- Parsing and Parse Trees
- 2
- Top-Down and Bottom up Parsers, Shift-Reduce Parser, LR Parser; Recursive Decent, Predictive & LL Parser
- YACC Package on Unix System
- 3
- Parse Tree Representation of Derivation Trees
- Parse Tree Representation of Derivation Trees: Application of Derivation Tree
- 4
- Parse Tree Representation of Derivation Trees: The Starting Symbol
- Semantic Analysis: Attribute Grammar
Runtime Environments [5 Notes- 1% Effort]
- 1
- System Software and Compilers
- Assembly Language Fundamentals: Labels, Mnemonics, Operands
- 2
- Assembly Language Fundamentals: Single-Line Comments, Multi-Line Comments, Directives
- Assembly Language Fundamentals: Reserved Words, Constants, Identifiers, Big-Endian & Little-Endian Format
- 3
- Compilation and Interpretation
Intermediate and Target Code Generation [15 Notes- Negligible Effort]
- 1
- Assemblers-2-Pass and Single-Pass
- Intermediate Code: Quadruples, Triples
- 2
- Intermediate Code Generation: Code Optimization
- Intermediate Code Generation: Intermediate Representations
- 3
- Intermediate Code Generation: Translation of Declarations
- Intermediate Code Generation: Assignments
- 4
- Intermediate Code Generation: Control Flow
- Intermediate Code Generation: Boolean Expressions and Procedure Calls
- 5
- Code Generation and Code Optimization: Control-Flow
- Code Generation and Code Optimization: Data-Flow Analysis & Data Flow Properties
- 6
- Code Generation and Code Optimization: Local Optimization
- Code Generation and Code Optimization: Global Optimization
- 7
- Code Generation and Code Optimization: Loop Optimization
- Code Generation and Code Optimization: Peep-Hole Optimization
- 8
- Code Generation and Code Optimization: Instruction Scheduling; Algorithms
Basics of Code Optimization [9 Notes- Negligible Effort]
- 1
- Non-Deterministic Algorithm: Non -Deterministic Programming Constructs
- Semantic Analysis: Associativity
- 2
- Semantic Analysis: Precedence
- Semantic Analysis: Grammar Transformations
- 3
- Semantic Analysis: Syntax Directed Definitions
- Semantic Analysis: Inherited and Synthesized Attributes
- 4
- Semantic Analysis: Dependency Graph
- Semantic Analysis: Evaluation Order
- 5
- Semantic Analysis: Type-Checking
Operating System [80 Notes- 7% Effort]
Processes [28 Notes- 2% Effort]
- 1
- Operating Systems with Unix
- Kernel
- 2
- Types of Kernels
- Main Functions of Operating Systems
- 3
- Multiprogramming
- Multiprocessing: Symmetric & Asymmetric Multiprocessing
- 4
- Multitasking
- Multithreading
- 5
- Difference between Process vs Thread
- Concept of Threading
- 6
- Types of Threads
- Multithreading Models
- 7
- Process Lifecycle and States
- Process in Memory
- 8
- States of Thread
- Scheduling
- 9
- CPU Scheduling & Parameters
- CPU Scheduling Schemes
- 10
- I-O or Disk Scheduling: Input/Output or I/O Scheduling
- I-O or Disk Scheduling: First Come -First Serve
- 11
- Deadlock - Mutual Exclusion, Hold & Wait, Circular Wait, Live Lock
- Deadlock Handling
- 12
- System Calls
- Studying Operating Systems and UNIX
- 13
- Threads (Implicit Threading) : Thread Pools, OpenMP, Grand Central Dispatch (GCD)
- Threads (Threading Issues) : The Fork () and Exec () System Calls, Signal Handling, Thread Cancellation, Thread-Local Storage, Scheduler Activations
- 14
- Multi User System: Terminal Services and Fast User Switching
- Operating Systems, Computer Systems, Why Do We Need Operating System
Concurrency [2 Notes- Negligible Effort]
- 1
- Types of Operating Systems: Single and Multi-Tasking
- Types of Operating Systems: Real-Time Operating Systems
Deadlock [5 Notes- Negligible Effort]
- 1
- Critical Regions
- Types of Mutual Exclusion Devices: Locks: Spinlocks
- 2
- Types of Mutual Exclusion Devices: Semaphore and Reader-Writer Lock - Readers-Writers Problem
- CPU Scheduling (Real-Time CPU Scheduling) : Minimizing Latency, Priority-Based Scheduling, Rate-Monotonic Scheduling, Earliest-Deadline-First Scheduling, Proportional Share Scheduling, POSIX Real-Time Scheduling
- 3
- Scheduling Mechanisms
CPU Scheduling [6 Notes- Negligible Effort]
- 1
- Concurrent Processing
- Mutual Exclusion
- 2
- Mutual Exclusion Possible Solutions: Hardware Solutions
- CPU Scheduling (Multiple-Processor Scheduling) : Approaches to Multiple-Processor Scheduling, Processor Affinity, Load Balancing, Multicore Processors
- 3
- Operating System: Process, Context Switching, Process States, Types of Schedulers, Memory Management Techniques, Fragmentation, Variable Contiguous Memory Allocation
- Queuing Disciplines, Scheduling
Memory Management and Virtual Memory [17 Notes- 1% Effort]
- 1
- Memory Management
- Basic Concepts and Terminologies
- 2
- Virtual Memory
- Concept of Paging
- 3
- Translation Lookaside Buffer or TLB
- Page Fault
- 4
- Paging Techniques and Algorithms: Demand Paging; Anticipatory Paging
- Page Replacement Algorithms: Evaluate the Algorithms
- 5
- Page Replacement Algorithms: Optimal Page Replacement
- Segmentation
- 6
- Difference between Paging and Segmentation
- Fragmentation
- 7
- Memory Management (Memory-Mapped Files) : Persisted Memory-Mapped Files, Non-Persisted Memory-Mapped Files
- Virtual Memory: Paging
- 8
- Drawback of Virtual Memory and Types of Misses
- Virtual Memory: Segments
- 9
- Memory Management System
Input-Output Systems [2 Notes- Negligible Effort]
- 1
- Linux Operating Systems (Input and Output) : Output Redirection, Input Redirection
- Linux Operating Systems (Network Structure)
Protection and Security [20 Notes- 1% Effort]
- 1
- Access Matrix: Contents of the Access Control Matrix, Implementation of Access Matrix
- Access Control
- 2
- Revocation of Access Rights: Schemes for Revocation for Capabilities
- Program Threats: Logic Bomb, Stack and Buffer Overflow, Virus
- 3
- Implementing Security Defenses
- Security (Cryptography as a Security Tool) : Cryptography Techniques
- 4
- User Authentication: Knowledge Factors, Possession Factors, Inherence Factors, Types of User Authentication
- Salami Attack and Covert Channels
- 5
- Operating System Memory Protection
- Memory and Address Protection: Relocation and Base/Bounds Registers
- 6
- Memory and Address Protection: Tagged Architecture and Segmentation
- Memory and Address Protection: Paging and Combined Paging with Segmentation
- 7
- Protection in General Purpose Operating System
- Capability and File Protection Mechanisms
- 8
- Group Protection and Single and Temporary Acquired Permission
- User Authentication: Using Passwords
- 9
- Secure Passwords: Vulnerability of Probable Passwords, OTP, and Other Mitigating Measures
- Attacking Authentication Mechanism
- 10
- Password Change Functionality
- Incomplete Validation of Credentials
Databases [97 Notes- 9% Effort]
ER-Model [5 Notes- Negligible Effort]
- 1
- E-R Diagrams and Transformation to Relational Design: ER Diagram, Components of an Entity Relationship Diagram, Attributes, Composite Attribute, Derived Attribute, Multi-Value Attribute
- E-R Diagrams and Transformation to Relational Design: Primary Key Using Attributes
- 2
- E-R Diagrams and Transformation to Relational Design - Based on the Degree & Recursive Relationship
- E-R Diagrams and Transformation to Relational Design: Chen Style, CrowΥs Foot Notation, Bachman Style, Martin Style, Transforming to Relational Design
- 3
- EER Diagrams: Generalization, Specialization,
Relational Model [15 Notes- 2% Effort]
- 1
- Relational Database Design and SQL
- Timeline of Databases
- 2
- Types of Database: Flat Files, Hierarchical Databases, Network Databases, Embedded Databases, Graph Database, Operational Database, Document Oriented Database
- Fundamentals of Database: Relational Working in Databases, Tuple, Attribute, Domain, Relational Schema, Null
- 3
- Keys in Relational Database Design: Key- Candidate Key, Super Key, Primary Key, Alternate Key, Composite Key, Unique Key, Foreign Key, Surrogate Key, Natural Key
- CoddΥs Rules for Relational Database Models
- 4
- Architecture of Database: Three-Schema Architecture, Centralized DBMS Architecture, Basic Client/Server DBMS Architecture, Two-Tier Client/Server Architecture, Three-Tier Client/Server Architecture, N-Tier Client/Server Architecture
- ACID Properties in a Database: Transactions
- 5
- Normalization - Basics: Normalization, Need for Normalization, Functional Dependency, Definition
- Normalization - Basics: Attribute Closure (Primary & Secondary Rules)
- 6
- Normalization - Basics: Decomposition, Lossy Decomposition, Lossless Decomposition, Dependency Preservation,
- Normalization-INF, 2 NF, 3NF, BCNF and 4NF - First Normal Form
- 7
- Normalization-INF, 2 NF, 3NF, BCNF and 4NF - Boyce β Codd Normal Form
- SQL: Database Objects
- 8
- Relational Algebra and Relational Calculus: Join Operations
Database Design [40 Notes- 3% Effort]
- 1
- Components of DBMS: Drilling down into the Database Management System, Database Manager, Query Processor, Data Dictionary
- Centralized and Distributed Database: Centralized Database, Distributed Database, Homogeneous Distributed Database, Heterogeneous Distributed Database, Horizontal Data Fragmentation, Vertical Fragmentation, Hybrid Fragmentation
- 2
- Object Oriented Database Management Systems
- Object Oriented Database Management Systems: Composite Objects
- 3
- OODBMS - Integration with RDBMS Applications
- Object Oriented Database Management Systems: ORACLE, Object Views, Advantages
- 4
- SQL - Data Dictionary, Metadata
- Temporal Database Concepts
- 5
- Temporal Database Concepts: Snapshot Databases
- Temporal Database Concepts: Rollback Databases
- 6
- Multimedia Databases
- Multimedia Databases: Linked Multimedia Databases
- 7
- Multimedia Databases: Repository Applications
- Deductive Databases
- 8
- Internet Databases
- Mobile Databases
- 9
- Genome Data Management
- Genome Data Management: Human Genome
- 10
- K-Nearest Neighbor
- K-Nearest Neighbor: K-NN Classification
- 11
- Hidden Markov Model
- Social Network Analysis
- 12
- Social Network Analysis: Degree Centrality
- Big Data Characteristics
- 13
- Big Data Characteristics: Data Veracity
- Types of Big Data
- 14
- Big Data Architecture
- Introduction to Map-Reduce and Hadoop
- 15
- Introduction to Map-Reduce and Hadoop: Modules of Hadoop
- HDFS (Hadoop Distributed File System)
- 16
- NOSQL and Query Optimization
- NOSQL and Query Optimization: Types of NoSQL Databases
- 17
- NOSQL and Query Optimization: Graph Stores
- Different NOSQL Products
- 18
- Different NOSQL Products: Cassandra
- Querying and Managing NOSQL
- 19
- Indexing and Ordering Data Sets
- NOSQL in Cloud
- 20
- Multimedia Applications, Taxonomy of Real-Time Applications, Multimedia Application Types, Streaming Stored Audio/Video
- Real-Time Transport Protocol (RTP)
Query Languages [22 Notes- 1% Effort]
- 1
- Relational Database Design and SLQ: Relation
- Query Processing and Optimisation: Aspects of Query Optimization, Example of Query Processing, Example for βInternal Representationβ of the Query, Ordering of the Relational Algebra Operators
- 2
- SQL
- SQL: Data Definition Language (DDL) , Create, Alter, Drop, Truncate, Comment, Rename, Referential Integrity Statements
- 3
- SQL: Data Manipulation Language (DML) , Insert, Update, Delete
- SQL: Data Control Language (DCL) Commands, Grant, with GRANT OPTION, Revoke
- 4
- SQL: Transaction Control Language (TCL) Commands, Commit, Rollback, Savepoint, Set Transaction, Autocommit
- SQL: Operations and Clauses, Union, Intersect, Minus
- 5
- SQL: Views
- SQL: Indexes, Clustered Indexes, Non-Clustered Indexes
- 6
- SQL - Sequences
- SQL: Synonyms
- 7
- SQL: Wildcard Operators
- Database Languages and Interfaces
- 8
- Update Operations and Dealing with Constraint Violations
- Relational Algebra and Relational Calculus
- 9
- Stored Procedures and Functions
- Database Triggers
- 10
- SQL Injection
- SQL Injection: SQL in Web Pages
- 11
- Database Security and Authorization
- Database Security and Authorization: Overview of Authorization
File Structures [13 Notes- Negligible Effort]
- 1
- Data and File Structures
- Definition of Data Structure
- 2
- Definition of Data Structure: Classification Style
- Data Information
- 3
- Array Operations: Insertion, Deletion, Search Operation, Update Operation
- Array, Address Calculation: Base Address, One Dimensional Array, Two Dimensional Array, Row Major Order
- 4
- Array, Address Calculation: Column Major Order, Three Dimensional Array
- Stacks: Peek or Top
- 5
- File Structures
- Fields, Records and Files
- 6
- Sequential, Direct, Inbox-Sequential and Relative Files
- Distributed File System
- 7
- Distributed Systems (Distributed File Systems)
Transactions and Concurrency Control [2 Notes- Negligible Effort]
- 1
- Concurrency and Recovery in Centralized and Distributed Database System: Recovery in Databases, Concurrency Control through Locking, Concurrency Control through Timestamp, Optimistic Concurrency Control
- Concurrency and Recovery in Centralized and Distributed Database System: System Log, Caching/Buffering, Check-Pointing, Shadow Paging
Information Systems and Software Engineering [210 Notes- 9% Effort]
Information Gathering [39 Notes- 1% Effort]
- 1
- Software Engineering
- Software Engineering: The Bureau of Labor Statistics
- 2
- Software Engineering: Why There Was a Need for Software Engineering Process?
- Software Engineering: Software Engineering Institute
- 3
- Software Engineering: Software is Developed or Engineered
- Software Engineering: Characteristics of Software
- 4
- Software Engineering: System Software & Application Software
- Software Engineering: Engineering or Scientific Software
- 5
- Software Engineering: Embedded Software & Product Line Software
- Software Engineering: Web Applications, Artificial Intelligence Software
- 6
- Software Engineering: Open-World Computing, Netsourcing, Open Source
- Software Engineering: Legacy Software or System
- 7
- Software Engineering: Legacy Systems Pose Problems
- Software Engineering: Brownfield Architecture
- 8
- Software Engineering Sub-Disciplines
- Software Engineering Sub-Disciplines: Software Configuration Management, Software Engineering Management
- 9
- Software Engineering Sub-Disciplines: Computing Foundations, Engineering Foundations
- Software Engineering Layers
- 10
- Software Engineering Layers: Methods
- Process Framework and Umbrella Activities
- 11
- Process Framework and Umbrella Activities: Communication
- Process Framework and Umbrella Activities: Software Project Tracking and Control
- 12
- Process Framework and Umbrella Activities: Measurement
- Software Engineering Principles
- 13
- Software Engineering Principles: What You Produce, Others Will Consume, be Open to the Future; Plan Ahead for Reuse;
- Software Engineering Principles: Think, Rigor and Formality, Separation of Concerns; Modularity
- 14
- Software Engineering Principles: Abstraction, Anticipation of Change, Generality, Incrementality
- Software Myths
- 15
- Software Myths: Modern Software Engineering Practice
- Software Myths: Customer Myths
- 16
- Software Myths: PractitionerΥs Myths
- System Development Life Cycle
- 17
- System Development Life Cycle: Planning
- System Development Life Cycle: Analysis
- 18
- System Development Life Cycle: Design, Development
- System Development Life Cycle: Implementation
- 19
- System Development Life Cycle: Common Vocabulary
- Software Configuration Management: The Key Elements, Participant of SCM Process
- 20
- Change Control and Version Control: Change Control Activities, Version Control, Features of VCS, Advantages of the VCS, Different Types of VCS, GitHub
Requirement and Feasibility Analysis [7 Notes- Negligible Effort]
- 1
- Requirement Analysis and Specifications
- Software Requirements (Functional and Non-Functional Requirements) : Functional Requirements, Advantages of Functional Requirement, Non-Functional Requirements, Advantages of Non-Functional Requirement
- 2
- Software Requirements (Eliciting Requirements) : Requirements Gathering, Requirement Elicitation Process & Techniques
- Software Requirements (Developing Use Cases) : Sample Use Case and Extension
- 3
- Software Requirements (Requirement Analysis and Modelling) : Requirements Analysis Process, Requirement Analysis Techniques
- Software Requirements (Requirements Review)
- 4
- Software Requirements (Software Requirement and Specification) : Advantages of SRS, Characteristics of SRS, Purposes Served by SRS, Testing the SRS
Process Life Cycle [12 Notes- Negligible Effort]
- 1
- Water Fall Model
- Water Fall Model: RoyceΥs Original Waterfall Model
- 2
- Water Fall Model: System Maintenance
- Water Fall Model: Product Managers
- 3
- Water Fall Model: Modified Waterfall Model
- Water Fall Model: Winston Royce
- 4
- Evolutionary Process Models: Spiral Methodology
- Aspect-Oriented Software Development: Core Concerns, How to Handle Such Crosscutting Concerns
- 5
- Aspect-Oriented Software Development: Aspect Oriented Design Process
- Feature Driven Development: History of the FDD, Lifecycle & Milestone
- 6
- Crystal, Crystal Method Characteristics, Crystal Method Family Members
- Web Engineering: Need for Web Engineering, Perceptions of Web Development, Web Engineering Framework
Planning and Managing the Project [54 Notes- 2% Effort]
- 1
- Software Engineering Principles: The Reason It All Exists, Keep It Simple, Maintain the Vision
- Incremental Build Model
- 2
- Incremental Build Model: Customer Feedback
- Incremental Build Model: Staged Delivery Model
- 3
- Incremental Build Model: Appraisal of the Incremental Model
- Evolutionary Process Models
- 4
- Evolutionary Process Models: Prototyping
- Evolutionary Process Models: Horizontal Prototype
- 5
- Evolutionary Process Models: Vertical Prototype
- Evolutionary Process Models: Throwaway Prototyping
- 6
- Evolutionary Process Models: Paper Prototyping
- Evolutionary Process Models: Evolutionary Prototyping
- 7
- Evolutionary Process Models: Incremental Prototyping, Extreme Prototyping
- Evolutionary Process Models: Business Prototypes
- 8
- Evolutionary Process Models: Prototyping Approach and Spiral Model
- Evolutionary Process Models: Spiral Model (Cont β¦)
- 9
- Evolutionary Process Models: Risk Handling
- Evolutionary Process Models: Risk Determines Degree of Details
- 10
- Evolutionary Process Models: Rapid Application Development
- Evolutionary Process Models: Working of RAD, Requirements Planning Phase
- 11
- Evolutionary Process Models: User Design Phase, Construction Phase
- Evolutionary Process Models: Cutover Phase; RAD Model Design
- 12
- Evolutionary Process Models: Process Modeling, Application Generation, Testing and Turnover
- Evolutionary Process Models: An Appraisal of the RAD Model
- 13
- Evolutionary Process Models: Joint Application Development
- Evolutionary Process Models: System Developer
- 14
- Evolutionary Process Models: Design Phases
- Evolutionary Process Models: Subject Matter Experts
- 15
- Evolutionary Process Models: JAD Model
- V-Model for Software Development
- 16
- V-Model for Software Development: Verification
- V-Model for Software Development: Verification Phases
- 17
- V-Model for Software Development: Validation Phases; Uses & Appraisal
- V-Model for Software Development: Disadvantage
- 18
- Big Bang Model
- Code and Fix Model
- 19
- Test Driven Development
- Test Driven Development: Avoid Duplication of Code
- 20
- Test Driven Development: Sequence
- Test Driven Development: Refactor Code
- 21
- Test Driven Development: Appraisal
- Agile Software Development
- 22
- Agile Software Development: Nimble Team
- Agile Software Development: Process Become Agile
- 23
- Agile Software Development: Individuals and Interactions
- Agile Software Development: Principles
- 24
- Agile Software Development: Incremental and Evolutionary
- Agile Software Development: Quality Focus & Terminologies
- 25
- Agile Software Development: Burndown Chart, CRC, Daily Meeting, Heartbeat Retrospective, Incremental Development
- Agile Software Development: Iterative Development, Kanban, Lead Time, Minimum Marketable Feature or MMF, Minimum Viable Product or MVP, Mob Programming, Pair Programming, Refactoring
- 26
- Agile Software Development: Scrum, Scrum Master, Timebox, Sprint, Product Owner, Product Backlog
- Agile Software Development: User Stories, Epic, Theme, Team, Three CΥs, Three Questions
- 27
- Extreme Programming (XP)
- Extreme Programming (XP) : Roles
Design [36 Notes- 1% Effort]
- 1
- Software Project Management: Art and Science
- Software Project Management: Crucial Part of a System
- 2
- Software Project Management Tools: Gantt Chart
- Software Project Management Tools: Progress Gantt Charts, Linked Gantt Charts
- 3
- Software Project Management Tools: Work Breakdown Structure, Project Table
- Software Project Management Tools: Resource Histogram, Program Evaluation and Review Technique
- 4
- Software Project Management Tools: Critical Path Analysis
- Software Metrics: Software Metric. Process Metrics, Project Metrics, Product Metrics
- 5
- Software Metrics: Code Coverage
- Software Metrics: Source Lines of Code
- 6
- Software Metrics: Bugs Per Line of Code, Function Point
- Software Metrics: Function Point Analysis
- 7
- Software Metrics: Numerical Rating
- Software Metrics: Constructive Cost Model, Constructive Cost Model or COCOMO
- 8
- Software Metrics: Basic COCOMO Model
- Software Metrics: Intermediate COCOMO
- 9
- Software Metrics: Detailed COCOMO, Cyclomatic Complexity
- Software Metrics: Linearly Independent Paths
- 10
- Software Design
- Software Design: System Design
- 11
- Software Design: Detailed Design
- Software Design: Function Oriented Design
- 12
- Software Design, Function Oriented Design: Data-Flow Design, Structural Decomposition & Detailed Design Description, Data Flow Diagram or DFDs in Detail
- Software Design, Function Oriented Design: External Entity
- 13
- Software Design, Function Oriented Design: A Logical Data Flow Diagram
- Object Oriented Design
- 14
- Object Oriented Design: Interface, Polymorphism
- User Interface Design
- 15
- User Interface Design: Place the User in Control, User Interface Design Process
- User Interface Process & Design Evaluation
- 16
- Patterns
- Patterns: Types of Design Patterns: Creational
- 17
- Patterns: Types of Design Patterns: Singleton, Object Pool, Dependency Injection, Lazy Initialization, Multiton, Resource Acquisition is Initialization (RAII)
- Structural Object Patterns
- 18
- Behavioral Object Patterns Part I
- Behavioral Object Patterns Part II & Data Access Patterns
Coding [9 Notes- Negligible Effort]
- 1
- Programming Techniques and Tools
- Class-Responsibility-Collaboration
- 2
- Clean Room Approach
- Clean Room Approach: Statistically Sound Testing
- 3
- Clean Room Approach: Components & 3 Approaches, Three Types of Boxes in Cleanroom Approach
- Software Re Engineering
- 4
- Software Re Engineering Process Model
- Software Re Engineering: Reverse Engineering, Code Restructuring
- 5
- Software Re Engineering: Data Restructuring, Forward Engineering, Economics of Reengineering
Testing [46 Notes- 2% Effort]
- 1
- Software Quality Assurance and Techniques
- Software Quality Assurance and Techniques: Quality Assurance
- 2
- Software Quality Assurance and Techniques: Software Quality Assurance
- Software Quality Assurance and Techniques: Statistical SQA
- 3
- Software Quality Assurance and Techniques: Six Sigma
- Software Quality Assurance and Techniques: ISO 9000, Capability Maturity Model
- 4
- Software Quality Assurance and Techniques: Maturity Levels
- Software Quality Assurance and Techniques: Levels of Software Development & Key Processes
- 5
- Software Reliability
- Software Reliability: Mean Time between Failures or MTBF
- 6
- Software Reliability: Favorable Account of MTBF
- Software Reliability: Percentage of Time
- 7
- Errors, Faults and Failures
- Errors, Faults and Failures: Error in Coding or Logic
- 8
- Types of Testing & Terms from V-Model
- Types of Testing: Manual & Automatic Testing, ISTQB, Box Approach, White Box Testing
- 9
- Types of Testing: Statement, Branch & Path Coverage
- Types of Testing: API Testing, Faulty Injection Methods & Mutation Testing
- 10
- Types of Testing: Black-Box Testing, Equivalence Class Testing
- Types of Testing: Boundary Value Analysis, All Pair Testing, Cause-Effect Graphing
- 11
- Types of Testing: Decision Table Testing, Error Guessing, State Transition Testing,
- Types of Testing: Domain Analysis, User Story, Use Case Testing, Orthogonal Array Testing
- 12
- Types of Black Box Testing: Functional Testing, Component Interface Testing, Visual Testing, Gray-Box Testing
- Types of Testing: Unit & Integration Testing
- 13
- Types of Testing: System, Acceptance, Alpha, Beta, Adhoc, Assertion & Load Testing
- Types of Testing: Stress, Performance, Age & Benchmarking Testing
- 14
- Types of Testing: Regression Testing, Smoke Testing, Sanity Testing
- Types of Testing: Usability Testing, Security Testing, Compatibility Testing, End-To-End Testing, Endurance Testing
- 15
- Types of Testing: Continuous, Destructive, Development, a/B, Conformance, Globalization, Keyword-Driven & Loop Testing
- Types of Testing: Ramp, Scalability & Happy Path Testing
- 16
- Testing Level Metrics: Test Cases Executed, Test Effort
- Testing Level Metrics: Test Effectiveness, Test Coverage, Cost and Schedule Variance
- 17
- Testing Level Metrics: Test Team Metrics, Test Execution Status, Defect Gap, Defect Age
- Quality Factors, Quality Characteristics & Quality-In-Use Metrics
- 18
- Forensic Detection
- Drive Removal Hashing and Logical and Physical Copies
- 19
- How to Ensure the Data is Not Changed?
- Cache Files
- 20
- Email Evidence
- Hidden Techniques, Alternate Data Streams (ADS) , Steganography and Antiforensics
- 21
- Administering Security
- Approaches to Create, Update Security Plan and Recommended Controls
- 22
- Responsibility for Implementation (Accountability)
- Business Continuity Plans
- 23
- Security Incident Management and Steps
- Risk Analysis
Maintenance [7 Notes- Negligible Effort]
- 1
- Software Risk Management: Risk-Reactive Risk Strategies, Proactive Risk Strategies
- Software Risk Management: Risk Management Process, Risk Identification, Software Risk Analysis
- 2
- Software Risk Management: Software Risk Planning, Software Risk Monitoring
- Software Maintenance and Advanced Concepts
- 3
- Software Maintenance and Advanced Concepts: Software Maintenance Prediction, Types of Maintenance
- Software Maintenance and Advanced Concepts: Corrective Maintenance, Adaptive Maintenance, Perfective Maintenance, Preventive Maintenance
- 4
- Software Maintenance and Advanced Concepts: Cost of Maintenance
Computer Networks [156 Notes- 16% Effort]
ISO-OSI Stack [27 Notes- 4% Effort]
- 1
- Reference Models
- OSI Model: Physical Layer
- 2
- OSI Model: Functions of Data Link & Point-To-Point Protocol
- OSI Model - Internet Protocol
- 3
- OSI Model - Transport Layer
- OSI Model - Session Layer
- 4
- OSI Model - Application Layer
- Network Models: Layered Architecture
- 5
- Electronic Mail Architecture
- Logical Communication, OSI Model β Historical Perspective
- 6
- Application Layer Protocols β HTTP, Application Architectures, Application Interface to the Network
- Application Layer Protocols, Web and HTTP
- 7
- HTTP & SMTP, HTTP Overview, Cookies, Web Caches
- Electronic Mail - SMTP
- 8
- Applications β Accessing Mail, SMTP and Non-ASCII Data, Extended SMTP
- Mail Access Protocols
- 9
- TCP β State Diagram & Flow Control, Functions of TCP β a Review, TCP Connection Establishment
- TCP Flow Control, Silly Window Syndrome (SWS) , NagleΥs Algorithm
- 10
- ICMP
- Multicast, Multicast β Need & Overview, IP Multicasting Support, Internet Group Management Protocol (IGMP)
- 11
- Reservation Protocol (RSVP)
- Real Time Control Protocol (RTCP)
- 12
- SDP & SIP, Terms, Session Description Protocol (SDP)
- SIP: Session Initiation Protocol
- 13
- RTSP & H.323, Real-Time Streaming Protocol (RTSP)
- H.323 ITU Standard for Multimedia, H.323 Architecture, SIP vs H.323
- 14
- Overview of OSI Model
LAN Technologies (Ethernet, Token Ring) [24 Notes- 2% Effort]
- 1
- Computer Network
- Network Fundamentals
- 2
- Local Area Networks (LAN)
- Metropolitan Area Networks (MAN)
- 3
- Wide Area Networks (WAN)
- Wireless Network
- 4
- Miscellaneous Networks
- Inter Networks
- 5
- Data Communication
- Type of Addresses: Physical, Logical & Port
- 6
- World Wide Web (WWW)
- Uniform Resource Locator (URL)
- 7
- Wireless Local Area Network
- Modes of Operation of WLAN
- 8
- IEEE 802.11
- Security Mechanisms Offered by IEEE 802.11
- 9
- WEP (Wired Equivalent Privacy)
- IEEE 802.1 X Authentication and Wireless VPN
- 10
- Layers Description of IEEE 802.11
- Access Methods
- 11
- Fragmentation and Reassembly
- An Overview, Networks β an Overview
- 12
- Wireless Networks
- IEEE 802.11 Wireless LAN
Flow and Error Control Techniques [12 Notes- 1% Effort]
- 1
- Multiplexing and Concentration
- Switching Techniques
- 2
- Polling
- Asynchronous and Synchronous Transmission
- 3
- Data Communication: Half-Duplex and Duplex Modes of Communication
- Bluetooth
- 4
- Illustration of Devices in Different States and Scatter Net
- Switching Fabric, Output Ports
- 5
- Multi-Protocol Label Switching (MPLS) , Label Switching β the Motivation, MPLS Overview
- MPLS Applications, MPLS Advantages
- 6
- Bluetooth, Bluetooth Architecture, Protocol Stack in Bluetooth, Packet Structure
- Bluetooth State Machine, Frequency Hopping, IEEE 802.11 vs. Bluetooth
Routing Algorithms [21 Notes- 2% Effort]
- 1
- Internet Working - IP Addressing Basics and Representation
- Classless and Classful Addressing: Classful Addressing
- 2
- Classless and Classful Addressing: Classless Addressing
- Concatenated Virtual Circuits
- 3
- Tunneling
- Routing and Virtual Circuits and Datagrams
- 4
- Routing Algorithms: Static Routing
- Routing Algorithms: Distance Vector Routing
- 5
- Subnets and CIDR, IP Addressing, Sub Netting
- IP β Address Management, IP Address Management, Address Resolution Protocol (ARP)
- 6
- Address Configuration
- IP Options and ICMP
- 7
- IP Routing, Routing, Routing Algorithms
- IP Routing
- 8
- Inter-Domain Routing, Global Internet Routing β Challenges, Internet Organization - Autonomous Systems & Hierarchical Routing
- Multicast Routing
- 9
- Multicast, Multicast Routing, PIM: Protocol Independent Multicast, PIM - Dense Mode (PIM-DM) , PIM - Sparse Mode (PIM-SM)
- Inter-Domain Multicast
- 10
- IPv6 Overview, IPv6: Motivation, IPv6 Features, IPv6 Features
- IPv6 Addressing, IPv6 Addressing, Transition from IPv4 to IPv6
- 11
- Routing for Mobile Hosts, Security in Mobile IP, Mobility in IPv6
Congestion Control [1 Notes- Negligible Effort]
IP(V4) [21 Notes- 1% Effort]
- 1
- Domain Name System
- Malware Types and Studying Computer Networks
- 2
- Web Threats and Vulnerabilities: Introduction
- Client Level Threats and Web Server Threats
- 3
- Privacy on Web
- Web Threats: Client Level Threats
- 4
- Client Level Countermeasures Against XSS
- Threats in Network
- 5
- Threats in Network: Port Scanning Methods
- Network Threats: Snort
- 6
- Network Threats: Snort- Directional Operator in Header and Rule Options
- Security in Networks
- 7
- Who is Query?
- Enumerating Content and Functionality
- 8
- Discovering Hidden Content
- Application Pages Versus Functional Paths
- 9
- Packet Analysis
- Steps Involved in Redirecting Traffic to the Sniffer (Active Sniffing)
- 10
- Preventing Packet Capture and Detecting Packet Capture
- Applications β DNS, Domain Names, Domain Name System, Design Principle of DNS
- 11
- Domain Name Resolution, DNS Records, DNS Message Format, DNS - Benefits and Pitfalls
Application Layer Protocols [7 Notes- Negligible Effort]
- 1
- TCP IP Model and Its Protocols: Network Access Layer
- TCP IP Model and Its Protocols: Internet Layer
- 2
- IPv4 Structure and Address Space: Direct and Indirect Network Layer Delivery
- Email Security
- 3
- Application Needs and Network Performance, Network Requirements
- Transport β UDP, Overview of Transport Layer, End-To-End Protocol β Challenges
- 4
- Transport Flavors in TCP/IP β UDP and TCP, UDP, Why UDP?
Basic Concepts of Hubs [1 Notes- Negligible Effort]
Switches [3 Notes- Negligible Effort]
- 1
- Topologies, Networking Devices: Topologies
- Topologies, Networking Devices: Ring Topology
- 2
- Topologies, Networking Devices - Source Route Bridging, Router, Switch, Modem
Gateway [1 Notes- Negligible Effort]
Routers [3 Notes- Negligible Effort]
- 1
- Classless Inter-Domain Routing (CIDR) , Network Address Translation
- Router Internals, Router Architecture, Input Port Functions
- 2
- Ingress Router Functions, Core Router Functions
Network Security - Public Key and Private Key Cryptography [17 Notes- Negligible Effort]
- 1
- Network Security and Cryptography-Public Key, Secret Key
- Introduction to Cryptography
- 2
- Cryptography
- Substitution Techniques β Hill Cipher
- 3
- Polyalphabetic Ciphers
- Transposition Techniques β Permutation of Plaintext Letters and Complex Scheme, Steganography
- 4
- Stream Ciphers and Block Ciphers
- Feistel Cipher
- 5
- Design of Block Cipher
- DES (Data Encryption Standard)
- 6
- Advanced Encryption Standard (AES)
- Public Key Algorithm: Modulus, Congruent Modulo N, Practical Public Key Cryptosystem, RSA Algorithm, Greatest Common Divisor and Relatively Prime Numbers, Totient Function, Euclidean Algorithm to Find GCD
- 7
- Public Key Algorithm: RSA Algorithm
- Hash Functions in Security
- 8
- Random Number Generation
- Threats in Transit: Eavesdropping and Wiretapping, Software Based Packet Sniffer
- 9
- PGP Key Management
Digital Signature [5 Notes- Negligible Effort]
- 1
- Digital Signature
- Elgamal Digital Signature
- 2
- Digital Signature Algorithm
- Steps in DSA Algorithm: High Level Overview
- 3
- Mathematics of Steps in DSA- Signing, Verification and Validation
Firewalls [13 Notes- Negligible Effort]
- 1
- Firewalls
- System and Network Threats: Worm, Port Scanning, Denial of Service
- 2
- Viruses and Malware
- How Viruses Attach
- 3
- How Viruses Gain Control
- Virus Signatures, Code Red Worm and Polymorphic Virus
- 4
- Encrypting Viruses
- Virus β Internet Worm, Code Red, Trojan Horse
- 5
- Types of Trojans
- Trapdoor
- 6
- Firewalls: VPN, Extranet, and Dual Homed Host
- Firewalls: Screened Host and the Packet Filters
- 7
- Firewall Placement and Exploring the Internal Network
Web Technologies [44 Notes- 3% Effort]
HTML [21 Notes- 1% Effort]
- 1
- Programming Languages Introduction and Short History of Development
- HTML: Hypertext Markup Language
- 2
- HTML: Elements
- HTML: Tags
- 3
- HTML Tags: Horizontal Lines, Anchor Link, Image Tags
- HTML Tags: Alt Attribute, List
- 4
- HTML Tags: Definition List, Tables
- HTML: Cell Padding and Cell Spacing
- 5
- HTML: Tables Backgrounds, Height and Width
- HTML: Caption, Nested Tables, Comments
- 6
- DHTML: Dynamic Hyper-Text Markup Language
- DHTML: Cascading Style Sheets
- 7
- DHTML: CSS Syntax
- DHTML: Measurement Units
- 8
- DHTML: Client-Side Scripting
- DHTML: JavaScript, Server Side Scripting
- 9
- DHTML: HTML Forms, Why Do We Put in the CGI
- DHTML: JavaScript, JavaScript Syntax
- 10
- DHTML: Language, Type
- DHTML: Multi-Line Comment
- 11
- DHTML: Document Object Model
XML [7 Notes- Negligible Effort]
- 1
- XML: Extensible Markup Language
- XML: XML Syntax
- 2
- XML: Declaration, Tags, Attributes, References
- XML: Well-Formed XML, Document Type Declaration, Internal DTD
- 3
- XML: External DTD, Document Object Model
- XML: XML Parser, XSLT
- 4
- XML: Extensible Hyper-Text Markup Language
Basic Concepts of Client-Server Computing [16 Notes- 1% Effort]
- 1
- Distributed Systems (Types of Network Based Operating Systems) : Peer-To-Peer Network Operating Systems, Client/Server Network Operating Systems
- Network Structure: Distributed Networks and Processing
- 2
- Distributed Systems (Communication Structure and Protocols) : Naming and Name Resolution, Routing Strategies, Connection Strategies, Contention
- Distributed Systems (Robustness)
- 3
- Distributed Systems (Design Issues) : Heterogeneity, Openness, Security, Scalability, Failure Handling, Concurrency, Transparency, Quality of Service, Reliability, Performance
- Routing Protocols in Mobile Ad Hoc Networks (MANETs)
- 4
- Internet of Things
- Perception Layer
- 5
- Network Layer
- Application Layer
- 6
- QoS β Techniques, Qos, Resource Allocation
- QoS Approaches
- 7
- QoS β IntServ & RSVP, QoS Approaches, IntServ, Flows Pec, Data Plane in an IntServ Router
- DiffServ, Differentiated Services, Diffserv Architecture
- 8
- Differences between DiffServ and IntServ, DiffServ Advantages & Disadvantages, DiffServ Applications
- IoT, SDN & Wrapup, Internet of Things