View 2083 Notes detailed notes on NTA-NET (UGC-NET) Computer Science & Applications (87)
🎓 Study Material (2083 Notes): 2024-2025 Syllabus
Rs. 1250.00 -OR-
3 Year Validity (Multiple Devices)
👇 See Sample NotesDetails
We have 2083 Notes in NTA-NET (UGC-NET) Computer Science & Applications (87) 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).
%
Discrete Structures [34 Notes- 1% Effort]
Sets, Relations, Functions [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)
Logical Variables [1 Notes- Negligible Effort]
Pigeonhole Principle [1 Notes- Negligible Effort]
Inclusion-Exclusion Principle [1 Notes- Negligible Effort]
Equivalence and Partial Orderings [1 Notes- Negligible Effort]
Elementary Counting Techniques, Probability [1 Notes- Negligible Effort]
Measures for Information and Mutual Information [1 Notes- Negligible Effort]
Equation of Line [1 Notes- Negligible Effort]
Graph [13 Notes- Negligible Effort]
- 1
- Tree and Rooted Tree
- Graph - Spanning Trees: Introducton
- 2
- Eccentricity of a Vertex Radius and Diameter of a Graph: Eccentricity,Radius, Diameter
- Central Graphs, Centered Periphery and Uniform Central Graph
- 3
- Centres of a Tree
- Hamiltonian and Eulerian Graphs, Planar Graphs
- 4
- Planar Graphs and Coloring
- Graph - Walks, Paths, Trails, Graphs, Cycles and Circuits
- 5
- Graph Theory
- Minimum Spanning Tree: Spanning Tree
- 6
- Minimum Spanning Tree: Mathematical Properties
- Minimum Spanning Tree: Prim՚s Algorithm
- 7
- Minimum Spanning Tree: Cheapest Edges
Groups [2 Notes- Negligible Effort]
Computer Arithmetic [49 Notes- 2% Effort]
Propositional Boolean Logic [6 Notes- Negligible Effort]
- 1
- Computer Arithmetic
- Propositional Boolean Logic
- 2
- Logical Connectives
- Combining Propositions
- 3
- Rules for Combining Propositions
- Applications
Predicate Logic [3 Notes- Negligible Effort]
Well-Formed-Formulae ( WFF ) [1 Notes- Negligible Effort]
Satisfiability and Tautology [3 Notes- Negligible Effort]
- 1
- Satisfiability and Tautology
- Satisfiability and Tautology, Contradictions, Symbolism, Contingency
- 2
- Concept of Satisfiability
Logic Families [22 Notes- Negligible 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
- Boolean Algebra
- 6
- Gates Used in Boolean Algebra
- Minimization of Boolean Functions
- 7
- Minimization of Boolean Functions: The Map
- Minimization of Boolean Functions: Types of Groupings
- 8
- Special Cases of the Karnaugh Map
- Flip-Flops
- 9
- Types of Flip-Flops - Circuitous Representation: SR Flip Flop; D Flip Flop
- Types of Flip-Flops: JK Flip Flop & T Flip Flop
- 10
- Race Conditions in Flip-Flop
- Comparisons in Flip-Flop
- 11
- Design of Combinational and Sequential Circuits: Combinational Logic Circuits
- Design of Combinational and Sequential Circuits: Classfication of Sequential Logic Circuits
Representation of Numbers [14 Notes- Negligible Effort]
- 1
- Representation of Integers
- Decimal Number System
- 2
- Binary Number System
- Binary Number System: Representing the Integer (Rev.)
- 3
- Octal Number System (Rev.)
- Hexadecimal Number System (Rev.)
- 4
- 1՚s Complement Arithmetic
- 2՚s Complement Arithmetic
- 5
- Floating Point Representation (Rev.)
- Computer Arithmetic: Addition and Subtraction
- 6
- Computer Arithmetic: Multiplication and Division Algorithms
- Fixed Point Arithmetic – Ripple, Binary, Carry & 2-Level Carry Adders
- 7
- Fixed Point Arithmetic Unit – Booth, Speed up, Bit-Pair & Carry Save
- Floating Point Numbers and Arithmetic Unit
Programming in C and C Plus Plus [243 Notes- 14% Effort]
Programming in C [97 Notes- 5% Effort]
- 1
- Variables and Namespaces
- Default Arguments and Inline Functions
- 2
- Data Members and Main C ++ Program Function
- Data Types
- 3
- Structure of Data Types
- Operators and Expressions
- 4
- Member Dereferencing Operators
- Memory Management Operators
- 5
- Expressions and Their Types
- Operator Precedence
- 6
- Arrays
- Passing an Array to a Function
- 7
- Returning an Array from a Function and Array of Objects
- Functions
- 8
- User-Defined Functions
- Call by Value and Reference, Const Arguments, Recursion
- 9
- Iteration Statements (for, While, Do … While)
- Jump Statements: Break, Continue, Exit () Function and Unconditional Branching Statement (Goto)
- 10
- Fundamentals of Computer Programming
- Introduction to C Language
- 11
- Structure of C Program, Problem-Solving Process, the Algorithm and Flow Charts
- Structures in C
- 12
- Structure Initialization, Accessing Structure Members and Uses of Structure
- Character Set of C and C Tokens
- 13
- Data Types: Basic Data Type, Enumerated Type, the Void Type, Derived Type
- Decision Making
- 14
- The Switch-Case
- Forming Loops
- 15
- Loop Interruption
- Union and Enum
- 16
- Array in C
- Operators and Their Precedence
- 17
- Introduction of Data in C, Variable, Constant, Names/Identifiers, List of Reserved Word in C, Declaring Variables
- Introduction of High-Level Programming Language, Low-Level Languages, High-Level Languages, Where C Language Stands, Historical Development of C Language
- 18
- Operators and Its Precedence, Arithmetic Operators, Increment and Decrement Operator, Relational Operators, Logical Operators, Bit-Wise Operators
- Storage Classes in C, Auto Storage Class, Static Storage Class, Register Storage Class, Extern Storage Class
- 19
- Various Data Types in C, Simple Data Types, Enumerated Data Type, the Void Data Type
- Programming in C and C ++
- 20
- Programming in C
- Compilation of C Program
- 21
- Elements of C
- Tokens: Types of Tokens (Rev.)
- 22
- Tokens: Special Symbols
- Tokens: Relational Operators
- 23
- Data Types in C
- Data Types in C: Enum Data Type
- 24
- Data Types in C: User Defined Data Types
- Data Types in C: Derived Data Types
- 25
- Data Types in C: Pointers (Rev.)
- Data Types in C: Special Cases of Pointers
- 26
- Data Types in C: Functions
- Data Types in C: Pointers and Functions
- 27
- Control Structures in C
- Types of Control Structures
- 28
- Using Control Structures in C: Decision Control Statements (Rev.)
- Using Control Structures in C: Case Control Statements
- 29
- Terms Used in the Control Structures
- Pointer: Introduction, Declaration, Initialization and Its Advantages and Disadvantages
- 30
- Complex Pointers: Passing Pointers to Functions, Accessing Pointers, Wild and Void Pointers
- Arrays: Array Declarators, Adjustable and Assumed Size Array
- 31
- Arrays in Fortran, Arrays in Sections and Dynamic Memory Allocation
- Array Intrinsic Functions and Element-Wise Operations on Arrays
- 32
- Character Handling: Concept and Classification of Characters
- Character Handling: Case Conversion and Character Class Determination for Wide Characters
- 33
- Character Handling: Mapping of Wide Characters
- Command Line Argument and Example
- 34
- Parsing C Command-Line Arguments, Working, Properties and Advantages
- Drawing Various Objects on Screen: Drawing a Rectangle
- 35
- Drawing Various Objects on Screen: Drawing a Graph and a Circle
- Dynamic Data Structure: Uses, Dynamic vs. Static Data Structure
- 36
- Dynamic Data Structure: Linked List - Example, Advantages
- File Handling in C: What is File in C, Need and Types of File in C
- 37
- File Handling in C: Functions, Description of Function and Operations
- File Handling in C: File Opening Modes in C, Opening Modes - Description and Example
- 38
- File Handling in C: Example to Create a File in C and FunctionDescription
- File Handling in C: Examples of File Handing in C
- 39
- Graphics – Video Modes in C: Graphics. H in C and Graphics Mode Initialisation
- Graphics – Video Modes in C: Graphics Mode Functions, Graphic Program to Draw a Line
- 40
- Graphics – Video Modes in C: Colors in C Graphics Programming and Graph Error Handling
- Graphics – Video Modes in C: Texture and Filling, Text Display and Basic Shapes
- 41
- Pointer to Function: Syntax and Example
- Pointer to Function: Example and Advantages
- 42
- Pointer to Structures: Structure in C and Accessing Structure Using Pointer
- Pointer to Structures: Accessing Structure Member Using Pointer and to Get Memory Heap
- 43
- Pointer to Structures: Memory Representation, when to Use Pointer to Structure in C and Its Real Time Example
- Pointer to Structures: Complex Data Structures Example Using Pointer to Structure in C and Its Explanation
- 44
- Video Adapters: Video Card, and Components of Video Card or Graphic Card
- Video Adapters: Types of Graphic Cards, Standards and History, Working and Video Card Ports
- 45
- File Handling
- Command Line Arguments
- 46
- Pre-Processors
- Multifile Programs
- 47
- Arrays and Strings
- String: Initialization is Not Straightforward
- 48
- Strings: Finding a Character or a Substring
- Strings: Dealing with Multiple Strings
- 49
- Strings: Using Functions with Strings
O-O Programming Concepts [38 Notes- 2% Effort]
- 1
- Overloading Binary Operators
- Inheritance
- 2
- Single Inheritance
- Multilevel, Multiple and Hierarchical Inheritance
- 3
- Benefits of Inheritance, Virtual Base Class and Constructions in Derived Classes
- Pointers to Objects
- 4
- Polymorphism
- Virtual Functions
- 5
- Object Oriented Programming Concepts: From C to C ++
- Class in C ++ (Rev.) : Introducrion
- 6
- Object in C ++
- Instantiation
- 7
- Abstract Class
- Inheritance
- 8
- Polymorphism (Rev.)
- Abstraction
- 9
- Encapsulation
- Introduction to the C ++ Object Model
- 10
- Four Paradigms to Code: C Style, ADT Style, Object Based or Object-Oriented Type
- C ++ Object Model Layout
- 11
- Constructors and Embedded Objects
- A Class with Virtual Function is Inherited
- 12
- How Object Model Changes the Program
- What Are the Additions if the Compiler Offers NRV and ADT or Hierarchy?
- 13
- Object Model Changes the Program
- Implementing Runtime Polymorphism
- 14
- OO Programming Methodology and Need for Virtual Destructors
- Runtime Polymorphism by Virtual Functions
- 15
- Base and Derived Classes
- Virtual Functions
- 16
- Multiple and Virtual Inheritance
- Multiple Copies of Multiple Inherited Base Class and the Order of Constructors and Destructors Calls
- 17
- Inheritance- The Inside View
- Protected Inheritance
- 18
- Inheriting Further: Many Levels of Inheritance
- Varieties of Inheritance
- 19
- Inheritance in C ++
- Private Inheritance and Observations (for Questions)
C Plus Plus Programming [108 Notes- 6% Effort]
- 1
- Object-Oriented Methodology
- Basic Concepts of Object-Oriented Programming
- 2
- Benefits of OOP, Object Oriented Languages and Application of OOP
- C ++ Programming
- 3
- Classes and Objects
- Defining Member Functions and Making an Outside Function Inline
- 4
- Memory Allocation, Arrays and Returning Objects
- Friend Functions
- 5
- Constructor and Destructor
- Dynamic Initialization of Objects and Destructors
- 6
- Operator Overloading and Type Conversion
- Overloading Unary Operators
- 7
- Type Conversions
- C ++ I/O System Basics
- 8
- Predefined Standard Input/Output Streams
- Functions of < Istream > Class
- 9
- Functions of < Ostream > Class
- Managing Console I/O Operations
- 10
- Manipulators
- Working with Files
- 11
- Reading a Character to a File/Writing a Character from a File
- Reading and Writing Block of Data
- 12
- Random Access Files
- Exception Handling
- 13
- Throwing and Catching Exceptions
- Catch All Exceptions, Rethrowing, Specifying, Standard and Define New Exceptions
- 14
- Templates
- Standard Template Library
- 15
- C and C ++
- Constructors and Destructors
- 16
- Types of Inheritance in C ++
- Exception Handling
- 17
- Templates
- Event Handling
- 18
- Streams and Files
- RTTI (Run Time Type Information)
- 19
- The Type Info Object and Typeid Operator
- RTTI and Casting Operators
- 20
- RTTI with Templates and Cross-Casting and down Casting Are Made Safe
- Input-Output Streams in C ++
- 21
- Pre-Defined Streams: Input/Output Operations in C ++ and Input/Output Operations Using Overloaded Shift Operators
- 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
- 22
- Formatted Input-Output Operations in C ++
- Formatting Using Manipulators
- 23
- Difference between Formatting Using IOS Function and Manipulator and the State of Streams
- Working with Files in C ++
- 24
- Text & Binary I/O Using Files
- Reading/Writing from/to Binary File
- 25
- Binary Files in C ++
- Checking Error in File Operation
- 26
- Modify and Delete Object Stored in Binary File and Random Access: Reading Nth Object from Binary File
- Namespace in C ++
- 27
- Accessing & Importing Elements of Namespace
- Examples to Understand Use of Directive and Declaration at Various Scopes
- 28
- Overriding Name when Same Name is Imported from Different Namespaces in Same Scope
- Namespace Aliasing, Extending Namespace and Does Namespace Introduce Any Overhead?
- 29
- The Standard Template Library
- Sequence Containers: Vector
- 30
- Other Containers and Generic Algorithms
- Map, Set and Algorithms
- 31
- Conversion Function
- Standard Data Type to Class
- 32
- Introduction to C ++ Programming
- Object Oriented Programming Concepts: Classes and Objects
- 33
- Introduction to C ++ Programming
- Basic Components of Program
- 34
- Compiling and Executing C ++ Program
- Classes and Objects – Assigning Object
- 35
- Pointer to Class and Data Member, Const Objects and Memory Allocation of Classes and Objects
- Functions in C ++ : Prototype, Overload, Arguments
- 36
- Friend Functions, Pointer to Function and Member Function
- Constructor: Default, User Defined and Parameterized Constructor
- 37
- Default Arguments in Constructor
- Performance, MIL, and the Order of Initialization
- 38
- Constructor and Destructors: User Defined Copy Constructor
- Destructors
- 39
- Operator Overloading
- Operator Functions
- 40
- Operator Overloading with Friend Functions
- Operators That Cannot be Overloaded Using Friend Functions
- 41
- The Important Trio: Destructor, Copy Constructor and Overloaded Assignment
- Need of User Defined Important Trio and Matrix Class with Dynamic Construction
- 42
- Function Templates
- Exception Handling – Catch Multiple Exceptions
- 43
- Re-Throw and Exception
- The Need for Two Different Functions
- 44
- Exception Handling – Traditional Methods
- Exception Handling, Designer and User of Library and Object Destroy Problem
- 45
- Components of EH System
- Propagation of Control and Throwing Within a Called Function
- 46
- Class Templates
- C ++ Template for Safe Array
- 47
- Static Members in Classes
- Class Specialization
- 48
- Overview of C ++
- Character Sets: New Data Types in C ++ and Advantage of Using Boolean Data Type
- 49
- Access Specification and Defining Member Functions Outside the Class
- Public Interface of Time Class and Unions in C ++
- 50
- Classes and Objects – Static Data
- Static Data Members
- 51
- Syntax of Union in C ++
- Public Static Data Members and Nested Classes
- 52
- Object as a Data Member
- Local Classes and Defining Class Globally
- 53
- Functions in C ++ : Declare, Define, Call
- Inline Functions
- 54
- Parameter Passing in C ++ Functions
- Static Functions, Const Function and Volatile Functions
Relational Database Design and SQL [86 Notes- 5% Effort]
Fundamentals of Database [9 Notes- 1% 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
- Relational Algebra and Relational Calculus: Join Operations
E-R Diagrams and Transformation to Relational Design [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,
Normalization-INF, 2NF, 3NF, BCNF and 4NF [5 Notes- Negligible Effort]
- 1
- Normalization - Basics: Normalization, Need for Normalization, Functional Dependency, Definition
- Normalization - Basics: Attribute Closure (Primary & Secondary Rules)
- 2
- Normalization - Basics: Decomposition, Lossy Decomposition, Lossless Decomposition, Dependency Preservation,
- Normalization-INF, 2 NF, 3NF, BCNF and 4NF - First Normal Form
- 3
- Normalization-INF, 2 NF, 3NF, BCNF and 4NF - Boyce – Codd Normal Form
Query Processing and Optimisation [6 Notes- Negligible Effort]
- 1
- 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
- Database Languages and Interfaces
- 2
- Update Operations and Dealing with Constraint Violations
- Relational Algebra and Relational Calculus
- 3
- Database Security and Authorization
- Database Security and Authorization: Overview of Authorization
Centralised and Distributed Database [1 Notes- Negligible Effort]
Concurrency and Recovery in Centralised and Distributed Database Systems [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
Object Oriented Database Management Systems [5 Notes- Negligible Effort]
- 1
- Components of DBMS: Drilling down into the Database Management System, Database Manager, Query Processor, Data Dictionary
- Object Oriented Database Management Systems
- 2
- Object Oriented Database Management Systems: Composite Objects
- OODBMS - Integration with RDBMS Applications
- 3
- Object Oriented Database Management Systems: ORACLE, Object Views, Advantages
SQL [18 Notes- Negligible Effort]
- 1
- Relational Database Design and SLQ: Relation
- SQL
- 2
- SQL: Data Definition Language (DDL) , Create, Alter, Drop, Truncate, Comment, Rename, Referential Integrity Statements
- SQL: Data Manipulation Language (DML) , Insert, Update, Delete
- 3
- SQL: Data Control Language (DCL) Commands, Grant, with GRANT OPTION, Revoke
- SQL: Transaction Control Language (TCL) Commands, Commit, Rollback, Savepoint, Set Transaction, Autocommit
- 4
- SQL: Database Objects
- 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
- SQL - Data Dictionary, Metadata
- 8
- Stored Procedures and Functions
- Database Triggers
- 9
- SQL Injection
- SQL Injection: SQL in Web Pages
Enhanced Data Models [13 Notes- Negligible Effort]
- 1
- Temporal Database Concepts
- Temporal Database Concepts: Snapshot Databases
- 2
- Temporal Database Concepts: Rollback Databases
- Multimedia Databases
- 3
- Multimedia Databases: Linked Multimedia Databases
- Multimedia Databases: Repository Applications
- 4
- Deductive Databases
- Internet Databases
- 5
- Mobile Databases
- Genome Data Management
- 6
- Genome Data Management: Human Genome
- Multimedia Applications, Taxonomy of Real-Time Applications, Multimedia Application Types, Streaming Stored Audio/Video
- 7
- Real-Time Transport Protocol (RTP)
Data Warehousing and Data Mining [5 Notes- Negligible Effort]
- 1
- K-Nearest Neighbor
- K-Nearest Neighbor: K-NN Classification
- 2
- Hidden Markov Model
- Social Network Analysis
- 3
- Social Network Analysis: Degree Centrality
Big Data Systems [9 Notes- Negligible Effort]
- 1
- Big Data Characteristics
- Big Data Characteristics: Data Veracity
- 2
- Types of Big Data
- Big Data Architecture
- 3
- Introduction to Map-Reduce and Hadoop
- Introduction to Map-Reduce and Hadoop: Modules of Hadoop
- 4
- Distributed File System
- HDFS (Hadoop Distributed File System)
- 5
- Distributed Systems (Distributed File Systems)
NoSQL [8 Notes- Negligible Effort]
Data and File Structures [87 Notes- 5% Effort]
Data, Information [8 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
Arrays [3 Notes- Negligible Effort]
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- Negligible 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 [8 Notes- Negligible 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
- List and List ADT: Everyday List, Properties, Categories of Linear Lists, Operations, Three Forms of General Lists
- 4
- Array Implementation of List ADT: Implementation of ADT Static Implementation of ADT List, List Implementation Using Arrays, Problem Associated with Dynamic Arrays
- 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 & Graphs and Their Algorithms [32 Notes- 2% 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
File Structures [8 Notes- Negligible Effort]
- 1
- File Structures
- Fields, Records and Files
- 2
- Sequential, Direct, Inbox-Sequential and Relative Files
- Hashing - Easy to Compute
- 3
- Hashing: Collision Resolution
- Hashing: Theorem and Performance
- 4
- Inverted Lists
- Studying Data Structures and Databases
Data Structures [3 Notes- Negligible Effort]
- 1
- Sparse Matrix
- Threaded Binary Tree
- 2
- Tries: Trie Nodes as ADT, Types of Tries- Advantage, Operations, Standard, Compressed, Suffix Trie
Dictionary [3 Notes- Negligible Effort]
Networks, Virtualization, & Cloud Computing [200 Notes- 12% Effort]
Network Fundamentals [22 Notes- 1% 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
- World Wide Web (WWW)
- Uniform Resource Locator (URL)
- 6
- Wireless Local Area Network
- Modes of Operation of WLAN
- 7
- IEEE 802.11
- Security Mechanisms Offered by IEEE 802.11
- 8
- WEP (Wired Equivalent Privacy)
- IEEE 802.1 X Authentication and Wireless VPN
- 9
- Layers Description of IEEE 802.11
- Access Methods
- 10
- Fragmentation and Reassembly
- An Overview, Networks – an Overview
- 11
- Wireless Networks
- IEEE 802.11 Wireless LAN
Reference Models [21 Notes- 2% 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
- TCP IP Model and Its Protocols: Network Access Layer
- 5
- TCP IP Model and Its Protocols: Internet Layer
- Topologies, Networking Devices: Topologies
- 6
- Topologies, Networking Devices: Ring Topology
- Topologies, Networking Devices - Source Route Bridging, Router, Switch, Modem
- 7
- Network Models: Layered Architecture
- IPv4 Structure and Address Space: Direct and Indirect Network Layer Delivery
- 8
- Logical Communication, OSI Model – Historical Perspective
- Application Needs and Network Performance, Network Requirements
- 9
- Application Layer Protocols – HTTP, Application Architectures, Application Interface to the Network
- Application Layer Protocols, Web and HTTP
- 10
- Transport – UDP, Overview of Transport Layer, End-To-End Protocol – Challenges
- Transport Flavors in TCP/IP – UDP and TCP, UDP, Why UDP?
- 11
- Overview of OSI Model
Data Communication [39 Notes- 2% Effort]
- 1
- Data Communication
- Type of Addresses: Physical, Logical & Port
- 2
- Multiplexing and Concentration
- Switching Techniques
- 3
- Polling
- Asynchronous and Synchronous Transmission
- 4
- Analog and Digital Transmission
- Channel Capacity, Throughput, Bit Rate
- 5
- Transmission Media and Twisted Pair
- Coaxial Cables
- 6
- Fiber Opical Cable
- Wireless Transmission-Radio
- 7
- Microwave
- Infrared and Millimeter Waves
- 8
- Light Wave Transmission
- Telephones, ISDN, ATM
- 9
- Cellular Radio
- Communication Satellites-Geosynchronous and Low-Orbit
- 10
- Data Communication: Simplex
- Data Communication: Half-Duplex and Duplex Modes of Communication
- 11
- Data Communication: Bandwidth
- Data Communication: Latency - Elements, Causes & Types
- 12
- Data Communication: Broadband and Baseband Transmission
- Data Communication: Transmission Errors
- 13
- Satellite Communication System
- Indian Critical Services through Indigenous Communication Satellites
- 14
- Satellite Orbits and Frequency Bands
- Mobile Communications Satellite Systems – II
- 15
- Broadcast Satellite Services
- Handover in Satellite Systems, MEO and LEO Systems Examples and Regenerative Satellite Payload
- 16
- NextGen High-Capacity Service Payloads, Advance Communication Satellite and Free Space Inter Satellite Links- ISL and IOL
- GPRS
- 17
- GPRS System and Protocol Architecture, Features of GPRS
- GSM Handovers
- 18
- Visitor Location Register (VLR) and Operation and Maintenance Sub-System
- Network Performance and QoS Parameters
- 19
- Switching Fabric, Output Ports
- Multi-Protocol Label Switching (MPLS) , Label Switching – the Motivation, MPLS Overview
- 20
- MPLS Applications, MPLS Advantages
Internetworking [15 Notes- 1% 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
- Subnets and CIDR, IP Addressing, Sub Netting
- 4
- Classless Inter-Domain Routing (CIDR) , Network Address Translation
- IP – Address Management, IP Address Management, Address Resolution Protocol (ARP)
- 5
- Address Configuration
- IP Options and ICMP
- 6
- Border Gateway Protocol (BGP) , Combining Intra-Domain and Inter-Domain Routing
- Router Internals, Router Architecture, Input Port Functions
- 7
- Ingress Router Functions, Core Router Functions
- IPv6 Overview, IPv6: Motivation, IPv6 Features, IPv6 Features
- 8
- IPv6 Addressing, IPv6 Addressing, Transition from IPv4 to IPv6
Routing [11 Notes- Negligible Effort]
- 1
- Routing and Virtual Circuits and Datagrams
- Routing Algorithms: Static Routing
- 2
- Routing Algorithms: Distance Vector Routing
- Congestion Control, Open Loop, Closed Loop, Leaky Bucket & Token Bucket Algorithm
- 3
- IP Routing, Routing, Routing Algorithms
- IP Routing
- 4
- Inter-Domain Routing, Global Internet Routing – Challenges, Internet Organization - Autonomous Systems & Hierarchical Routing
- Multicast Routing
- 5
- Multicast, Multicast Routing, PIM: Protocol Independent Multicast, PIM - Dense Mode (PIM-DM) , PIM - Sparse Mode (PIM-SM)
- Inter-Domain Multicast
- 6
- Routing for Mobile Hosts, Security in Mobile IP, Mobility in IPv6
Network Security and Privacy [48 Notes- 1% Effort]
- 1
- Firewalls
- Network Security and Cryptography-Public Key, Secret Key
- 2
- Domain Name System
- Malware Types and Studying Computer Networks
- 3
- Introduction to Cryptography
- Cryptography
- 4
- Substitution Techniques – Hill Cipher
- Polyalphabetic Ciphers
- 5
- Transposition Techniques – Permutation of Plaintext Letters and Complex Scheme, Steganography
- Stream Ciphers and Block Ciphers
- 6
- Feistel Cipher
- Design of Block Cipher
- 7
- Web Threats and Vulnerabilities: Introduction
- Client Level Threats and Web Server Threats
- 8
- Privacy on Web
- DES (Data Encryption Standard)
- 9
- 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
- 10
- Public Key Algorithm: RSA Algorithm
- Hash Functions in Security
- 11
- Digital Signature
- Elgamal Digital Signature
- 12
- Random Number Generation
- Web Threats: Client Level Threats
- 13
- Client Level Countermeasures Against XSS
- Threats in Network
- 14
- Threats in Network: Port Scanning Methods
- Network Threats: Snort
- 15
- Network Threats: Snort- Directional Operator in Header and Rule Options
- Security in Networks
- 16
- Who is Query?
- Threats in Transit: Eavesdropping and Wiretapping, Software Based Packet Sniffer
- 17
- Digital Signature Algorithm
- Steps in DSA Algorithm: High Level Overview
- 18
- Mathematics of Steps in DSA- Signing, Verification and Validation
- Firewalls: VPN, Extranet, and Dual Homed Host
- 19
- Firewalls: Screened Host and the Packet Filters
- Firewall Placement and Exploring the Internal Network
- 20
- Email Security
- PGP Key Management
- 21
- Enumerating Content and Functionality
- Discovering Hidden Content
- 22
- Application Pages Versus Functional Paths
- Packet Analysis
- 23
- Steps Involved in Redirecting Traffic to the Sniffer (Active Sniffing)
- Preventing Packet Capture and Detecting Packet Capture
- 24
- Applications – DNS, Domain Names, Domain Name System, Design Principle of DNS
- Domain Name Resolution, DNS Records, DNS Message Format, DNS - Benefits and Pitfalls
Functions of OSI, TCP-IP - SCTP Protocols [15 Notes- 1% Effort]
- 1
- Electronic Mail Architecture
- HTTP & SMTP, HTTP Overview, Cookies, Web Caches
- 2
- Electronic Mail - SMTP
- Applications – Accessing Mail, SMTP and Non-ASCII Data, Extended SMTP
- 3
- Mail Access Protocols
- TCP – State Diagram & Flow Control, Functions of TCP – a Review, TCP Connection Establishment
- 4
- TCP Flow Control, Silly Window Syndrome (SWS) , Nagle՚s Algorithm
- ICMP
- 5
- Multicast, Multicast – Need & Overview, IP Multicasting Support, Internet Group Management Protocol (IGMP)
- Reservation Protocol (RSVP)
- 6
- Real Time Control Protocol (RTCP)
- SDP & SIP, Terms, Session Description Protocol (SDP)
- 7
- SIP: Session Initiation Protocol
- RTSP & H.323, Real-Time Streaming Protocol (RTSP)
- 8
- H.323 ITU Standard for Multimedia, H.323 Architecture, SIP vs H.323
Ad-Hoc & Sensor Networks, Cloud Computing, IOT [19 Notes- 1% Effort]
- 1
- Virtual Machines (Types of Virtual Machines and Implementations) : System Virtual Machines, Process Virtual Machine
- Virtual Machines (Virtualization) : Concept Behind Virtualization, Types of Virtualization, Virtualization in Cloud Computing
- 2
- Bluetooth
- Illustration of Devices in Different States and Scatter Net
- 3
- Routing Protocols in Mobile Ad Hoc Networks (MANETs)
- Ad Hoc on Demand Distance Vector (AODV) Protocol
- 4
- Internet of Things
- Perception Layer
- 5
- Network Layer
- Application Layer
- 6
- Wireless Sensor Networks
- Protocol Stack of Wireless Sensor Network
- 7
- Applications of Wireless Sensor Network
- Introduction to Mobile Ad Hoc Networks (MANETs) & VANETs
- 8
- Routing Architecture
- Bluetooth, Bluetooth Architecture, Protocol Stack in Bluetooth, Packet Structure
- 9
- Bluetooth State Machine, Frequency Hopping, IEEE 802.11 vs. Bluetooth
- IoT, SDN & Wrapup, Internet of Things
- 10
- Software Defined Networks – SDN, Course Wrap-Up
Distributed Systems [10 Notes- Negligible 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
- QoS – Techniques, Qos, Resource Allocation
- 4
- QoS Approaches
- QoS – IntServ & RSVP, QoS Approaches, IntServ, Flows Pec, Data Plane in an IntServ Router
- 5
- DiffServ, Differentiated Services, Diffserv Architecture
- Differences between DiffServ and IntServ, DiffServ Advantages & Disadvantages, DiffServ Applications
System Software and Compilers [52 Notes- 2% Effort]
Assembly Language Fundamentals [4 Notes- Negligible 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
Assemblers-2-Pass and Single-Pass [1 Notes- Negligible Effort]
Macros and Macroprocessors [1 Notes- Negligible Effort]
Loading, Linking, Relocation, Program Relocatability [3 Notes- Negligible Effort]
- 1
- Loading, Linking: Absolute Loading, Relocatable Loading, Dynamic Runtime Loading
- Loading, Linking: Dynamic & Static Linking; Linkage Editor
- 2
- Relocation, Program Relocatability
Text Editors [1 Notes- Negligible Effort]
Programming Environments [2 Notes- Negligible Effort]
- 1
- Programming Environments
- System Components: Process Managemen, Memory Management, File Management, Secondary Storage Management, Access Management, System Resource Management
Debuggers and Program Generators [1 Notes- Negligible Effort]
Compilation and Interpretation [1 Notes- Negligible Effort]
Bootstrap Compilers [1 Notes- Negligible Effort]
Lexical Analysis [1 Notes- Negligible Effort]
Context Free Grammars [1 Notes- Negligible Effort]
Parsing and Parse Trees [3 Notes- Negligible Effort]
- 1
- Parsing and Parse Trees
- Parse Tree Representation of Derivation Trees
- 2
- Parse Tree Representation of Derivation Trees: Application of Derivation Tree
Representation of Parse Trees [1 Notes- Negligible Effort]
YACC Package on Unix System [1 Notes- Negligible Effort]
Topdown Parsers-Left Recursion and Its Removal [1 Notes- Negligible Effort]
Recursive Descent Parser [1 Notes- Negligible Effort]
Intermediate Codes-Quadruples, Triples [1 Notes- Negligible Effort]
Intermediate Code Generation [13 Notes- Negligible Effort]
- 1
- Intermediate Code Generation: Code Optimization
- Intermediate Code Generation: Intermediate Representations
- 2
- Intermediate Code Generation: Translation of Declarations
- Intermediate Code Generation: Assignments
- 3
- Intermediate Code Generation: Control Flow
- Intermediate Code Generation: Boolean Expressions and Procedure Calls
- 4
- Code Generation and Code Optimization: Control-Flow
- Code Generation and Code Optimization: Data-Flow Analysis & Data Flow Properties
- 5
- Code Generation and Code Optimization: Local Optimization
- Code Generation and Code Optimization: Global Optimization
- 6
- Code Generation and Code Optimization: Loop Optimization
- Code Generation and Code Optimization: Peep-Hole Optimization
- 7
- Code Generation and Code Optimization: Instruction Scheduling; Algorithms
Non-Deterministic Algorithm-Non-Deterministic Programming Constructs [1 Notes- Negligible Effort]
Chomsky Hierarchy of Languages [5 Notes- Negligible Effort]
- 1
- Chomsky Hierarchy of Languages
- Studying System Software and Compilers
- 2
- Chomsky Normal Form
- Chomsky Normal Form: Problem in the Step Wise Manner
- 3
- Chomsky Normal Form: Grammar
Semantic Analysis and Pragmatics [8 Notes- Negligible Effort]
- 1
- Semantic Analysis: Associativity
- Semantic Analysis: Precedence
- 2
- Semantic Analysis: Grammar Transformations
- Semantic Analysis: Syntax Directed Definitions
- 3
- Semantic Analysis: Inherited and Synthesized Attributes
- Semantic Analysis: Dependency Graph
- 4
- Semantic Analysis: Evaluation Order
- Semantic Analysis: Type-Checking
Operating Systems with Unix [74 Notes- 4% Effort]
Main Functions of Operating Systems [6 Notes- Negligible Effort]
- 1
- Operating Systems with Unix
- Kernel
- 2
- Types of Kernels
- Main Functions of Operating Systems
- 3
- Studying Operating Systems and UNIX
- Operating Systems, Computer Systems, Why Do We Need Operating System
Multiprogramming, Multiprocessing, and Multitasking [14 Notes- Negligible Effort]
- 1
- Multiprogramming
- Multiprocessing: Symmetric & Asymmetric Multiprocessing
- 2
- Multitasking
- Multithreading
- 3
- Difference between Process vs Thread
- Concept of Threading
- 4
- Types of Threads
- Multithreading Models
- 5
- Process Lifecycle and States
- Process in Memory
- 6
- States of Thread
- Threads (Implicit Threading) : Thread Pools, OpenMP, Grand Central Dispatch (GCD)
- 7
- Threads (Threading Issues) : The Fork () and Exec () System Calls, Signal Handling, Thread Cancellation, Thread-Local Storage, Scheduler Activations
- Multi User System: Terminal Services and Fast User Switching
IO & Networking [2 Notes- Negligible Effort]
- 1
- Linux Operating Systems (Input and Output) : Output Redirection, Input Redirection
- Linux Operating Systems (Network Structure)
Distributed Operating Systems [2 Notes- Negligible Effort]
- 1
- Types of Operating Systems: Single and Multi-Tasking
- Types of Operating Systems: Real-Time Operating Systems
Memory Management [17 Notes- Negligible 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
Scheduling [11 Notes- Negligible Effort]
- 1
- Concurrent Processing
- Mutual Exclusion
- 2
- Critical Regions
- Mutual Exclusion Possible Solutions: Hardware Solutions
- 3
- Types of Mutual Exclusion Devices: Locks: Spinlocks
- Types of Mutual Exclusion Devices: Semaphore and Reader-Writer Lock - Readers-Writers Problem
- 4
- CPU Scheduling (Multiple-Processor Scheduling) : Approaches to Multiple-Processor Scheduling, Processor Affinity, Load Balancing, Multicore Processors
- 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
- 5
- Operating System: Process, Context Switching, Process States, Types of Schedulers, Memory Management Techniques, Fragmentation, Variable Contiguous Memory Allocation
- Queuing Disciplines, Scheduling
- 6
- Scheduling Mechanisms
Basic Concepts [7 Notes- Negligible Effort]
- 1
- Scheduling
- CPU Scheduling & Parameters
- 2
- CPU Scheduling Schemes
- I-O or Disk Scheduling: Input/Output or I/O Scheduling
- 3
- I-O or Disk Scheduling: First Come -First Serve
- Deadlock - Mutual Exclusion, Hold & Wait, Circular Wait, Live Lock
- 4
- Deadlock Handling
Unix System [1 Notes- Negligible Effort]
Unix Filters and Commands [11 Notes- Negligible Effort]
- 1
- UNIX System
- UNIX: Operating System Structure
- 2
- Interfacing with Unix
- Editors and Compilers for Unix
- 3
- UNIX: File System
- Block in File System & Its Parts
- 4
- Process Management
- Bourne Shell, Shell Variables
- 5
- LEX Package on Unix
- Command Line Programming
- 6
- Unix Filters and Commands
Unix System Calls [3 Notes- Negligible Effort]
Software Engineering [205 Notes- 5% Effort]
System Development Life Cycle [19 Notes- Negligible Effort]
- 1
- Software Engineering Layers
- Software Engineering Layers: Methods
- 2
- Process Framework and Umbrella Activities
- Process Framework and Umbrella Activities: Communication
- 3
- Process Framework and Umbrella Activities: Software Project Tracking and Control
- Process Framework and Umbrella Activities: Measurement
- 4
- System Development Life Cycle
- System Development Life Cycle: Planning
- 5
- System Development Life Cycle: Analysis
- System Development Life Cycle: Design, Development
- 6
- System Development Life Cycle: Implementation
- System Development Life Cycle: Common Vocabulary
- 7
- Water Fall Model
- Water Fall Model: Royce՚s Original Waterfall Model
- 8
- Water Fall Model: System Maintenance
- Water Fall Model: Product Managers
- 9
- Water Fall Model: Modified Waterfall Model
- Water Fall Model: Winston Royce
- 10
- Evolutionary Process Models: Spiral Methodology
Requirement Analysis and Specifications [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
Software Development Models [54 Notes- 1% 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
Software Metrics [18 Notes- Negligible 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
Software Design [39 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 Design
- 3
- Software Design: System Design
- Software Design: Detailed Design
- 4
- Software Design: Function Oriented Design
- Software Design, Function Oriented Design: Data-Flow Design, Structural Decomposition & Detailed Design Description, Data Flow Diagram or DFDs in Detail
- 5
- Software Design, Function Oriented Design: External Entity
- Software Design, Function Oriented Design: A Logical Data Flow Diagram
- 6
- Object Oriented Design
- Object Oriented Design: Interface, Polymorphism
- 7
- User Interface Design
- User Interface Design: Place the User in Control, User Interface Design Process
- 8
- User Interface Process & Design Evaluation
- Programming Techniques and Tools
- 9
- Class-Responsibility-Collaboration
- Software Quality Assurance and Techniques
- 10
- Software Quality Assurance and Techniques: Quality Assurance
- Software Quality Assurance and Techniques: Software Quality Assurance
- 11
- Software Quality Assurance and Techniques: Statistical SQA
- Software Quality Assurance and Techniques: Six Sigma
- 12
- Software Quality Assurance and Techniques: ISO 9000, Capability Maturity Model
- Software Quality Assurance and Techniques: Maturity Levels
- 13
- Software Quality Assurance and Techniques: Levels of Software Development & Key Processes
- Software Reliability
- 14
- Software Reliability: Mean Time between Failures or MTBF
- Software Reliability: Favorable Account of MTBF
- 15
- Software Reliability: Percentage of Time
- Software Maintenance and Advanced Concepts
- 16
- Software Maintenance and Advanced Concepts: Software Maintenance Prediction, Types of Maintenance
- Software Maintenance and Advanced Concepts: Corrective Maintenance, Adaptive Maintenance, Perfective Maintenance, Preventive Maintenance
- 17
- Software Maintenance and Advanced Concepts: Cost of Maintenance
- Patterns
- 18
- Patterns: Types of Design Patterns: Creational
- Patterns: Types of Design Patterns: Singleton, Object Pool, Dependency Injection, Lazy Initialization, Multiton, Resource Acquisition is Initialization (RAII)
- 19
- Structural Object Patterns
- Behavioral Object Patterns Part I
- 20
- Behavioral Object Patterns Part II & Data Access Patterns
Coding and Testing [29 Notes- Negligible Effort]
- 1
- Errors, Faults and Failures
- Errors, Faults and Failures: Error in Coding or Logic
- 2
- Types of Testing & Terms from V-Model
- Types of Testing: Manual & Automatic Testing, ISTQB, Box Approach, White Box Testing
- 3
- Types of Testing: Statement, Branch & Path Coverage
- Types of Testing: API Testing, Faulty Injection Methods & Mutation Testing
- 4
- Types of Testing: Black-Box Testing, Equivalence Class Testing
- Types of Testing: Boundary Value Analysis, All Pair Testing, Cause-Effect Graphing
- 5
- Types of Testing: Decision Table Testing, Error Guessing, State Transition Testing,
- Types of Testing: Domain Analysis, User Story, Use Case Testing, Orthogonal Array Testing
- 6
- Types of Black Box Testing: Functional Testing, Component Interface Testing, Visual Testing, Gray-Box Testing
- Types of Testing: Unit & Integration Testing
- 7
- Types of Testing: System, Acceptance, Alpha, Beta, Adhoc, Assertion & Load Testing
- Types of Testing: Stress, Performance, Age & Benchmarking Testing
- 8
- Types of Testing: Regression Testing, Smoke Testing, Sanity Testing
- Types of Testing: Usability Testing, Security Testing, Compatibility Testing, End-To-End Testing, Endurance Testing
- 9
- Types of Testing: Continuous, Destructive, Development, a/B, Conformance, Globalization, Keyword-Driven & Loop Testing
- Types of Testing: Ramp, Scalability & Happy Path Testing
- 10
- Testing Level Metrics: Test Cases Executed, Test Effort
- Testing Level Metrics: Test Effectiveness, Test Coverage, Cost and Schedule Variance
- 11
- Testing Level Metrics: Test Team Metrics, Test Execution Status, Defect Gap, Defect Age
- Clean Room Approach
- 12
- Clean Room Approach: Statistically Sound Testing
- Clean Room Approach: Components & 3 Approaches, Three Types of Boxes in Cleanroom Approach
- 13
- Software Re Engineering
- Software Re Engineering Process Model
- 14
- Software Re Engineering: Reverse Engineering, Code Restructuring
- Software Re Engineering: Data Restructuring, Forward Engineering, Economics of Reengineering
- 15
- Quality Factors, Quality Characteristics & Quality-In-Use Metrics
Basics, Principles, Types, Myths, & Process [27 Notes- Negligible 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 Principles
- 10
- 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
- 11
- Software Engineering Principles: Abstraction, Anticipation of Change, Generality, Incrementality
- Software Myths
- 12
- Software Myths: Modern Software Engineering Practice
- Software Myths: Customer Myths
- 13
- Software Myths: Practitioner՚s Myths
- Software Configuration Management: The Key Elements, Participant of SCM Process
- 14
- Change Control and Version Control: Change Control Activities, Version Control, Features of VCS, Advantages of the VCS, Different Types of VCS, GitHub
Security, Forensics, and Steganography [12 Notes- Negligible Effort]
- 1
- Forensic Detection
- Drive Removal Hashing and Logical and Physical Copies
- 2
- How to Ensure the Data is Not Changed?
- Cache Files
- 3
- Email Evidence
- Hidden Techniques, Alternate Data Streams (ADS) , Steganography and Antiforensics
- 4
- Administering Security
- Approaches to Create, Update Security Plan and Recommended Controls
- 5
- Responsibility for Implementation (Accountability)
- Business Continuity Plans
- 6
- Security Incident Management and Steps
- Risk Analysis
Current Trends and Technologies [132 Notes- 5% Effort]
Parallel Computing [25 Notes- Negligible Effort]
- 1
- Performance Enhancement, Parallel Computing
- Parallel Computing: Concurrent Applications
- 2
- Parallel Computing: Types of Parallelism
- Parallel Computing: Super-Scalar Execution
- 3
- Parallel Computing: Task & Data Parallelism
- Parallel Computing: Amdahl՚s Law
- 4
- Parallel Computing: Gustafson՚s Law
- Parallel Virtual Machine (PVM) and Message Passing Interface (MPI)
- 5
- Parallel Virtual Machine (PVM) and Message Passing Interface (MPI) : Parallel Programs in PVM
- Parallel Virtual Machine (PVM) and Message Passing Interface (MPI) : Methods of VPM
- 6
- Parallel Virtual Machine (PVM) and Message Passing Interface (MPI) : Manage Communication in MPI
- Parallel Virtual Machine (PVM) and Message Passing Interface (MPI) : Header File
- 7
- Parallel Virtual Machine (PVM) and Message Passing Interface (MPI) : Communication Routines & Most Common Communication Routines in MPI
- Parallel Virtual Machine (PVM) and Message Passing Interface (MPI) : Communication Routines Overview
- 8
- Advanced Architectures: Flynn՚s Taxonomy, Single Instruction-Stream Single Data Stream or SISD
- Advanced Architectures: SIMD & MISD
- 9
- Advanced Architectures: MIMD & Shared Memory MIMD
- Advanced Architectures: MIMD & Distributed Memory MIMD
- 10
- Advanced Architectures: Diameter of the System, SIMT
- Advanced Architectures: SPMD & MPMD
- 11
- Fastest Computers: Supercomputer, FLOPS
- Fastest Computers: LINPACK Benchmarks
- 12
- Fastest Computers: Performance Benchmarks for Supercomputers, Major Supercomputers
- Paradigms and Models: Imperative Programming Paradigm, Declarative Programming Paradigm
- 13
- Virtual Computers and Binding Times: Binding and Binding Time, Classes of Binding Times
Mobile Computing [107 Notes- 4% Effort]
- 1
- Current Trends and Technologies
- Mobile Computing - Human – Computer Interaction
- 2
- Mobile Computing: Mobile Communication, Hardware & Software
- Mobile Computing: BlackBerry
- 3
- Mobile Connectivity Cells
- Mobile Connectivity Cells: Mobile Cellular Network & Mobile Equipment
- 4
- Mobile Connectivity Cells: Base Transceiver Station & Base Station Controller
- Mobile Connectivity Cells: Hierarchical Structure & Modern Cellular Networks
- 5
- Mobile Connectivity Cells: Picocell
- Mobile Connectivity Cells: Handover
- 6
- Mobile Connectivity Cells: Inter-Cell, Intra-Cell & Hard Handover
- Mobile Connectivity Cells: Soft & Vertical Handover
- 7
- Mobile Connectivity Cells: Mobile Assisted Handoff or MAHO, NCHO, MCHO
- Mobile Connectivity Cells: Handoff Prioritization & Techniques
- 8
- Mobile Connectivity – Framework: Historical Development, Towards an IoT Landscape
- Wireless Delivery Technology and Switching Methods: Radio Based Network Systems
- 9
- Wireless Delivery Technology and Switching Methods: Land Based Services
- Wireless Delivery Technology and Switching Methods: General Packet Radio Services
- 10
- Wireless Delivery Technology and Switching Methods: Universal Mobile Telecommunications Service, Enhanced Data GSM Environment or EDGE
- Wireless Delivery Technology and Switching Methods: Satellite Based Services & VSAT
- 11
- Wireless Delivery Technology and Switching Methods: Paging and Satellite Networks
- Wireless Delivery Technology and Switching Methods: Infrared Communication
- 12
- Mobile Information Access Devices: Portable Computers, Portable Computers
- Mobile Information Access Devices: Laptop Computer, Notebook
- 13
- Mobile Information Access Devices: Handheld Portable Devices
- Mobile Information Access Devices: Personal Digital Assistant, PDAs vs Cellphones, Palmtops
- 14
- Mobile Information Access Devices: Hybrid Pen Computers
- Mobile Data Internet Working Standards: Advanced Mobile Phone Service
- 15
- Mobile Data Internet Working Standards: Limited Available Bandwidth
- Mobile Data Inter Networking Standards: Time-Division Multiple Access
- 16
- Mobile Data Internetworking Standards: Code Division Multiple Access, How Does this “Code” Work
- Mobile Data Internet Working Standards: Direct Sequence Spread Spectrum, How Does It Help Us
- 17
- Mobile Data Internet Working Standards: Ability for Soft Handoffs
- Mobile Data Internet Working Standards: Infrared Data Association
- 18
- Mobile Computing Applications: Remote Communication
- Mobile Computing Applications: Remote Data Access, Healthcare
- 19
- Mobile Computing Applications: Retail, Field Service, Workgroup Communication, Stock & Commodity Trading
- Mobile Computing Applications: Mobile Wallet, Mobile Middleware
- 20
- Mobile Database and Its Approaches: Client-Server Approach
- Mobile Database and Its Approaches: Components of a Mobile Database & Parties Involved in Mobile Database
- 21
- Mobile Database and Its Approaches: Examples of Mobile Databases & Special Cases of Mobile Databases
- M-Business: Inherent Mobility
- 22
- M-Business: Framework for M-Business
- M-Business: Difference between M-Business and E-Business
- 23
- Parallel and Mobile Computing: Studying Current Trends and Technologies
- Mobile Technology: Mobile IP and Mobile Communication Protocol - Components, Process & Route Optimization
- 24
- Mobile Adhoc Networks (MANET) : Characteristics & Types
- Wireless Geolocation Systems: Types & Architecture, Architecture of Wireless GEO Location System
- 25
- SMS (Short Message Service)
- Mobile Computing
- 26
- Mobile Computing Entities
- Networks
- 27
- Middleware
- Electromagnetic Waves
- 28
- Electro Magnetic Spectrum
- Visible Light Communication
- 29
- Signal Propagation Effects
- Phenomena Effecting Signal Propagation
- 30
- Transmission Impairments
- Inter Symbol Interference; Interference & Solutions of Multipath Components
- 31
- Antennas
- Classification of Antenna
- 32
- Some Additional Antennas
- Cellular System Architecture
- 33
- Shape and Size of the Cell
- Cellular Systems – Clusters, Sectors & Co-Channels
- 34
- Micro Cell Zones
- Types of Handover and Handoffs
- 35
- Spread Spectrum Technology: Introduction, Advantages & Techniques
- Frequency Hopped Spread Spectrum
- 36
- Spread Spectrum Technology: Direct Sequence Spread Spectrum
- Principle of DSSS (Direct Sequence Spread Spectrum)
- 37
- MACA (Medium Access Control with Collision Avoidance)
- Multiple Access with Collision Avoidance: A Solution to Hidden and Exposed Terminal Problem
- 38
- Multiple Access Techniques in Wireless Networks and Space Division Multiple Access
- Frequency Division Multiple Access
- 39
- Time Division Multiple Access
- DHCP (in Mobile)
- 40
- Cellular IP
- Indirect TCP
- 41
- Can TCP be Applied for Mobile Hosts as Well? and Handovers
- Software Components
- 42
- Snooping TCP
- Additional Mechanisms Required to Implement Snoop Protocol: Data Transfer from Fixed Host to Mobile Host
- 43
- Additional Mechanisms Required to Implement Snoop Protocol: Data Transfer from a Mobile Host
- M-TCP
- 44
- SH-TCP Client and Design of M-TCP
- Variants of TCP Optimized for Wireless Networks
- 45
- Fast Retransmit Behavior of TCP – Transmission and Retransmission
- GSM Architecture Specifications & Services
- 46
- Radio Sub-System
- GSM Security and Access Control
- 47
- Encryption in GSM
- Call Routing in GSM Network
- 48
- WAP- Wireless Application Protocol
- WAP Gateway
- 49
- Wireless Communication
- Advantages of Wireless Communications
- 50
- Efficient Hardware, Finite Radio Spectrum, Quality of Service and Security
- GSM: Localization of Mobile Phone
- 51
- Mobile IP, Mobility – Challenges to IP
- Conversational Voice-Over-IP (VoIP)
- 52
- Cellular Networks – 2G, Cellular Networks
- Cellular – Important Issues
- 53
- Cellular Networks – Generations
- Cellular Networks & ZigBee
- 54
- 3G to 5G, ZigBee Networks, ZigBee vs Bluetooth
Windows Programming [23 Notes- Negligible Effort]
Introduction to Windows Programming-Win32 [2 Notes- Negligible Effort]
- 1
- Windows Programming: Command Line (Console) Applications, Native Desktop Client Applications, Universal Windows Platform Apps
- Introduction to Windows Programming-Win32
Microsoft Foundation Classes (MFC) [1 Notes- Negligible Effort]
Windows Environment [6 Notes- Negligible Effort]
- 1
- Windows Environment
- Multi-Threading
- 2
- Object Linking and Embedding
- Network Programming
- 3
- File System: FAT Naming Convention, HPFS (High Performance File System) , NTFS (New Technology File System)
- Windows Networking
Unicode [1 Notes- Negligible Effort]
Documents and Views [3 Notes- Negligible Effort]
- 1
- Documents and Views
- Multiple Document Interface
- 2
- Windows Operating Systems (Design Principles) : Layout, Style, Controls and Patterns, Inputs and Devices, Usability
Resources [2 Notes- Negligible Effort]
Message Handling in Windows [3 Notes- Negligible Effort]
Simple Applications [5 Notes- Negligible Effort]
E-Technologies [122 Notes- 2% Effort]
Electronic Commerce [19 Notes- Negligible Effort]
- 1
- Electronic Commerce - Electronic Commerce
- Electronic Commerce: Electronically Exchange Goods and Services
- 2
- History of E-Commerce
- The Concept of E-Commerce: Goals and Objectives, Value Proposition
- 3
- The Concept of E-Commerce: Front-End and Back-End
- The Concept of E-Commerce: Sources of Revenue, How Do We Bring All These Elements Together
- 4
- Types of E-Commerce: Stores That Sell Physical Goods, Service-Based Stores
- Types of E-Commerce: Digital Products, Business-To-Business or B2B
- 5
- Types of E-Commerce: Business-To-Consumer, Business-To-Consumer or B2C, Consumer-To-Consumer or C2C
- Types of E-Commerce: Consumer-To-Business or C2B, Business to Government or B2G
- 6
- Types of E-Commerce: Government to Business; Consumer to Government
- Types of E-Commerce: Government-To-Citizenor G2C, Government to Government or G2G
- 7
- Types of E-Commerce: Government-To-Employee of G2E, Mobile E-Commerce or M-Commerce
- Electronic Retailing or E-Tailing
- 8
- Electronic Retailing or E-Tailing: Formula for Success; Pure Play & Brick and Click E-Tailers
- Electronic Retailing or E-Tailing: The Factors in Favor of E-Tailing
- 9
- Electronic Retailing or E-Tailing: Limitations to E-Tailing
- An Appraisal of E-Commerce: Nature of E-Commerce; Advantages and Disadvantages of E-Commerce
- 10
- An Appraisal of E-Commerce: Intangible Purchase; is E-Commerce Lawless?
Electronic Payment Systems [17 Notes- Negligible Effort]
- 1
- Shopping Cart Software: Technically Speaking
- Shopping Cart Software: Storefront
- 2
- Electronic Payment Systems
- Designing Electronic Payment Systems: Computer Networks & Basic Requirements of Electronic Payment Systems
- 3
- Designing Electronic Payment Systems: Components
- Designing Electronic Payment Systems: Protocol Design and Verification
- 4
- Modes of Online Payments: Credit Card & Debit Cards
- Modes of Online Payments: Smart Card, Virtual Wallet & E-Wallet
- 5
- Modes of Online Payments: Online Wallet, Mobile Money Wallet & 3 Wallets by RBI
- Modes of Online Payments: PayPal & Google
- 6
- Modes of Online Payments: Paytm, Bharat Interface for Money, UPI
- Modes of Online Payments: E-Check, E-Cash
- 7
- Modes of Online Payments: Digital Currency
- Modes of Online Payments: Distributed Ledger Technology, Bitcoin
- 8
- Modes of Online Payments: Stored-Value Card, Electronic Fund Transfer or EFT, Digital Token-Based Electronic Payment Systems
- Risks in Electronic Payment System
- 9
- Risks in Electronic Payment System: Payment Conflicts
Electronic Data Interchange [14 Notes- Negligible Effort]
- 1
- Electronic Data Interchange
- Electronic Data Interchange: Paper-Based Exchange
- 2
- EDI Formats, Message, Documents and Standard: Standard Format, Why a Standard Format, EDI Document
- EDI Formats, Message, Documents and Standard: Proper Order
- 3
- EDI Formats, Message, Documents and Standard: Message Envelope
- EDI Formats, Message, Documents and Standard: Large Companies
- 4
- EDI Formats, Message, Documents and Standard: Automating Paper-Based Tasks
- Types of EDI: Peer-To-Peer & Value Added Networks
- 5
- Types of EDI: Internet, AS2, Point to Point & Web EDI
- Types of EDI: Mobile EDI, Managed Services, FEDI
- 6
- EDI and Electronic Commerce
- Privacy Concept
- 7
- Computer Related Privacy Problems
- US Privacy Laws
Digital Libraries and Data Warehousing [9 Notes- Negligible Effort]
- 1
- Digital Libraries
- Digital Libraries: Digital Library System, Digital Libraries Three-Tier Framework
- 2
- Digital Libraries: Digital Libraries Universe, Types of Digital Libraries
- Digital Libraries: Corporate Digital Library
- 3
- Digital Documents
- Digital Documents: Still Image File
- 4
- Digital Documents: TIFF, Audio File, Video File & Distributed Hypertext
- Digital Documents: Compound Document, Structured Document
- 5
- Issues Behind Document Infrastructure
Software Agents [8 Notes- Negligible Effort]
- 1
- Software Agents
- Types of Software Agents
- 2
- Software Agents: Basic Attributes, Are Software Agents and Computer Programs Same
- Different Types of Software Agents: Buyer Agents & User Agents
- 3
- Different Types of Software Agents: Monitoring and Surveillance Agents, Data Mining Agents
- Different Types of Software Agents: Networking and Communicating Agents
- 4
- Technology Behind Software Agents
- Agent Development Tools: Proact, Leap, Project; Jackal, Java Agent Development Framework or JADE
Broadband Telecommunications [17 Notes- Negligible Effort]
- 1
- Broadband Telecommunications
- Broadband Communication: Cell Relay
- 2
- Broadband Communication: Frame Relay
- Broadband Communication: Asynchronous Transfer Mode, B-ISDN
- 3
- Broadband Communication: Asynchronous Transfer Mode: Transmitting Voice Data
- Switched Multimegabit Data Service
- 4
- Switched Multimegabit Data Service: Local Area Network
- Switched Multimegabit Data Service: Telecommunications Service
- 5
- Geographical Information System
- Geographical Information System: Location Data
- 6
- Geographical Information System: Data Capture, Format, Restructuring & Spatial Relationships, Projections, Coordinate Systems, and Registration
- Enterprise Resource Planning
- 7
- Enterprise Resource Planning: What Distinguishes ERP? ERP Fundamentals
- Enterprise Resource Planning: Central Collection of Data; ERP Modules
- 8
- Enterprise Resource Planning: Platform as a Service; New Computing Trends
- Enterprise Resource Planning: Government Resource Planning
- 9
- ERP Packages & Its Comparison
Data Warehousing [19 Notes- Negligible Effort]
- 1
- Data Warehousing
- Data Warehousing: Characteristics & Data Characteristics
- 2
- Data Warehousing: Semi-Structured Data; Stages of Data Warehouse
- Architecture of a Data Warehouse: Data Warehouse Architecture (Basic)
- 3
- Architecture of a Data Warehouse: Staging Area
- Architecture of a Data Warehouse: Structure or Access Pattern; Architecture by Layers
- 4
- Architecture of a Data Warehouse: Data Source Layer; Data Staging Layer, ETL
- Architecture of a Data Warehouse: ETL, ELT, Data Storage & Presentation Layer
- 5
- Architecture of a Data Warehouse: Three Tier Architecture
- Data Warehousing: Star Schema
- 6
- Data Warehousing: Snowflake Schema
- Data Warehousing: Fact Constellation Schema
- 7
- Data Warehousing: Online Analytical Processing OLAP; OLAP Cube
- Data Warehousing: Analytical Operations of OLAP (Roll-Up & Drill down)
- 8
- Data Warehousing: Analytical Operations of OLAP (Slice & Dice)
- Data Warehousing: Analytical Operations of OLAP -Pivot & Types of OLAP
- 9
- Data Warehousing: Design, Construction: Design Methods
- Data Warehousing: Design, Construction: Kimball՚s Model
- 10
- Data Warehousing: Design, Construction: Dimensional Approach, Normalized Approach, Metadata
Data Mining [19 Notes- Negligible Effort]
- 1
- Data Mining: Discovering Patterns in Large Data Sets
- Data Mining: Key Properties of Data Mining
- 2
- Data Mining: Data Mining Steps
- Data Mining: Data Analysis & Data Interpretation
- 3
- Data Mining: Data Mining Models (Descriptive & Predictive)
- Data Mining: Prescriptive Modelling
- 4
- Data Mining: Steps for KDD
- Data Mining Techniques: Association, Transactions, Classification
- 5
- Data Mining Techniques: Classification Models
- Data Mining Techniques: Clustering
- 6
- Data Mining Techniques: Build Supervised Models-Prediction
- Data Mining Techniques: Sequential Patterns & Anomaly or Outlier Detection Technique
- 7
- Data Mining Techniques: Anomaly Detection for Single-Class Data & Finding Outliers
- Data Mining Techniques: Regression Analysis
- 8
- Data Mining Techniques: Decision Trees
- Dependency Modelling
- 9
- Link Analysis, Sequencing Analysis
- Mining Scientific Data: Sequence Analysis in Bioinformatics
- 10
- Mining Scientific Data: Classification of Astronomical Objects & Medical Support System
Digital Logic [3 Notes- Negligible Effort]
Combinational Circuit Design [2 Notes- Negligible Effort]
Sequential Circuit Design [1 Notes- Negligible Effort]
Computer Structure and Organisation [85 Notes- 4% Effort]
Instruction Formats [15 Notes- Negligible 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
- Register Transfer Language
- Stored Program Organization: Fixed Program Computers, Stored Program Computers
- 5
- Arithmetic Pipeline
- Vector Processing Array Processors: Pipe Lined Vector Computer Classification
- 6
- Computer Architecture
- Instruction Set Architecture
- 7
- Execution of Complete Instruction
- Features Considered in Designing the Instruction Set Architecture
- 8
- Execution of Different Types of Instruction
Harddisk Structure [1 Notes- Negligible Effort]
Addressing Modes [3 Notes- Negligible Effort]
- 1
- 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
- 2
- Microprogrammed Control
Memory Types and Organisation [14 Notes- Negligible 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
Interfacing Peripheral Devices, Interrupts [6 Notes- Negligible Effort]
- 1
- Interfacing Peripheral Devices: Peripheral Device, Serial Communication Interface, I/O Bus
- Interfacing Peripheral Devices: I/O Module, Memory-Mapped I/O, Isolated I/O
- 2
- Interfacing Peripheral Devices: Modes of I/O Data Transfer - Programmed I/O, Interrupt Initiated I/O & DMA
- Interrupts: Hardware Interrupts, Software Interrupt, Inter-Processor Interrupt or IPI, Spurious Interrupt, Level-Triggered Interrupt, Edge-Triggered Interrupt, Hybrid, Message-Signaled Interrupt, Doorbell Interrupt
- 3
- Interrupts: Priority Interrupt, Interrupt Handler, Interrupt Vector
- Interrupts: Predefined Method, Fetch Method, Interrupt Acknowledge, Interrupt Request Line or IRQ, Interrupt Latency, Interrupt Storm
Storage Management [7 Notes- Negligible Effort]
- 1
- RAID Structure: History of RAID, RAID Storage Techniques & Evaluation
- RAID Structure: Technical Aspects of the RAID, RAID Controller, RAID Levels 1 & 2
- 2
- RAID Structure: RAID Levels - RAID 2, RAID 3, RAID 4
- RAID Structure: RAID Levels - RAID 5 & RAID 6; Unconventional RAID Levels
- 3
- RAID Structure: RAID 10 (RAID 1 + 0)
- RAID Structure: RAID 60 (RAID 6 + 0)
- 4
- RAID Structure: Non-Standard RAID Levels
File and Input-Output Systems [6 Notes- Negligible Effort]
- 1
- Access Methods: Sequential Access, Direct & Indexed Access
- File System Mounting: Mounted File System Table, Super-Mounting
- 2
- File Sharing: Copyright Issues
- Free-Space Management: Bitmap or Bit Vector, Linked List, Grouping, Counting
- 3
- Recovery: Consistency Checking, Backup and Restore
- File and Input/Output Systems (Allocation Methods) : Contiguous Allocation, Linked List Allocation, Indexed Allocation
Security [33 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
- System and Network Threats: Worm, Port Scanning, Denial of Service
- Implementing Security Defenses
- 4
- Security (Cryptography as a Security Tool) : Cryptography Techniques
- User Authentication: Knowledge Factors, Possession Factors, Inherence Factors, Types of User Authentication
- 5
- Viruses and Malware
- How Viruses Attach
- 6
- How Viruses Gain Control
- Virus Signatures, Code Red Worm and Polymorphic Virus
- 7
- Encrypting Viruses
- Virus – Internet Worm, Code Red, Trojan Horse
- 8
- Types of Trojans
- Trapdoor
- 9
- Salami Attack and Covert Channels
- Database Security
- 10
- Two-Phase Database Update
- Database Security: Monitors, Sensitive Data and Access Decisions Types of Disclosures
- 11
- Database Security: Inference, Random Sample and Query Analysis
- Operating System Memory Protection
- 12
- Memory and Address Protection: Relocation and Base/Bounds Registers
- Memory and Address Protection: Tagged Architecture and Segmentation
- 13
- Memory and Address Protection: Paging and Combined Paging with Segmentation
- Protection in General Purpose Operating System
- 14
- Capability and File Protection Mechanisms
- Group Protection and Single and Temporary Acquired Permission
- 15
- User Authentication: Using Passwords
- Secure Passwords: Vulnerability of Probable Passwords, OTP, and Other Mitigating Measures
- 16
- Attacking Authentication Mechanism
- Password Change Functionality
- 17
- Incomplete Validation of Credentials
Computer Graphics [75 Notes- 5% Effort]
2D Geometry [12 Notes- 1% Effort]
- 1
- Computer Graphics: Interactive Computer Graphics, Non Interactive Computer Graphics
- Pixel: Raster Images, Vector Images
- 2
- Sub-Pixels
- Million Pixels and Pixel Art
- 3
- 2D Geometry: Angle, Polar Coordinate System, Converting between Polar and Cartesian Coordinates
- 2D Geometry: Affine Transformation- Rotation, Scaling
- 4
- 2D Geometry: Shearing- Reflection, Composite Transformation
- Output Primitives – DDA Line Drawing Procedure
- 5
- Basic 2D Transformations
- Composite 2D Transformations
- 6
- Other 2D Transformations
- 2D Viewing
3D Graphics [13 Notes- 1% Effort]
- 1
- 3D Graphics - Three-Dimensional Space: Projections - Parallel Projections
- 3D Graphics: Parallel, Oblique & Perspective Projection
- 2
- 3D Transformation: Translation, Scaling, Rotation, Reflection, Shearing
- Viewing Functions
- 3
- Bresenham՚s Line Drawing Procedure
- Midpoint Circle Drawing Procedure
- 4
- Color Models; Color Matching Functions, the CIE (Commission Internationale Del՚eclairage) Color Model, CMY Color Model
- YUV/YIQ/YCBCR Color Model; HSV Color Model, Conversion between RGB and HSV, Algorithm to Convert from RGB to HSV, Algorithm to Convert from HSV to RGB, HLS Color Model
- 5
- Design Aspects
- Visual Encoding Principles; Inputs for Visual Encoding, Types of Visual Encoding, Visual Encoding Principles/Variables
- 6
- Pattern, Marks, Channels, Marks and Channels, Mark Types
- Visual Perception Theory
- 7
- Colours in Visualization
Animation [3 Notes- Negligible Effort]
- 1
- Animation: Traditional Animation, Full Animation, Limited Animation, Stop-Motion Animation, Computer Animation, Computer-Generated Imagery (CGI) , 2D Computer Graphics, 3D Computer Graphics, Keyframe, Inverse Kinematics, Motion Capture
- Animation: Frame-By-Frame, Key-Frames and Tweening, Onion Skinning, Squash and Stretch, Morphing, Kinematics and Dynamics
- 2
- Types of Visualization and Design Principles of Visualization; Purpose of Visualization
Graphic Standard [5 Notes- Negligible Effort]
- 1
- Graphic Standards: Formats of Graphic Standards
- Light Sources and Their Attributes; Adding Textures to Faces, Reflection Mapping, Shadows, Ray Tracing
- 2
- Data Principles; Data Visualization, Language of Data Visualization, Data Type Taxonomy, Types of Data, Clear Vision in Visualization
- Clear Understanding in Visualization; Graphs, Eight Principles of Data Visualization, Consider New Delivery Methods, Five Principles for Creating Effective Data Visualization, Examples of Data Visualization
- 3
- Perception and Colours; Visual Perception, the Cognitive and Computational Approaches, Transduction
Applications [2 Notes- Negligible Effort]
- 1
- Applications for Graphics: Computer-Aided Design, Computer Art, Visualization, Image Processing, Education and Training, Computational Biology, Computational Physics, Graphical User Interface, Video Games, Virtual Reality, Animation Software, Desktop Publishing
- Applications of Visualization
Storage Devices, Input Tools, Authoring Tools [5 Notes- Negligible Effort]
- 1
- Computer Graphics: Storage Devices, Input Tools, Authoring Tools - Cathode Ray Tube or CRT
- Computer Graphics: Flat-Panel Displays, Paddle, Trackball, Mouse, Joystick, Light Pen
- 2
- Computer Graphics: Magnetic Pen and Tablet, Touch, Keyboard, Digitizer, Scanner, Glove
- Computer Graphics: Terms and Definitions, Studying Computer Graphics
- 3
- Introduction to Computer Graphics
3-D Object Representation [3 Notes- Negligible Effort]
Geometric Transformations and Viewing [10 Notes- Negligible Effort]
- 1
- Quadric Surfaces
- Quadric Surfaces: Boundary Representations - Ellipsoid, Cone, Cylinder
- 2
- Quadric Surfaces: Elliptic Paraboloid, Hyperboloid of One Sheet, Hyperboloid of Two Sheets, Hyperbolic Paraboloid
- Spline Representation
- 3
- Spline Representation: Convex Hull, Control Graph
- Bezier and B-Spline, Their Curves and Surfaces
- 4
- Bezier and B-Spline, Their Curves and Surfaces: The Convex Hull of Control Points
- Bezier and B-Spline, Their Curves and Surfaces: Bezier Surfaces, Bezier Surfaces in Computer Graphics
- 5
- Bezier and B-Spline, Their Curves and Surfaces: B-Splines
- Bezier and B-Spline, Their Curves and Surfaces: B-Spline Surfaces
Illumination Models [2 Notes- Negligible Effort]
- 1
- Illumination Models: Light and Surfaces
- Illumination Models: Ambient Light, Diffuse Reflection, Specular Reflection, Illumination with Color
Polygon Rendering Methods [6 Notes- Negligible Effort]
- 1
- Polygon Surfaces
- Polygon Surfaces: Boundary Representations
- 2
- Polygon Rendering Methods: Flat Shading
- Polygon Rendering Methods: Gouraud Shading, Phong Shading
- 3
- Polygon Rendering Methods: Fast Phong Shading՚s
- Rendering; Shading Model, Flat Shading, Smooth Shading
Viewing Pipeline and Coordinates [7 Notes- Negligible Effort]
- 1
- Viewing Pipeline and Coordinates
- Viewing Pipeline and Coordinates: Definitions
- 2
- Viewing Pipeline and Coordinates: Normalization Transformation and Clipping, Viewport Transformation
- Viewing Coordinate Reference Frame
- 3
- Pipelining
- 3D Viewing (Viewing Transformations)
- 4
- Visualization Definition and History of Visualization; Visualization Pipeline, History of Visualization
General Projection Transforms and Clipping [7 Notes- Negligible Effort]
- 1
- General Projection Transforms and Clipping: Point Clipping, Line Clipping
- General Projection Transforms and Clipping: Brute Force Line Clipping, Cohen-Sutherland Clipping
- 2
- General Projection Transforms and Clipping: Cohen-Sutherland Clipping; Cyrus-Beck Line Clipping Algorithm
- General Projection Transforms and Clipping: Polygon Clipping
- 3
- General Projection Transforms and Clipping: Sutherland Hodgman Algorithm (Introduction)
- General Projection Transforms and Clipping: Sutherland Hodgman Algorithm Part II (Text, External & Occlusion Clipping)
- 4
- 3D Viewing (Projection Transformations)
Object Oriented Technology [24 Notes- Negligible Effort]
Fundamentals of OOT [11 Notes- Negligible Effort]
- 1
- Object Oriented Technology and Programming Languages
- Object Oriented Technology
- 2
- Fundamentals of Object Oriented Technology
- Fundamentals of Object Oriented Technology: Object-Oriented Analysis
- 3
- Fundamentals of Object Oriented Technology: Object Modeling
- Fundamentals of Object Oriented Technology: Object-Oriented Design
- 4
- Fundamentals of Object Oriented Technology: Content Coupling
- Fundamentals of Object Oriented Technology: Stamp Coupling
- 5
- Fundamentals of Object Oriented Technology: Coincidental Cohesion
- Fundamentals of Object Oriented Technology: Open -Closed Principle, Object-Oriented Modeling
- 6
- Studying Object Oriented Technology and Programming Languages: History, Ingredients and Essence
Object, Messages, Classes [1 Notes- Negligible Effort]
Object Oriented Design [12 Notes- Negligible Effort]
- 1
- Object-Oriented Modelling – Unified Modeling Language
- Types of UML Diagrams: Structural Diagrams - Class Diagrams
- 2
- Types of UML Diagrams: Object, Composite Structure & Component Diagram
- Types of UML Diagrams: Deployment, Package & Profile Diagram
- 3
- Types of UML Diagrams: Stereotypes, Behavioral Diagrams
- Types of UML Diagrams: Use Case Relationships
- 4
- Types of UML Diagrams: Boundary of System
- Types of UML Diagrams: Sequence Diagram
- 5
- Types of UML Diagrams: Activity Diagrams, State Machine Diagram
- Types of UML Diagrams: Communication Diagram, Interactional Overview Diagram
- 6
- Types of UML Diagrams: Timing Diagram
- Abstract Data Types: Advantages of Data Abstraction, Design of Abstract Data Type, Operations on Abstract Data Types
Programming Languages [51 Notes- 2% Effort]
HTML [10 Notes- Negligible 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
DHTML [11 Notes- Negligible Effort]
- 1
- DHTML: Dynamic Hyper-Text Markup Language
- DHTML: Cascading Style Sheets
- 2
- DHTML: CSS Syntax
- DHTML: Measurement Units
- 3
- DHTML: Client-Side Scripting
- DHTML: JavaScript, Server Side Scripting
- 4
- DHTML: HTML Forms, Why Do We Put in the CGI
- DHTML: JavaScript, JavaScript Syntax
- 5
- DHTML: Language, Type
- DHTML: Multi-Line Comment
- 6
- 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
Java [10 Notes- Negligible Effort]
- 1
- Java: Java Platform, Micro Edition (Java ME) , Java Platform, Standard Edition (Java SE) , Java Platform, Enterprise Edition (Java EE) , Java Card for Smartcards
- Java: Features of Java
- 2
- Java: Java Compilation, Java Virtual Machine or JVM, Java Runtime Environment or JRE
- Java: Compilation, Execution, Just-In-Time Compiler, Just-In-Time Compiler
- 3
- Java: Java Packages
- Java: Built-In Package, User-Defined Packages, Access Modifiers in Java
- 4
- Java: Java Try-Catch, Java Regex
- Java: Multithreading in Java
- 5
- String Tokenizer Class in Java
- Instances and Schemas: Data Dictionary, What is a Transaction
Servlets [3 Notes- Negligible Effort]
- 1
- Servlets
- Servlets: Advantages of Servlet, Servlets Architecture, Servlets Packages, Javax. Servlet Package
- 2
- Servlets: Javax. Servlet. Http Package, Servlet Life Cycle
Applets [3 Notes- Negligible Effort]
- 1
- Applets: But Why Applets, when We Have HTML
- Applets: Hierarchy of Applet, Life Cycle of an Applet
- 2
- Applets: Init
Prolog Programming [2 Notes- Negligible Effort]
ADA [1 Notes- Negligible Effort]
- 1
- ADA
Python [1 Notes- Negligible Effort]
LISP [1 Notes- Negligible Effort]
- 1
- LISP
Lazy Evaluation [1 Notes- Negligible Effort]
Coroutines [1 Notes- Negligible Effort]
Management Information Systems [30 Notes- 1% Effort]
State Space Representation of Problems, a, a*, AO* [7 Notes- Negligible Effort]
- 1
- Management Information Systems: Management Information System or MIS, Origins and Evolution
- Management Information Systems: Terminology, What Does the MIS Offer
- 2
- State Space Representation of Problems, a, a ⚹ , AO ⚹: State Space Search
- State Space Representation of Problems, a, a ⚹ , AO ⚹: Successor Function, Optimal Solution, State Space Representation of Problem
- 3
- State Space Representation of Problems, a, a ⚹ , AO ⚹: Classic AI Problems, Traveling Salesman Problem, 8-Puzzle Problem
- State Space Representation of Problems, a, a ⚹ , AO ⚹: State-Space Search Algorithms, a ⚹ Algorithm
- 4
- State Space Representation of Problems, a, a ⚹ , AO ⚹: A ⚹ Algorithm (Working) & AO ⚹ Algorithm
Implementation and Evaluation of MIS [6 Notes- Negligible Effort]
- 1
- Management Information Systems: Types - TPS & DSS
- Management Information Systems: Architecture of DSS
- 2
- Management Information Systems: Structured & Unstructured Approach
- Constraint Satisfaction Problem (Crypt Arithmetic) : Constraint Satisfaction, Crypt Arithmetic Puzzles
- 3
- Implementation and Evaluation of MIS: Steps to Implementation
- Implementation and Evaluation of MIS: Advantages, Disadvantages
Systems Approach to Decision Making Process [3 Notes- Negligible Effort]
- 1
- Systems Approach to Decision Making Process: Systems Approach, Elements of a System
- Systems Approach to Decision Making Process: Power Subsystem
- 2
- Studying Neural Networks, Fuzzy Systems and MIS
Evaluation of DSS [3 Notes- Negligible Effort]
- 1
- Evaluation of DSS: DSS Project Evaluation Process
- Evaluation of DSS: DSS Evaluation Tools and Techniques
- 2
- Evaluation of DSS: DSS Project Evaluation Criteria and Risk Factors, International and Cultural Issues, Ethics and Privacy Issues
Group Decision Support System and Case Studies [5 Notes- Negligible Effort]
- 1
- Group Decision Support System and Case Studies
- Group Decision Support System and Case Studies: Features
- 2
- Group Decision Support System and Case Studies: Software Tools, Group Decision Support Situations, Contingency Theory
- Group Decision Support System and Case Studies: Case Studies
- 3
- Group Decision Support System and Case Studies: Evaluating Group Support Tools
Adaptive Design Approach to DSS Development [1 Notes- Negligible Effort]
Cognitive Style in DSS [2 Notes- Negligible Effort]
- 1
- Cognitive Style in DSS: Personality Types, Cognition
- Cognitive Style in DSS: Cognitive Models, Cognitive Style Research, Decision Styles
Integrating Expert and Decision Support Systems [3 Notes- Negligible Effort]
Models for Information Channel [20 Notes- Negligible Effort]
Discrete Memoryless Channel [1 Notes- Negligible Effort]
Bit-Error Rates [2 Notes- Negligible Effort]
- 1
- Bit-Error Rates or BER; Bit Error Rate Test or Tester or BERT
- Bit-Error Rates: Bit Error Probability
Probability, Entropy and Shannon's Measure of Information [8 Notes- Negligible Effort]
- 1
- Probability: Theory
- Probability: Conditional Probability
- 2
- Probability: Bayes՚ Theorem
- Probability: Probability Mass Function
- 3
- Entropy: Theory
- Entropy: Imminent Information
- 4
- Entropy: Shannon՚s Definition
- Shannon՚s Measure of Information
Mutual Information [3 Notes- Negligible Effort]
- 1
- Mutual Information
- Mutual Information: Relation to Conditional Entropy
- 2
- Mutual Information: Bayesian Estimation
Rate and Optimality of Information Transmission [2 Notes- Negligible Effort]
- 1
- Rate and Optimality of Information Transmission
- Rate and Optimality of Information Transmission: Channel Capacity
Channel Models and Types [4 Notes- Negligible Effort]
Encoding Decoding Error Correction Detection [28 Notes- 1% Effort]
Variable Length Codes [13 Notes- Negligible Effort]
- 1
- Variable Length Codes
- Variable Length Codes: Unique Symbol
- 2
- Variable Length Codes: Recover the Source Data
- Prefix Codes
- 3
- Prefix Codes: Self-Synchronizing Code, Optimal Prefix Code
- Huffman Codes: Problem Definition
- 4
- Huffman Codes: String Example
- Huffman Codes: Information Content, Average Word Length, Entropy
- 5
- Huffman Codes: Comments on Huffman Coding, Huffman Algorithm Today, Adaptive Huffman Coding
- Lempel-Ziv Codes
- 6
- Lempel-Ziv Codes: Encoding, Decoding
- Lempel-Ziv Codes: Comment on LZW Code, Variable-Length-Code LZW Compression, Compression
- 7
- Prefix Codes - Binary Code Building & Decoding
Error Correcting and Detecting Codes [15 Notes- Negligible Effort]
- 1
- Encoding, Decoding, Error Correction and Error Detection
- Encoding, Decoding, Error Correction and Error Detection: Error Correction
- 2
- Encoding, Decoding, Error Correction and Error Detection: Automatic Repeat Request, Forward Error Correction or FEC
- Hamming Distance
- 3
- Hamming Distance: Properties, Applications
- Hamming Codes: Redundant Bits, Parity Bits, Even Parity Bit, Odd Parity Bit
- 4
- Hamming Codes: Error Detection and Correction
- Hamming Codes: Burst Error Detection, Mathematical View, Number of Parity Bits, Error Syndrome, Evaluation of the Hamming Code
- 5
- Bounds of Codes: Hamming Bound, Perfect Codes
- Linear Codes: Equivalence of Linear Codes, Hamming Code Example
- 6
- Decoding of Linear Codes: Syndrome Decoding, Comment on the Linear Codes
- Generator Matrix: Equivalence of Linear Codes
- 7
- Parity Check Matrix: Orthogonality, Creating a Parity Check Matrix
- Cyclic Redundancy Check: Cyclic Redundancy Check or CRC, Generator Polynomial, Sender Side, Receiver Side, CRC Division
- 8
- Data Communication: Data Encoding
Image Processing [39 Notes- 1% Effort]
Blind Image Deconvolution [12 Notes- Negligible Effort]
- 1
- Signal Processing: Why is Signal Processing Mentioned
- Image Processing: Steps of Image Processing
- 2
- Image Processing: Types of Image Processing - Digital and Analog
- Image Processing: Image Representation
- 3
- Image Processing: Purpose & Applications of Image Processing
- Blind Image DE Convolution
- 4
- Mid-Point Circle and Ellipse Algorithms: Midpoint Circle Algorithm
- Mid-Point Circle and Ellipse Algorithms: Bresenham՚s Line Algorithm
- 5
- Display Systems: What is a Display, Display Processor
- Display Systems: Cathode Ray Tubes, Random Scan Display, Raster Scan Display
- 6
- Display Systems: Color CRT Monitors, Direct View Storage Tubes, Flat Panel Display
- Display Systems: Plasma Panel Display, Thin-Film Electro-Luminant Display, LCD, LED
Image Registration [6 Notes- Negligible Effort]
- 1
- Image
- Image: Types of a Digital Image
- 2
- Image Registration
- Image Registration: Algorithm Classifications
- 3
- Image Restoration
- Image Restoration Techniques
Fourier Transforms [4 Notes- Negligible Effort]
- 1
- Fourier Transforms
- Fourier Transforms: Discrete Fourier Transform
- 2
- Fourier Transforms: Concerned with Digital Images
- Fourier Transforms: Spatial Domain Image
Restoration, Lossy Compression of Images [2 Notes- Negligible Effort]
Computer Graphics [15 Notes- Negligible Effort]
- 1
- Line and Circle Algorithms Part I
- Line and Circle Algorithms Part II
- 2
- Line Drawing Algorithms: Naive Scan & Direct Line Drawing Conversion
- Line Drawing Algorithms: Digital Differential Analyzer, Bresenham՚s Line Algorithm
- 3
- Line Drawing Algorithms: Bresenham՚s Line Algorithm; Mid-Point Line Generation Algorithm
- Line Drawing Algorithms: Mid-Point Line Generation Algorithm, Xiaolin Wu՚s Line Algorithm
- 4
- Scan Line Polygon Fill Algorithm
- Scan Line Polygon Fill Algorithm: Components of Polygon Fill -Edge Bucket, Edge Table & Active List
- 5
- Boundary-Fill: 4 Connected Algorithm
- Boundary-Fill: 8-Connected Algorithm
- 6
- Flood-Fill Algorithm: Bucket Fill, Solving a Maze, Minesweeper
- Input Devices: Voice Systems
- 7
- Data Compression Techniques: Portable Network Graphics (PNG) , Tagged Image File Format (TIFF) , Better Portable Graphics (BPG) , WebP
- Data Compression Techniques: Free Lossless Image Format, PCX, Truevision TGA, Progressive Graphics File (PGF) , Cartesian Perceptual Compression (CPC) , Fractal Compression, Wavelet Compression
- 8
- Data Compression Techniques: S3 Texture Compression
Linear Programming Problem [17 Notes- Negligible Effort]
LPP Standard Form, LPP in Canonical Form [6 Notes- Negligible Effort]
- 1
- Linear Programming Problem
- Linear Programming Problem: Possible Values of the Variables
- 2
- LPP Standard Form
- Canonical Form of LPP
- 3
- LPP Standard Form, LPP in Canonical Form: Equivalent to the Original Set
- Transportation Problem
Complexity of Simplex Algorithms [3 Notes- Negligible Effort]
- 1
- Simplex Method – Basics and Analysis: Simplex Algorithm, Cycling in Simplex Algorithms
- Simplex Method – Basics and Analysis: Simplex Method Performance
- 2
- Simplex Method – Basics and Analysis: Numbers in the Replacing Row
Ellipsoid Method and Karmakar's Method for Solving LPPs [2 Notes- Negligible Effort]
Solving Simple LPPs through These Methods [5 Notes- Negligible Effort]
- 1
- Miscellaneous Concepts in Linear Programming
- Miscellaneous Concepts in Linear Programming: Weak Duality Theorem
- 2
- Northwest Corner Method
- Least Cost Method
- 3
- Vogel՚s Approximation Method
Simple Algorithms like Hungarian Method [1 Notes- Negligible Effort]
Graph Theory [18 Notes- Negligible Effort]
Shortest Path Problems [4 Notes- Negligible Effort]
- 1
- Shortest Path Problems
- Shortest Path Problems: Dijkstra՚s Shortest Path Algorithm, Assign to Every Node a Distance Value
- 2
- Shortest Path Problems: Moore՚s Algorithm
- Studying Algorithms and Graph Theory
Network Flow Problem [11 Notes- Negligible Effort]
- 1
- Network Flow Problem: Maximum Flow Problems
- Network Flow Problem: Minimum-Cost Flow Problem
- 2
- Max-Flow Min-Cut Theorem
- Max-Flow Min-Cut Theorem: Minimum Capacity
- 3
- Max-Flow Min-Cut Theorem: Capacity of the S-T Cut
- Ford and Fulkerson՚s Algorithm
- 4
- Edmonds – Karp Algorithm
- Malhotra-Pramod Kumar-Maheshwari Polynomial Algorithm
- 5
- Bipartite Graphs and Matchings: Matching, Perfect Matching
- Bipartite Graphs and Matchings: Near-Perfect Matching, Alternating Path, Augmenting Path, Alternating Trees
- 6
- Bipartite Graphs and Matchings: Max Flow Problem-Build a Flow Network, Find the Maximum Flow
Matroids [3 Notes- Negligible Effort]
Non-Linear Programming [5 Notes- Negligible Effort]
Kuhn-Tucker Conditions [2 Notes- Negligible Effort]
Convex Functions and Convex Regions [1 Notes- Negligible Effort]
Convex Programming Problems [1 Notes- Negligible Effort]
Algorithms for Solving Convex Programming Problems [1 Notes- Negligible Effort]
Neural Networks and AI [47 Notes- 2% Effort]
Perceptron Model, Linear Separability and XOR Problem [6 Notes- Negligible Effort]
- 1
- Perceptron Model
- Perceptron Model: Decision Boundary
- 2
- Linear Separability
- Linear Separability: Margin, Linear Separability as Logic Function
- 3
- XOR Problem: Multilayer Perceptron
- XOR Problem: Another Approach, K-Nearest Neighbors
Architecture & Structure: 2 & 3 Layered Neural Nets [6 Notes- Negligible Effort]
- 1
- Architecture of Neural Networks: Feedforward Neural Network
- Architecture of Neural Networks: Feedback Networks, Recurrent Neural Network
- 2
- Architecture of Neural Networks: Long-Short Term Memory, Restricted Boltzmann Machine, Reservoir Computing
- Architecture of Neural Networks: Deep Neural Networks, Convolutional Neural Network, Deep Belief Network or DBN
- 3
- Architecture of Neural Networks: Deep Stacking Networks, Large Memory Storage Retrieval Neural Networks or LAMSTAR, Tensor Deep Stacking Networks, Compound Hierarchical-Deep Models, Pointer Networks, Encoder – Decoder Networks, Jordan Network
- Self Organizing Maps
Forward Chaining and Backward Chaining [2 Notes- Negligible Effort]
Frames, Scripts, Semantic Nets, Production Systems, Procedural Representations [7 Notes- Negligible Effort]
- 1
- Frames
- Scripts
- 2
- Semantic Nets
- Semantic Nets: And/or Trees, Multiple Inheritance
- 3
- Tangled Hierarchies, Production Systems
- Recognize-Act Cycle, Procedural Representations
- 4
- Semantic Web
Application [2 Notes- Negligible Effort]
- 1
- Applications of Neural Networks: In Medicine, Diagnosing Cardiovascular System, Speech Recognition, Character Recognition
- Applications of Neural Networks: Signature Verification Application, Face Recognition, Neural Networks in Business
Introduction & Concepts [3 Notes- Negligible Effort]
- 1
- Neural Networks
- Neural Networks: Simple Neuron, Complicated Neurona
- 2
- Neural Networks: Neural Network Elements, Artificial Neural Network or ANN
Artificial Intelligence [15 Notes- Negligible Effort]
- 1
- Neural Networks, Fuzzy Systems and Management Information Systems
- Artificial Intelligence
- 2
- Artificial Intelligence: Neural Networks
- Turing Test and Rational Agent Approaches
- 3
- Game Playing
- Min-Max Search: Terminology, Working, Optimization
- 4
- Alpha Beta Cutoff Procedures, Working of Alpha-Beta Pruning, Move Ordering in Alpha-Beta Pruning
- Conceptual Dependency and Ontologies
- 5
- Handling Uncertainty in Knowledge
- Multi Agent Systems
- 6
- Agents and Objects
- Agents and Expert Systems
- 7
- Generic Structure of Multiagent System
- Agent Communication & Agent Communication Language
- 8
- Knowledge Sharing Using Ontologies
Back Propagation-Convergence, Hopfield Nets [2 Notes- Negligible Effort]
Neural Net Learning [4 Notes- Negligible Effort]
Fuzzy Systems [21 Notes- Negligible Effort]
Definition of a Fuzzy Set [7 Notes- Negligible Effort]
- 1
- Fuzzy Systems: Fuzzy Logic
- Fuzzy Systems: Fuzzy Link to Human Intelligence, Fuzzy System
- 2
- Fuzzy Systems: Fuzzy Logic Systems Architecture, Fuzzy Control
- Definition of a Fuzzy Set
- 3
- Definition of a Fuzzy Set: Core, Support, Boundary
- Definition of a Fuzzy Set: Union/Fuzzy, Intersection/Fuzzy ‘and’ , Complement/Fuzzy ‘NOT’
- 4
- Definition of a Fuzzy Set: Distributivity, Idempotency, Null Set, Reflexity, Identity Property
Fuzzy Relations [4 Notes- Negligible Effort]
- 1
- Fuzzy Relations, Applying Operations & Cartesian Product
- Fuzzy Relations: Matrix Notation
- 2
- Fuzzy Relations: Operations on Fuzzy Relations
- Fuzzy Relations: Properties of Fuzzy Relations
Fuzzy Functions [4 Notes- Negligible Effort]
- 1
- Fuzzy Relations: Crisp Relation, Relation as Ordered Set of Tuples
- Fuzzy Functions: One-Dimensional Membership Functions
- 2
- Fuzzy Functions: Gaussian and Bell Membership Functions
- Fuzzy Functions: Sigmoidal Membership Function, Polynomial Based Functions
Fuzzy Logic Tools [2 Notes- Negligible Effort]
- 1
- Fuzzy Logic Tools: MATLAB, SCILAB, NI Lab VIEW
- Fuzzy Logic Tools: Fuzzy TECH, Fuzzy Inference Development Environment or FIDE, Fuzzy Logic Development Environment or FLDE, JFUZZY, Fuzzy CLIPS, Fuzzy Logic Inferencing Toolkit or FLINT, Fuzzy COPE
Fuzzy Measures [1 Notes- Negligible Effort]
Fuzzy Reasoning [1 Notes- Negligible Effort]
Applications of Fuzzy Systems [2 Notes- Negligible Effort]
Discrete Mathematics [61 Notes- 2% Effort]
Permutation and Combination [4 Notes- Negligible Effort]
- 1
- Discrete Mathematics and Linear, Non-Linear Programming
- Permutation: No Repetition with Distinct and Identical Objects
- 2
- Permutation with Restriction & Combination
- Stars and Bars (Combinatorics) : Combinatorics, Stars and Bars
Number System [6 Notes- Negligible Effort]
- 1
- Number System: Classification of Number System - Natural Numbers and Integers
- Number System: Whole Numbers, Rational Numbers, Irrational Numbers
- 2
- Number System: Irrational Numbers and Real Numbers
- Number System: Complex Numbers, Prime, Composite, Proper, Improper, Mixed, Algebraic, Transcendental Fractions
- 3
- Number System: Computer Number Systems - Binary, Decimal, Octal and Hexadecimal
- Number System: Numbers in Programming Languages
Mathematical Logics [1 Notes- Negligible Effort]
Predicate Logic-Fundamental Proof Procedure [12 Notes- Negligible Effort]
- 1
- Predicate Logic: Why Do We Need Predicate Logic
- Predicate Logic: Syntactical Components of Predicate
- 2
- Predicate Logic: Universal Quantifier
- Predicate Logic: Existential Quantification, Existential Quantifier and Connective or, Nested Quantifiers
- 3
- Predicate Logic: Universal Statement, Order of Application of Quantifiers, Quantifiers Using Negation
- Predicate Logic: Other Quantifiers; Precedence of Quantifiers
- 4
- Predicate Logic: Well-Formed Formula (WFF) - Rules and Interpretation
- Predicate Logic: Satisfiable, Unsatisfiable and Valid WWF
- 5
- Predicate Logic: Special Types of Variables- Bound and Free Variables
- Inference Rules
- 6
- Function Composition: Properties
- Function Composition: Domain of Composite Function, Composed with Itself
Automated Reasoning with Prepositional Logic [1 Notes- Negligible Effort]
Refutation, Resolution, Refinements to Resolution [5 Notes- Negligible Effort]
- 1
- Resolution: Resolution Rule, What Steps Do We Follow for Resolution
- Refutation: Who Uses this Mechanism
- 2
- Refinements to Resolution: DPLL, Negative and Linear Resolution
- Resolution
- 3
- Function Composition
Prepositional Logic [6 Notes- Negligible Effort]
- 1
- Propositional Logic: Proposition, Implication, Biconditional or Double Implication
- Derived Argument Forms - Rule of Inference
- 2
- Derived Argument Forms: Modus Ponens
- Derived Argument Forms: Modus Tollens
- 3
- Derived Argument Forms: Hypothetical, Disjunctive, Constructive, Destructive Syllogism, Tautology & Exportation
- Miscellaneous Terms in Propositional Logic: Validity, Soundness, Fallacy, Satisfiability
Bounding Functions [1 Notes- Negligible Effort]
Logic Programming [1 Notes- Negligible Effort]
Algebra [1 Notes- Negligible Effort]
Counting, Mathematical Induction and Discrete Probability [4 Notes- Negligible Effort]
- 1
- Mathematical Induction
- Mathematical Induction: Multiplication
- 2
- Mathematical Induction: Sum of Consecutive Cubes
- Mathematical Induction: Variants of Mathematical Induction, Strong Induction, Complete Induction, Application
Group Theory [13 Notes- Negligible Effort]
- 1
- Group
- Subgroup
- 2
- Semi Groups
- Quotients of Products
- 3
- Isomorphism
- Homomorphism
- 4
- Automorphism
- Rings
- 5
- Integral Domains
- Fields
- 6
- Applications of Group Theory: Galois Theory, Algebraic Topology, Algebraic Geometry and Cryptography, Harmonic Analysis, Combinatorics, Music, Physics, Chemistry and Materials Science, Statistical Mechanics
- Groups
- 7
- Rings and Fields
Optimization [6 Notes- Negligible Effort]
- 1
- Resource Levelling
- Resource Levelling: Second Criterion, Structure of Resource Leveling
- 2
- Resource Levelling: Establishing Dependencies, Assigning Resources, Resource Leveling Techniques, Fast Tracking
- Resource Levelling: Crashing
- 3
- Cost Consideration in Project Scheduling: How to Develop a Project Budget, Techniques Used to Estimate Project Cost
- Cost Consideration in Project Scheduling, Cost Estimation, Budgeting & Cost Management Plan
Analysis and Design of Algorithms [109 Notes- 5% Effort]
Analysis of Algorithms [7 Notes- Negligible Effort]
- 1
- Types of Algorithms: Algorithms by Implementation - Recursion, Logical, Serial, Deterministic, Quantum Algorithm
- Analysis of Algorithms
- 2
- Space and Time Complexity: Time Complexity
- Space and Time Complexity: Space Complexity
- 3
- Space and Time Complexity: Memory Usage While Execution
- Analysis of Algorithms: Time Complexity, Asymptotic Algorithm Analysis, Primitive Operation, Recurrences and Running Time
- 4
- Design of Algorithms: Techniques, Recursive Algorithms, Brute Force, Decrease and Conquer Technique, Divide, Transform and Conquer, Two Knapsack Problems, Dynamic Programming, Genetic Algorithm
Performance Comparison of Various Search Techniques [1 Notes- Negligible Effort]
Lower Bound Theory and Tight Lower Bound [1 Notes- Negligible Effort]
Introduction, Types, & Design of Algorithms [18 Notes- Negligible Effort]
- 1
- Analysis, Design of Algorithms and Graph Theory
- Algorithms
- 2
- Algorithms: Expressing Algorithms
- Types of Algorithms: Design Paradigm - Brute Force, Divide & Conquer, Search & Enumeration, Randomized, Reduced and Backtracking Algorithm
- 3
- Types of Algorithms: Optimization Problems - Linear, Dynamic, Greedy, Branch and Bound & Heuristics Method
- Types of Algorithms: Algorithm Field of Study, Algorithms by Complexity
- 4
- Design of Algorithms
- Introduction of Computing
- 5
- Types of Problems and Types of Computational Problems
- Fundamental Stages of Problem Solving
- 6
- Algorithm Verification and Validation
- Basics of Algorithm Writing
- 7
- Writing Elementary Algorithm
- Analysis of Iterative Algorithms
- 8
- Step Count
- Exhaustive Searching and Combinatorial Optimization Problems
- 9
- Complexity Analysis
- Complexity Analysis: Assignment Problem
Greedy Method [1 Notes- Negligible Effort]
Asymptotic Notations-Big Ohm, Omega and Theta [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
Number Theoretic Algorithms [1 Notes- Negligible Effort]
Polynomial Arithmetic [1 Notes- Negligible Effort]
Fast Fourier Transform [2 Notes- Negligible Effort]
String Matching Algorithms [3 Notes- Negligible Effort]
- 1
- String Matching Algorithms: Single-Pattern Algorithms
- String Matching Algorithms: Knuth – Morris – Pratt, Boyer – Moore, Bitap Algorithm
- 2
- String Matching Algorithms: Cosine Similarity, Levenshtein Distance, Jaro-Winkler Algorithm, Smith – Waterman Algorithm, Z Algorithm
Advanced Algorithms [7 Notes- Negligible Effort]
- 1
- Parallel Algorithms for Sorting: Enumeration Sort, Odd-Even Transposition Sort, Parallel Merge Sort, Hyper Quick Sort, Parallel Quicksort, Odd-Even Merge
- Searching and Merging: Interval Search, Jump Search, Interpolation Search, Exponential Search, Fibonacci Search
- 2
- Approximation Algorithms: Quality of an Approximation, Approximate Vertex Cover
- Approximation Algorithms: Approximate Traveling Salesman
- 3
- Randomized Algorithms: How to Analyze Randomized Algorithms, Las Vegas Algorithm, Monte Carlo Algorithm, Atlantic City Algorithms
- Support Vector Machine
- 4
- Support Vector Machine: Classification of Images
Genetic Algorithms (GA) [13 Notes- Negligible Effort]
- 1
- Data Analysis and Prediction Using Genetic Algorithms
- Encoding Strategies in Genetic Algorithms
- 2
- Evolving Computer Programs
- Evolving Neural Networks
- 3
- Fitness Function in Genetic Algorithms
- Genetic Algorithm: Introduction, Steps, Comparison & Working
- 4
- Genetic Algorithm: Simple, Search Spaces, Applications and Examples
- Genetic Algorithm and Its Working
- 5
- Genetic Algorithm Cycle: Overview, Algorithm and Terminologies
- Genetic Algorithm Cycle: Phases, Advantages and Limitations
- 6
- Difference between Genetic Algorithms and Traditional Algorithms:
- Genetic Operators in Simple Genetic Algorithms
- 7
- Problem Solving Using Genetic Algorithms
Sorting and Searching Algorithms [27 Notes- 1% 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,
Divide & Conquer, and Partitioning Algorithms [9 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 [2 Notes- Negligible Effort]
Transform and Conquer [4 Notes- Negligible Effort]
- 1
- Transform and Conquer Design Paradigm
- Algorithm Uniqueness
- 2
- Gaussian Elimination Method
- More Transform and Conquer Problems
Shortest Path [3 Notes- Negligible Effort]
- 1
- Single-Source Shortest Path Problems
- Transitive Closure and Shortest Path Algorithms
- 2
- Distance Vector Algorithm, Routing Information Protocol (RIP)
Dynamic Programming [1 Notes- Negligible Effort]
Microprocessor [67 Notes- 3% Effort]
Hardwired and Micro Programmed Processor Design [2 Notes- Negligible Effort]
- 1
- Microprocessor
- Hardwired and Micro Programmed Processor Design: Hardwired Control, Micro-Programmed Control Unit
Instruction Set and Programming [5 Notes- Negligible Effort]
- 1
- Instruction Set and Programming: Control Instructions, Logical Instructions
- Instruction Set and Programming: Branched, Conditional, Unconditional & Arithmetic Instructions
- 2
- Instruction Set and Programming: Data Transfer Instructions
- MIPS Architecture
- 3
- Implementation of Datapath and Load Word and Store Word Instruction
Microprocessor Applications [4 Notes- Negligible Effort]
- 1
- Microprocessor Applications: Transputer, DSP or Digital Signal Processor, General Purpose Processors or GPP, Application-Specific Processors or ASP, Office Automation and Publication, Medical, Communication, Consumer Durables, Instrumentation
- Warehouse Scale-Computers
- 2
- Characteristics of WSC Differ from Server
- Summary and Concluding Remarks
8085 [10 Notes- Negligible Effort]
- 1
- Evolution of Microprocessors
- Pentium Series
- 2
- Addressing Modes and Instruction Set of 8085
- Logical Instructions, Branching Instructions, Control Instructions
- 3
- Architecture of 8085 Microprocessors
- Architecture of 8085, Intel 8086
- 4
- Architecture of 8086
- Microprocessor, 8085 Interrupts
- 5
- Programming of 8085
- 8085 Architecture, 8085 Pin Diagram
Memory Hierarchy and Cache Coherence [6 Notes- Negligible Effort]
- 1
- Cache Coherence
- Cache Coherence Strategies, Coherence Mechanism
- 2
- Cache Coherence: Snooping, Snarfing
- Memory Hierarchy Design – Basics
- 3
- Different Types of DRAM
- Cache Coherence: Multiprocessor Cache Coherence, Snoopy Cache Coherence Protocol
Multi-Processors and Inter-Processor Arbitration [6 Notes- Negligible Effort]
- 1
- Inter-Processor Arbitration: Daisy Chaining Method, Polling or Rotating Priority Method, Fixed Priority or Independent Request Method
- Introduction to Multiprocessors
- 2
- Data Parallel Model
- Snoopy Cache Coherence Protocol: Implementation Complications
- 3
- Cache Coherence: Symmetric Shared Memory Multiprocessors
- Cache Coherence: Directory Based Cache Coherence Protocol
Hazards and Mitigation [6 Notes- Negligible 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
Faults and Exceptions [2 Notes- Negligible Effort]
Extracting Parallelism: ILP and DLP [18 Notes- Negligible Effort]
- 1
- Advanced Concepts of ILP
- Dynamic Scheduling
- 2
- Dynamic Scheduling – Loop Based Example
- Dynamic Scheduling with Speculation
- 3
- Exploiting ILP with Software Approaches
- Exploiting ILP with Software Approaches: Loop Unrolling
- 4
- Exploiting ILP with Software Approaches: Software Pipelining
- Hardware Parallelism and Software Parallelism
- 5
- Multiple Issue Processor
- VLIW (Very Long Instruction Word) Processors
- 6
- Comparison between Superscalar՚s and VLIW Processors
- Thread Level Parallelism – SMT and CMP
- 7
- Exploiting Data Level Parallelism
- Improving the Performance of Vector Processors
- 8
- Programming Vector Architectures
- Case Studies of Multicore Architectures: Intel
- 9
- Case Studies of Multicore Architectures: Sun and IBM
- Case Studies: PPE in Power Architecture
Cache Parameters, Design, and Optimizations [6 Notes- Negligible Effort]
- 1
- Basics of Cache Memory
- Cache Optimizations (Access Times, Multilevel Caches, Prioritization, and Victim Cache)
- 2
- Cache Optimizations (Misses, Associativity)
- Compiler Optimizations
- 3
- Cache Optimization: Non-Blocking Caches, Multi-Banked Caches
- Techniques to Reduce Hit Time
Synchronization in Multiprocessor System [2 Notes- Negligible Effort]
Programming [12 Notes- Negligible Effort]
Prolog and C Plus Plus and C and Java [3 Notes- Negligible Effort]
Control, IO, Functions, Parameters, & Exceptions [1 Notes- Negligible Effort]
Programming Language Concepts [8 Notes- Negligible Effort]
- 1
- Program Loops
- Subroutines
- 2
- Input-Output Programming
- Programming Language Syntax
- 3
- Scalar and Composite Data Types: Scalar or Simple Data Types, Structured or Composite Data Types
- Sequence Control: Expressions, Statements, Declarative Programming, Subprograms
- 4
- Basic Programming, Data Structures and Data Types: Introduction, Design Principles, Type, Pre & Post-Conditions
- Classes and Objects – ADT
Theory of Computation [59 Notes- 2% Effort]
Computability [48 Notes- 1% 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
- Regular Languages
- 8
- Regular Grammars
- Regular Expressions
- 9
- Regular Expressions: Set of Vowels
- Properties of Regular Language: Equivalent Formalism & Closure Property
- 10
- Properties of Regular Language: Closure Property
- Properties of Regular Language: Decidability Properties
- 11
- Pumping Lemma
- Pumping Lemma: Applications of the Pumping Lemma & for Context-Free Languages
- 12
- Non-Regular Languages
- Lexical Analysis
- 13
- Context Free Language
- Pushdown Automaton
- 14
- Pushdown Automaton: Definition, Instantaneous Description
- Pushdown Automaton: Final State Acceptability & Empty Stack Acceptability
- 15
- Pushdown Automaton: Construct a PDA
- Non-Deterministic Pushdown Automaton
- 16
- Context Free Grammar
- Context Free Grammar: Extended Context-Free Grammar
- 17
- Greibach Normal Form
- Greibach Normal Form: The Production Rule
- 18
- Ambiguity
- Ambiguity: Parse Trees Exist
- 19
- Ambiguity: Ambiguous and Unambiguous Grammer
- Equivalence of PDA՚s and Context Free Grammars
- 20
- Properties of Context Free Language
- Minimizing Number of States in DFA Compilation and Interpretation
- 21
- Minimizing Number of States in DFA Compilation and Interpretation: DFA Minimization Using Equivalence Theorem
- Context-Sensitive Languages
- 22
- Unrestricted Grammars
- Chomsky Hierarchy of Languages & 4 Types of Grammar
- 23
- Chomsky Hierarchy of Languages: Type 1 Grammar
- Regular Expressions: Mealy & Moore Machine
- 24
- Regular Expressions: Conversion from Mealy Machine to Moore Machine
- Regular Expressions: Conversion from Moore Machine to Mealy Machine
Diagonal Argument and Russel's Paradox [2 Notes- Negligible Effort]
Turing Machine [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
Software Process Models [5 Notes- Negligible Effort]
Aspect-Oriented Software Development [2 Notes- Negligible Effort]
- 1
- Aspect-Oriented Software Development: Core Concerns, How to Handle Such Crosscutting Concerns
- Aspect-Oriented Software Development: Aspect Oriented Design Process