Core2Learn – Computer Science

Core2Learn Computer Science

The Core2Learn program for Computer Science comprises of 4 core subjects, namely

Programming in C
Data Structures
Database Management System
Operating System

A Three-Step program conduct framework is proposed.

Prepare Step

Students will view at least 160 video hours across 200 Topics, excluding Outcome Review videos, in this step. Upon completion, each student will attain 550+ Active Learning Outcomes, and attempt 2200+ Knowledge Check Questions and 1000+ Summary Quiz questions to verify this attainment. In addition, they will submit 31 Session Reflection Activity comprising reflections, feedback and questions and doubts for resolution.

Practice Step

Most subjects are scheduled within 8 LiveClass sessions. Approx. 30 LiveClass sessions will be scheduled across these 4 subjects, The duration of each LiveClass session is dependent on the faculty and classroom response. During LiveClass the Faculty will apprise student preparation from the VPT report, and Completion and Gradebook reports. They will resolve student doubts highlighted in the SRA report, review student responses to KCQ and SQQs and then practice likely Interview questions using classroom discussion, debate, and Active Quiz questions.

Perform Step

Post completion of all LiveClass sessions the College should schedule several Mock Interview sessions where various types of interview-setting interactions should be emulated. These interactions should range from 'Tell-me-about-yourself' to probing application related queries.

Session Plan

The detailed session plan, along with the Learning Outcomes, VPT per Outcome and other details are progressively displayed under each subject. The suggested study time per day is also indicated should the student choose to be guided by it.

Data Structures

Week 1

Data Structures – Week 1
Week Topics : 11 Active Learning Outcomes : 28	Summary Quiz : 11 Video Play Time : ~9 Hours
Suggested Completion : 2 Topics Per Day

Topic Name	Video Play Time (min)	Learning Outcomes
Data Structures and Operations	11	ALO 1.1.1-1: Recall the terms Data and Information.
	49	ALO 1.1.1-2: Define and identify Data Structures.
	40	ALO 1.1.1-3: Recall Abstract Data Type.
	9	ALO 1.1.1-4: Recall Data Structure Operations.
Algorithm and Complexity	22	ALO 1.1.2-1: Recall Algorithm and its Characteristics.
	12	ALO 1.1.2-2: Define and Classify the Complexity.
	6	ALO 1.1.2-3: Recall Time-Space Trade-off.
	16	ALO 1.1.2-4: Distinguish Algorithm, Pseudo Code and Program.
Asymptotic notations	13	ALO 1.1.3-1: Recall Asymptotic Notations.
Asymptotic notations	11	ALO 1.1.3-2: Distinguish Big-Oh, Theta, and Omega Notations.
Introduction to One-dimensional Array	12	ALO 1.2.1-1: Recall and Classify the Array.
	12	ALO 1.2.1-2: Recall declaration, Initialization and representation of 1D Array elements in the Memory.
	5	ALO 1.2.1-3: Calculate the Address of an element from the given 1D Array.
Reading/Writing of 1D Array and Merits/Demerits of the Array	17	ALO 1.2.2-1: Recall Reading and Writing of the 1D Array elements.
	12	ALO 1.2.2-2: Write Merits and Demerits of a Linear Array.
One-dimensional Array Operations	28	ALO 1.2.3-1: WAP to Insert an elements into the given 1D Array.
	24	ALO 1.2.3-2: WAP to Delete an element from the given Linear Array.
	18	ALO 1.2.3-3: WAP to find the Largest element from the given Linear Array.
Introduction to Two-dimesional Array	5	ALO 1.3.1-1: Define the Two-dimensional Array.
Introduction to Two-dimesional Array	24	ALO 1.3.1-2: Recall the Declaration, Initialization, and representation of 2D Array elements in the Memory.
Address Calculation and Reading/Writing of 2D array elements	41	ALO 1.3.2-1: Calculate Address of an element from a given 2D Array Stored in Row-major form and column-major form.
	22	ALO 1.3.2-2: Recall Reading/Writing of 2D Array elements.
Two-dimensional Array operations	55	ALO 1.3.3-1: Recall the following 2D Array operation: i. Addition of two Matrices ii. Subtraction of two Matrices iii. Multiplication of two Matrices iv. Transpose the two Matrix
Two-dimensional Array operations	4	ALO 1.3.3-2: Recall the Saddle Point.
Sparse Matrices and Operations	8	ALO 1.3.4-1: Define the Sparse Matrix.
Sparse Matrices and Operations	19	ALO 1.3.4-2: Recall the Declaration and representation of Sparse Matrix elements.
Three-dimensional and n-D Array: Representation and Index Formula	22	ALO 1.4.1-1: Define Three-dimensional Array. ALO 1.4.1-2: Recall the representation and accessing of Three-dimensional Array elements.
	14	ALO 1.4.1-3: Calculate the Address of an element in a Three-dimensional Array.

Week 2

Data Structures – Week 2
Week Topics : 7 Active Learning Outcomes : 17	Summary Quiz : 7 Video Play Time : ~8 Hours
Suggested Completion : 2 Topics Per Day

Topic Name	Video Play Time (min)	Learning Outcomes
Introduction to Linked Lists	38	ALO 2.1.1-1: Define, declare and classify the Linked List.
	8	ALO 2.1.1-2: Recall the Need of the Linked List.
	8	ALO 2.1.1-4: Differentiate between the Array and the Linked List.
Singly Linked List & Singly Circular Linked List	59	ALO 2.1.2-1: Create and display a singly Circular Linked List.
	18	ALO 2.1.2-2: Create and Display a Singly Circular Linked List
	7	ALO 2.1.2-3: Recall the Limitations of Singly Linked and Singly Circular Linked List.
Singly and Singly Circular Linked List Operations	47	ALO 2.1.3-1: Perform the following operation with the Singly Linked List: Insertion of an element.
Singly and Singly Circular Linked List Operations	92	ALO 2.1.3: Perform the following operations with the Singly Linked List: Deletion, and count the number of elements.
Doubly Linked List and Doubly Circular Linked List	28	ALO 2.2.1-1: Create a Doubly Linked Lists.
Doubly Linked List and Doubly Circular Linked List	6	ALO 2.2.1-2: Create a Doubly Circular Linked List.
Doubly Linked List Operations	34	ALO 2.2.2-1: Perform the following operations with the Doubly and Doubly Circular Linked List: i. Insertion of an element.
	45	ALO 2.2.2-2: Perform the following operations with the Doubly and Doubly Circular Linked List: i. Insertion of an element.
	28	ALO 2.2.2-3: Perform the following operations with the Doubly and Doubly Circular Linked List: ii. Deletion of an element iii. Count the number of nodes
Generalised Linked List & Header Linked List	13	ALO 2.3.1-1: Recall the concept of Generalized Linked List.
Generalised Linked List & Header Linked List	9	ALO 2.3.1-2: Describe the concept of Linked List with Header Node.
Linked List representation of Polynomials and their Addition	14	ALO 2.3.2-1: Describe Linked List representation of a Polynomial.
	45	ALO 2.3.2-2: Write a Program in C for the Addition of two Polynomials.

Week 3

Data Structures – Week 3
Week Topics : 10 Active Learning Outcomes : 26	Summary Quiz : 10 Video Play Time : ~9 Hours
Suggested Completion : 2 Topics Per Day

Topic Name	Video Play Time (min)	Learning Outcomes
Stack and its operations	9	ALO 3.1.1-1: Describe Stack and its operations.
	20	ALO 3.1.1-2: Recall Overflow and Underflow conditions.
	6	ALO 3.1.1-3: List the Applications of Stack.
Stack Implementation	27	ALO 3.1.2-1: Write the programs of Implement Stacks using Array.
Stack Implementation	64	ALO 3.1.2-2: Write the programs to Implement Stack using Linked List.
Type of Expressions: Infix, Prefix and Postfix	18	ALO 3.1.3-1: Recall Infix, Prefix, and Postfix Expressions.
	24	ALO 3.1.3-2: Evaluate Postfix Expression using Stacks.
	46	ALO 3.1.3-3: Convert the following: i. Infix Expression to Postfix form ii. Infix Expression to Prefix form iii. Prefix Expression to Postfix form
Recursion	27	ALO 3.2.1-1: Describe the Concept of Recursion.
	7	ALO 3.2.1-1: Recall Simulating Recursion and Tail Recursion.
	15	ALO 3.2.1-3: Differentiate between Recursion and Iteration.
Examples of Recursion	18	ALO 3.2.2-1: Recall Tower of Hanoi (TOH) Problem.
Examples of Recursion	8	ALO 3.2.2-2: Write a program to implement TOH Problem.
Concept of Multiple Stacks	9	ALO 3.2.3-1: Recall the concept of Multiple Stacks.
Concept of Multiple Stacks	18	ALO 3.2.3-2: Write a program to implement Multiple Stacks.
Queues and its Operations	17	ALO 3.3.1-3: Write Algorithms/Functions to perform Insertion and Deletion operations
Queues and its Operations	19	ALO 3.3.1-1: Describe Queue and its operations.
Queue Implemetation	58	ALO 3.3.2-1: Write a Program in C to Implement Queue using Array and Linked List.
Circular Queue	29	ALO 3.3.3-1: Describe Circular Queue and its operations. ALO 3.3.3-2: Recall Overflow and Underflow conditions
	8	ALO 3.3.3-3: Apply the concept of Circular Queue operations and find the value of FRONT and REAR.
	34	ALO 3.3.3-4: Write Algorithm/Functions to perform insertion and Deletion operations.
Deque and Priority Queue	12	ALO 3.3.4-1: Describe Dequeue and its operations.
	8	ALO 3.3.4-2: Recall Overflow and Underflow conditions.
	17	ALO 3.3.4-3: Write Algorithms/Functions to perform Insertion and Deletion Operations on Dequeue.
	12	ALO 3.3.4-4: Describe Priority Queue.
	3	ALO 3.3.4-5: List various Applications of the Queue.

Week 4

Data Structures – Week 4
Week Topics : 6 Active Learning Outcomes : 22	Summary Quiz : 6 Video Play Time : ~7 Hours
Suggested Completion : 1 Topic Per Day

Topic Name	Video Play Time (min)	Learning Outcomes
Basic Tree Terminologies and representation in the Memory	18	ALO 4.1.1-1: Define and Classify Tree.
	15	ALO 4.1.1-2: Recall basic Tree Terminologies.
	21	ALO 4.1.1-3: Describe array and Linked Representation.
Binary Tree creation and its Types	6	ALO 4.1.2-1: Recall the concept of Binary Tree Creation
	6	ALO 4.1.2-2: Draw the Binary Trees for the given number of Nodes.
	27	ALO 4.1.2-3: Explain the Concept of Strictly binary Tree, Complete Binary Tree and Full Binary Tree.
	16	ALO 4.1.2-4: Explain the Concept of Extended Binary Tree.
Binary Tree Traversals	21	ALO 4.1.3-1: Describe Binary Tree Traversal. ALO 4.1.3-2: Find the Inorder, Preorder, and Postorder Traversals of a given Binary Tree.
	27	ALO 4.1.3-3: Draw a Binary Tree when: i. Inorder and Postorder Traversals are given ii. Inorder and Preorder Traversals are given iii. Preorder and Postorder Traversals are given
	8	ALO 4.1.3-4: Draw a Binary Tree for Arithmetic Expression.
Threaded Binary Trees and General Trees	40	ALO 4.2.1-1: Define and Classify Threaded Binary Trees. ALO 4.2.1-2: Draw Threaded Binary Trees for various Tree Traversals
	29	ALM 4.2.1-3: Write C functions for Inorder and Preorder Traversals in a Threaded Binary Tree.
	5	ALO 4.2.1-4: Define General Tree.
	8	ALO 4.2.1-5: Convert a General Tree into a Binary Tree.
Binary Search Trees	13	ALO 4.2.2-1: Define Binary Search Tree.
	29	ALO 4.2.2-2: Create a Binary Search Tree for the given elements.
	33	ALO 4.2.2-3: Describe Insertion and Deletion operations to be performed with BST.
	4	ALO 4.2.2-4: Define Complexities of Insertion into and Deletion from BST.
AVL Search Trees	12	ALO 4.2.3-1: Define AVL Search Tree.
	33	ALO 4.2.3-2: Recall the Balancing methods of AVL Trees.
	30	ALO 4.2.3-4: Create AVL search tree for Numerical or Alphabetical Sequences.
	11	ALO 4.2.3-4: List Applications of Trees for the representation of Sets.

Week 5

Data Structures – Week 5
Week Topics : 4 Active Learning Outcomes : 15	Summary Quiz : 4 Video Play Time : ~5 Hours
Suggested Completion : 1 Topic Per Day

Topic Name	Video Play Time (min)	Learning Outcomes
Heap and its Operations	14	ALO 4.3.1-1: Recall Heap and its Memory representation.
	32	ALO 4.3.1-2: Recall Heap Operations: Insert, Delete, Sort etc.
	4	ALO 4.3.1-3: Differentiate between Min-Heap and Max-Heap.
	21	ALO 4.3.1-4: Create Min-Heap/Max-Heap for the given elements and describe Heapify operation.
	6	ALO 4.3.1-5: Describe Applications of the Heap.
Huffman Algorithm	12	ALO 4.3.2-1: Describe Huffman Algorithm.
Huffman Algorithm	23	ALO 4.3.2-2: Apply Huffman Algorithm and generate the Binary code for each element.
m-way Search Tree: B-Tree	18	ALO 4.3.3-1: Define and Classify m-way Search Tree.
	35	ALO 4.3.3-2: Recall B Tree.
	26	ALO 4.3.3-3: Create B Tree for the given elements.
	21	ALO 4.3.3-4: Describe Insertion and Deletion operations to be performed with the B Tree.
m-way Search Tree: B+ Tree and B* Tree	25	ALO 4.3.4-1: Recall B+ Tree.
	13	ALO 4.3.4-2: Describe Operations to be performed with the B+ Tree.
	3	ALO 4.3.4-3: Compare B Tree and B+ Tree.
	6	ALO 4.3.4-4: Recall B* Tree.

Week 6

Data Structures – Week 6
Week Topics : 7 Active Learning Outcomes : 18	Summary Quiz : 7 Video Play Time : ~6 Hours
Suggested Completion : 2 Topics Per Day

Topic Name	Video Play Time (min)	Learning Outcomes
Introduction to Graph and its types	17	ALO 5.1.1-1: Define and classify the Graph.
Introduction to Graph and its types	42	ALO 5.1.1-2: Recall various Terminologies used in the Graph.
Representation of Graph in the Memory	46	ALO 5.1.2-1: Describe various representations of a Graph.
Representation of Graph in the Memory	4	ALO 5.1.2-2: Compare various representations of a Graph.
Graph Traversals (BFS & DFS) and Applications	11	ALO 5.1.3-1: Define Graph Traversing.
	16	ALO 5.1.3-2: Describe BFS with Suitable example.
	17	ALO 5.1.3-3: Describe DFS with suitable example.
	10	ALO 5.1.3-4: Write an Algorithm or a C Function for BFS & DFS.
	30	ALO 5.1.3-5: Describe Topological Sort of a Graph.
Minimum Spanning Tree: Kruskal’s Algorithm	19	ALO 5.2.1-1: Define Minimum Spanning Tree. ALO 5.2.1-2: Describe Kruskal’s Algorithm.
Minimum Spanning Tree: Kruskal’s Algorithm	7	ALO 5.2.1-3: Find Minimum Spanning Tree for the given Graph using Kruskal’s Algorithm.
Minimum Spanning Tree: Prim’s Algorithm	9	ALO 5.2.2-1: Describe Prim’s Algorithm.
Minimum Spanning Tree: Prim’s Algorithm	12	ALO 5.2.2-2: Find Minimal Spanning Tree for the given Graph using Prim’s Algorithm.
Shortest Path Algorithm: Warshall’s	27	ALO 5.2.3-1: Define the following term: Transitive Closure, Activity Network, and Shortest Path.
	7	ALO 5.2.3-2: Discuss Warshall’s Algorithm.
	18	ALO 5.2.3-3: Find All Pair Shortest Paths for a given Graph using Warashall’s Algorithm.
Shortest Path Algorithm: Dijkstra’s	11	ALO 5.2.4-1: Write Dijkstra’s Algorithm.
Shortest Path Algorithm: Dijkstra’s	16	ALO 5.2.4-2: Find the Single Sources Shortest Path for the given Graph Dijkstra’s Algorithm.

Week 7

Data Structures – Week 7
Week Topics : 11 Active Learning Outcomes : 34	Summary Quiz : 11 Video Play Time : ~7 Hours
Suggested Completion : 2 Topics Per Day

Topic Name	Video Play Time (min)	Learning Outcomes
Linear Search	6	ALO 6.1.1-1: Define and classify Searching.
	17	ALO 6.1.1-2: Describe Linear Search.
	4	ALO 6.1.1-3: Recall the Complexity of Linear Search.
	7	ALO 6.1.1-4: Write an Algorithm or a ‘C’ program to Search an element using Linear Search.
Binary Search	25	ALO 6.1.2-1: Describe Binary Search.
	4	ALO 6.1.2-2: Recall the Complexity of Binary Search.
	17	ALO 6.1.2-3: Write an Algorithm or a ‘C’ program to Search an element using Binary Search.
Interpolation Search	13	ALO 6.1.3-1: Describe Interpolation Search.
	3	ALO 6.1.3-2: Recall the Complexity of Interpolation Search.
	19	ALO 6.1.3-3: Write an Algorithm or a ‘C’ program to Search an element using interpolation Search.
Introduction to Sorting	11	ALO 6.2.1-1: Define and classify the Sorting. ALO 6.2.1-2: Differentiate between Internal sorting and External sorting.
	4	ALO 6.2.1-3: Differentiate between Online Sorting and Offline Sorting.
	4	ALO 6.2.1-4: List properties of Sorting Techniques.
Bubble Sort	22	ALO 6.2.2-1: Describe Bubble Short.
	16	ALO 6.2.2-2: Write a C function/program to implement Bubble sort.
	12	ALO 6.2.2-3: Describe Bubble sort with optimization.
	4	ALO 6.2.2-4: Recall the complexity of Bubble sort.
Selection Sort	16	ALO 6.2.3-1: Describe Selection Sort.
	6	ALO 6.2.3-2: Write a C Function/ Program to implement Selection Sort.
	3	ALO 6.2.3-3: Recall the Complexity of Selection Sort.
Insertion Sort	29	ALO 6.2.4-1: Describe Insertion Sort.
	7	ALO 6.2.4-2: Write a C Function/ Program to implement Insertion Sort.
	2	ALO 6.2.4-3: Recall the Complexity of Insertion Sort.
Quick sort	36	ALO 6.3.1-1: Describe Quick Sort.
	7	ALO 6.3.1-2: Write a C Function/Program to implement Quick Sort.
	9	ALO 6.3.1-3: Recall the Complexity of Quick Sort.
Merge sort	18	ALO 6.3.2-1: Describe Merge Sort.
	22	ALO 6.3.2-2: Write a C function/Program to implement Merge Sort.
	3	ALO 6.3.2-3: Recall the Complexity of Merge Sort.
Bucket sort	27	ALO 6.3.3-1: Describe Bucket Sort. ALO 6.3.3-2: Write an algorithm for Bucket Sort
Bucket sort	2	ALO 6.3.3-3: Recall the Complexity of Bucket Sort.
Shell sort	28	ALO 6.3.4-1: Describe Shell Sort. ALO 6.3.4-2: Write an algorithm for Shell Sort
	2	ALO 6.3.4-3: Recall the Complexity of Shell Sort.
	7	ALO 6.3.4-4: Compare the Complexity of Sorting Techniques.

Week 8

Data Structures – Week 8
Week Topics : 6 Active Learning Outcomes : 14	Summary Quiz : 6 Video Play Time : ~4 Hours
Suggested Completion : 1 Topic Per Day

Topic Name	Video Play Time (min)	Learning Outcomes
Files and File Access Methods	9	ALO 6.4.1-1: Define the following terms: File, Field and Record.
	20	ALO 6.4.1-2: Define and Classify File Organization.
	9	ALO 6.4.1-3: Recall Storage Devices.
List representation of Sets and its Applications	8	ALO 6.4.2-1: Recall the term Set.
List representation of Sets and its Applications	12	ALO 6.4.2-2: Define List representation of Set.
Hashing and its types	15	ALO 6.5.1-1: Recall the term Hashing.
Hashing and its types	38	ALO 6.5.1-2: Explain various Hash functions used in Hashing. ALO 6.5.1-3: List the Characteristics of Good or Perfect Hash Function
Collision Resolution Techniques	23	ALO 6.5.2-1: Recall the term Collision.
Collision Resolution Techniques	59	ALO 6.5.2-2: Describe the following Collision resolution techniques: i. Open Addressing ii. Separate iii. Chaining Rehashing
Garbage collection and compaction	17	ALO 6.5.3-1: Recall the following terms: Garbage Collection and Compaction.
Garbage collection and compaction	3	ALO 6.5.3-2: List Advantages and Disadvantages of Garbage Collection.
Radix Sort	12	ALO 6.6.1-1: Describe Radix Sort.
	5	ALO 6.6.1-2: Write an Algorithm for Radix Sort.
	3	ALO 6.6.1-3: Recall the Complexity of Radix Sort.

Database Management System

Week 1

Database Management System – Week 1
Week Topics : 6 Active Learning Outcomes : 15	Summary Quiz : 6 Video Play Time : ~5 Hours
Suggested Completion : 1 Topic Per Day

Topic Name	Video Play Time (min)	Learning Outcomes
Database and File System	40	ALO 1.1.1-1: Describe Database and its need.
Database and File System	9	ALO 1.1.1-2: Differentiate between Database System and File System.
Database Management System	20	ALO 1.1.2-1: Recall DBMS and its Advantages.
	11	ALO 1.1.2-2: Describe the Functions of DBMS.
	25	ALO 1.1.2-3: Describe the Characteristics of Data in DBMS.
	5	ALO 1.1.2-4: Recall the concerns while using DBMS.
Database Schemas, Models and Instances	9	ALO 1.1.3-1: Define and differentiate Database Schema and Instances.
	16	ALO 1.1.3-2A: Recall the following Data Models: i. ER Model
	46	ALO 1.1.3-2B: Recall the following Data Models: ii. Relational Model iii. Hierarchical Model iv. Network Model.
Database Three Level Architecture and Independence	42	ALO 1.2.1-1: Describe Three-level Schema Architecture of DBMS.
Database Language and users	42	ALO 1.2.2-1: Recall Database Languages like DDL, DML etc.
	13	ALO 1.2.2-2: Describe Database Administrator and other Database Users.
	11	ALO 1.2.2-3: Recall DBMS interfaces.
DBMS Architecture	12	ALO 1.2.3-1: Describe Database Architectures: Two-Tier and Three-Tier Architectures.
DBMS Architecture	28	ALO 1.2.3-2: Recall overall Structure of the DBMS.

Week 2

Database Management System – Week 2
Week Topics : 6 Active Learning Outcomes : 11	Summary Quiz : 6 Video Play Time : ~5 Hours
Suggested Completion : 1 Topic Per Day

Topic Name	Video Play Time (min)	Learning Outcomes
E-R Diagram Basics	22	ALO 1.3.1-1: Describe the concept of E-R Model.
E-R Diagram Basics	38	ALO 1.3.1-2: Recall the following concepts of E-R Diagram: i. Entity, Entity Instance, Entity Sets ii. Attributes and it’s various type iii. Keys and value sets
Relationship and various constraints	10	ALO 1.3.2-1: Explain Relationships used in E-R Diagram.
Relationship and various constraints	36	ALO 1.3.2-2: Recall E-R Diagram Structural Constraints: Cardinality and Participation constraints.
Types of Relationship and Entities	15	ALO 1.3.3-1: Describe the degree/types of Relationships: i. Binary ii. Ternary iii. Unary/Recursive Relationship
Types of Relationship and Entities	26	ALO 1.3.3-2: Classify the Entity: i. Strong Entity ii. Weak Entity.
E-R Design Issues	27	ALO 1.3.4-1: Recall the following terms. i. Role Names ii. Descriptive Attribute
E-R Design Issues	16	ALO 1.3.4-2: Describe the issues of E-R Design.
Extended E-R Model	40	ALO 1.4.1-1: Recall the Enhanced E-R Diagram.
Extended E-R Model	5	ALO 1.4.1-2: Describe various Notations used in E-R Diagram.
E-R Diagram to Relational model	53	ALO 1.4.2-1: Recall the procedure to convert an E-R Diagram into a Relational Model.

Week 3

Database Management System – Week 3
Week Topics : 6 Active Learning Outcomes : 11	Summary Quiz : 6 Video Play Time : ~5 Hours
Suggested Completion : 1 Topic Per Day

Topic Name	Video Play Time (min)	Learning Outcomes
Relational Database and Integrity Constraints	21	ALO 2.1.1-1: Recall Relational Database and its characteristics.
Relational Database and Integrity Constraints	45	ALO 2.1.1-2: Define and classify Integrity Constraints.
Relational Algebra	18	ALO 2.1.2-1: Recall Relational Algebra and its various Operations.
Relational Algebra	34	ALO 2.1.2-2: Describe the following Operations: Selection, Projection, and Composition.
Relational Algebra Operations	22	ALO 2.1.3-1: Recall Binary Set operations: Union, Intersection, and Minus.
Relational Algebra Operations	81	ALO 2.1.3-2: Describe various type of Joins: i. Cartesian Product ii. Inner Join iii. Outer Join
Extended Relational Algebra Operations	26	ALO 2.1.4-1A: Describe extended Relational Algebra Operationsi. Rename ii. Division
Extended Relational Algebra Operations	33	ALO 2.1.4-1B: Describe extended Relational Algebra Operations: iii. Generalized Projection iv. Aggregate Functions
Relational Calculus	10	ALO 2.2.1-1: Describe Relational Calculus and various symbols used.
Relational Calculus	8	ALO 2.2.1-2: Relational Calculus expressions: safe and unsafe ALO 2.2.1-3: Describe power of Algebra and Calculus
Types of Relational Calculus	28	ALO 2.2.2: Recall Tuple and Domain Relational Calculus.

Week 4

Database Management System – Week 4
Week Topics : 5 Active Learning Outcomes : 13	Summary Quiz : 5 Video Play Time : ~5 Hours
Suggested Completion : 1 Topic Per Day

Topic Name	Video Play Time (min)	Learning Outcomes
Introduction to SQL	9	ALO 3.1.1-1: Describe SQL and its characteristics.
	15	ALO 3.1.1-2: Describe Data types used in the SQL.
	21	ALO 3.1.1-3: Recall the types of SQL commands.
SQL Operations	13	ALO 3.1.2-1: Describe basic structure of SQL queries.
	30	ALO 3.1.2-2: Recall various operations: i. Retrieve all attributes ii. Duplicate elimination iii. Comparison Operator
	35	ALO 3.1.2-3: Recall various SQL operations: iv. Rename operator v. String operations vi. Comparison with NULL vii. Ordering the Tuples
SQL Joins	19	ALO 3.2.1-1: Describe SQL Joins: Inner Join and Outer join.
	9	ALO 3.2.1-2: Describe Aggregate Function.
	26	ALO 3.2.1-3: Recall Group by and Having clauses.
SQL Sub-queries	42	ALO 3.2.2-1: Describe the following SQL Sub-queries: i. IN Sub-query ii. ALL Sub-query
SQL Sub-queries	31	ALO 3.2.2-2: Describe Correlated Nested Sub-query: iii. Exists/Not Exists iv. CONTAINS.
Views & Modifications of the Database	12	ALO 3.2.3-1: Recall the concept of View.
Views & Modifications of the Database	14	ALO 3.2.3-2: Describe the Modification of Database.

Week 5

Database Management System – Week 5
Week Topics : 7 Active Learning Outcomes : 18	Summary Quiz : 7 Video Play Time : ~6 Hours
Suggested Completion : 2 Topics Per Day

Topic Name	Video Play Time (min)	Learning Outcomes
Introduction to Functional Dependency	14	ALO 4.1.1-1: Recall the basics of Relational Schema.
	38	ALO 4.1.1-2: Describe design issues of Relational Schema.
	22	ALO 4.1.1-3: Recall the term Functional Dependency.
Rules of Inference and Attribute Closure	27	ALO 4.1.2-1: Recall the rules of Inference and Armstrong’s Axioms.
Rules of Inference and Attribute Closure	40	ALO 4.1.2-2: Describe Attribute Closure and its use to find: i. Membership set ii. Closure of FD set.
Minimal Cover and Candidate Key	16	ALO 4.1.3-1: Explain the equivalence of 2 FDs.
	28	ALO 4.1.3-2: Recall the way to find Minimal Cover.
	24	ALO 4.1.3-3: Recall the steps to find Candidate Key.
Normal Forms: 1NF & 2NF	24	ALO 4.2.1-1: Recall the term Normalization.
Normal Forms: 1NF & 2NF	36	ALO 4.2.1-2: Describe First Normal Form (1NF) and Second Normal Form (2NF).
Normal Forms: 3NF & BCNF	24	ALO 4.2.2-1: Recall Third Normal Form (3NF).
	14	ALO 4.2.2-2: Explain Boyce-Codd Normal Form (BCNF).
	6	ALO 4.2.2-3: Solve PYQs based on 3NF and BCNF.
Properties of Normalization	26	ALO 4.3.1-1A: Describe additional properties of Normalization: Lossless Decomposition and Dependency Preserving.
Properties of Normalization	15	ALO 4.3.1-1B: Describe additional properties of Normalization: Lossless Decomposition and Dependency Preserving.
Higher Normal Forms	17	ALO 4.3.2-1: Describe Higher Normal Forms.
	7	ALO 4.3.2-2: Recall Multi-valued Dependency and Fourth Normal Form (4NF).
	11	ALO 4.3.2-3: Recall Fifth Normal Form (5NF).

Week 6

Database Management System – Week 6
Week Topics : 5 Active Learning Outcomes : 13	Summary Quiz : 5 Video Play Time : ~5 Hours
Suggested Completion : 1 Topic Per Day

Topic Name	Video Play Time (min)	Learning Outcomes
Query Processing	6	ALO 5.1.1-1: Recall the concept of Query Processing.
	16	ALO 5.1.1-2: Recall the concept of Query Optimization.
	6	ALO 5.1.1-3: Describe the steps used in the Query Optimization.
Optimization of Relational Algebra Operations	34	ALO 5.1.2-1: Write an Algorithm to Optimize Select Operation.
	12	ALO 5.1.2-2: Write an Algorithm to Optimize Project Operation.
	10	ALO 5.1.2-3: Write an Algorithm to Optimize Join Operation.
Basics of Transaction and Concurrency Control	20	ALO 5.2.1-1: Recall the term Transaction.
	7	ALO 5.2.1-2: Recall various States of a Transaction.
	40	ALO 5.2.1-3: Describe the need of Concurrency Control for: a. Lost Update Problem. b. Dirty Read Problem. c. Incorrect Summary Problem.
ACID Properties and Schedules	19	ALO 5.2.2-1: Describe ACID Properties.
ACID Properties and Schedules	24	ALO 5.2.2-2: Recall Concurrent Execution and Concept of Schedules.
Schedules: Serializability & Recovery	67	ALO 5.2.3-1: Classify Schedules based on Serializability.
Schedules: Serializability & Recovery	23	ALO 5.2.3-2: Recall Schedules based on Recovery.

Week 7

Database Management System – Week 7
Week Topics : 5 Active Learning Outcomes : 12	Summary Quiz : 5 Video Play Time : ~5 Hours
Suggested Completion : 1 Topic Per Day

Topic Name	Video Play Time (min)	Learning Outcomes
Concurrency Control Protocols: LB & 2PL	11	ALO 5.3.1-1: Describe the concept of Concurrency Control.
	25	ALO 5.3.1-2A: Recall Locking Techniques for Concurrency Control.
	40	ALO 5.3.1-2B: Recall Locking Techniques for Concurrency Control.
Concurrency Control Protocols: Time Stamp	42	ALO 5.3.2-1: Describe Time-Stamping Protocol for Concurrency Control.
Concurrency Control Protocols: Time Stamp	12	ALO 5.3.2-2: Recall Thomas Write Rule for Concurrency Control.
Multiple Granularity & Multi-version Schemes	24	ALO 5.3.3-1: Describe Validation Based Protocol.
Multiple Granularity & Multi-version Schemes	37	ALO 5.3.3-2: Describe Multiple Granularity.
Deadlock Handling and Recovery	51	ALO 5.4.1-1: Recall the concept of Deadlock Handling.
Deadlock Handling and Recovery	15	ALO 5.4.1-2: Recall the concept of Recovery from Transaction Failure. ALO 5.4.1-3: Describe various types of Failures.
Recovery Methods	34	ALO 5.4.2-1: Describe the concept of Log Based Recovery.
	9	ALO 5.4.2-2: Describe the concept of Checkpoints.
	12	ALO 5.4.2-3: Recall the concept of Shadow Paging.

Week 8

Database Management System – Week 8
Week Topics : 8 Active Learning Outcomes : 13	Summary Quiz : 8 Video Play Time : ~6 Hours
Suggested Completion : 2 Topics Per Day

Topic Name	Video Play Time (min)	Learning Outcomes
Introduction to File organization	15	ALO 6.1.1-1: Recall the basic concepts of File Organisation.
	10	ALO 6.1.1-2: Recall placing of File records on the Disk.
	13	ALO 6.1.1-3: Describe File Organisation Techniques.
Index File Structure	13	ALO 6.1.2-1: Explain the Structure of Index File.
Index File Structure	22	ALO 6.1.2-2: Describe various type of Index File: i. Dense Index ii. Sparse Index
Single Level Index	44	ALO 6.1.3-1: Describe various types of Single Level Index: i. Primary Index ii. Clustered Index iii. Secondary Index
Multilevel Index and B-Tree	15	ALO 6.1.4-1: Recall the Concept of Multilevel Index.
Multilevel Index and B-Tree	71	ALO 6.1.4-2: Describe Dynamic Multilevel Index using the concept of B Tree: i. Creation of B Tree. ii. Insertion of an element into the B Tree. iii. Deletion of an element from the B Tree.
Concept of B+ Tree	65	ALO 6.1.5: Describe Dynamic Multilevel Index using the concept of B+ Tree: i. Creation of B+ Tree ii. Insertion of an element into the B+ Tree iii. Deletion of an element from the B+ Tree.
Introducion to Security Threats	17	ALO 6.2.1-1: Describe various Security Threats.
Introducion to Security Threats	14	ALO 6.2.1-2: Recall Database Security and DBA: Grant and Revoke.
Access Control Mechanism	35	ALO 6.2.2-1: Describe the following Access Control Mechanisms: i. Discretionary Access Control ii. Mandatory Access Control: Bell LaPadula Model iii. Role Based Access Control.
Database Protection	12	ALO 6.2.3-1: Recall methods of Database Protection: Encryption and Digital Signature.

Programming in C

Week 1

Programming in C – Week 1
Week Topics : 5 Active Learning Outcomes : 14	Summary Quiz : 5 Video Play Time : ~4 Hours
Suggested Completion : 1 Topic Per Day

Topic Name	Video Play Time (min)	Learning Outcomes
Concept of Algorithm	9	ALO 2.1.1-1: Define and Identify Approaches to Problem Solving.
	3	ALO 2.1.1-2: Differentiate between Top-down and Bottom-up Approaches.
	27	ALO 2.1.1-3: Define Algorithm and write its Characteristics.
	44	ALO 2.1.1-4: Write an Algorithm for a given problem.
Concept of Flowchart	15	ALO 2.1.2-1: Define Flowchart. ALO 2.1.2-2: Recall the symbols used to draw a Flowchart.
	4	ALO 2.1.2-3: Recall the rules for designing the Flowchart
	54	ALO 2.1.2-4: Draw a Flowchart for the given Problem
Concept of Pseudocode	6	ALO 2.1.3-1: Define Pseudo Code.
	8	ALO 2.1.3-2: Differentiate between Algorithm and Pseudo Code.
	30	ALO 2.1.3-3: Design Pseudo Code for the given Problem.
Computer Languages	27	ALO 2.2.1-1: Describe Computer Languages and differentiate between them.
Computer Languages	4	ALO 2.2.1-2: List various Generations of Computer Languages and differentiate between them.
Language Translators	26	ALO 2.2.2-1: Define the following Language Translators: Compiler, Interpreter, and Assembler.
Language Translators	8	ALO 2.2.2-2: Differentiate between Linker and Loader.

Week 2

Programming in C – Week 2
Week Topics : 9 Active Learning Outcomes : 24	Summary Quiz : 9 Video Play Time : ~6 Hours
Suggested Completion : 2 Topics Per Day

Topic Name	Video Play Time (min)	Learning Outcomes
Write and execute first C Program	36	ALO 3.1.1-1: Write and explain the Structure of a C Program.
	15	ALO 3.1.1-2: Explain main() Function and describe the need of clrscr() and getch() Functions. ALO 3.1.1-3: Demonstrate the process of Compilation and Execution of a C Program
	9	ALO 3.1.1-4: Describe Standard Input-output Functions used in ‘C’ Language.
C Tokens and Data types I	4	ALO 3.1.2-1: Describe C Tokens.
	7	ALO 3.1.2-2: Describe C Character sets and differentiate between them.
	41	ALO 3.1.2-3: List and identify the Keywords used in C Language.
C Tokens and Data types II	27	ALO 3.1.3-1: Describe Data Types and differentiate between Primary and Secondary Data types.
	14	ALO 3.1.3-2: Calculate the Range of Data Types.
	14	ALO 3.1.3-3: Define and differentiate between Data Type Modifiers and Qualifiers.
Identifiers and data type casting	10	ALO 3.1.4-1: Define Identifier and state the rules for Naming the Identifiers.
Identifiers and data type casting	6	ALO 3.1.4-2: Define Data type casting and differentiate between implicit and explicit type casting.
Unary operators	3	ALO 3.2.1-1: Describe Operators and differentiate between Unary, Binary, and Ternary Operators.
	6	ALO 3.2.1-2: Explain Unary operators and distinguish between them.
	33	ALO 3.2.1-3: Apply Increment and Decrement operators to write Programs and find the Outputs.
Binary Operators I	3	ALO 3.2.2-1: Describe Binary Operators.
	9	ALO 3.2.2-2: Recall Arithmetic operators.
	17	ALO 3.2.2-3: Describe Logical operators and apply them with Unary operators.
Binary Operators II	33	ALO 3.2.3-1: Recall Bitwise operators and differentiate between Logical and Bitwise operators.
	5	ALO 3.2.3-2: Describe Relational, Assignment, and Mixed operators.
	3	ALO 3.2.3-3: Write the difference between = and ==
Ternary operator, precedence and associativity	12	ALO 3.2.4-1: Recall Ternary Operator. ALO 3.2.4-2: Describe sizeof () operator.
Ternary operator, precedence and associativity	9	ALO 3.2.4-3: Recall Precedence and Associativity and apply them to solve the Expressions.
Storage classes	14	ALO 3.2.5-1: Recall Scope and Lifetime of a Variable and differentiate between Local and Global variables.
Storage classes	16	ALO 3.2.5-2: Describe Storage Classes on the basis of Storage location, Default Initial value, Scope, and Lifetime of variable.

Week 3

Programming in C – Week 3
Week Topics : 8 Active Learning Outcomes : 20	Summary Quiz : 8 Video Play Time : ~3 Hours
Suggested Completion : 2 Topics Per Day

Topic Name	Video Play Time (min)	Learning Outcomes
if-else statement	3	ALO 4.1.1-1: Describe Decision making structures.
	11	ALO 4.1.1-2: Define and apply if-else statement.
	11	ALO 4.1.1-3: Define and apply if-else ladder.
switch statement	18	ALO 4.1.2-1: Describe and apply switch statement with proper syntax
for loop	28	ALO 4.2.1-1: Describe and apply for Loop with proper syntax of ‘C’ Language.
for loop	24	ALO 4.2.1-2: Describe and apply nested for Loop with proper syntax of ‘C’ Language.
while and do-while loops	4	ALO 4.2.2-1: Differentiate between while loop and do-while loop.
while and do-while loops	19	ALO 4.2.2-2: Apply while loop and do-while loop.
Jumping control statements	8	ALO 4.2.3-1: Describe the use of Jumping Control statements.
	5	ALO 4.2.3-2: Differentiate between break and continue.
	7	ALO 4.2.3-3: Describe goto statement.
Introduction to Functions	15	ALO 4.3.1-1: Define the Function. ALO 4.3.1-2: Differentiate between User-defined Functions and Library Functions.
Introduction to Functions	8	ALO 4.3.1-3: Differentiate between Formal Arguments and Actual Arguments.
Functions with Array	16	ALO 4.3.2-1: Describe Function with Array.
	6	ALO 4.3.2-2: Describe Parameter Passing Techniques in Functions.
	17	ALO 4.3.2-3: Differentiate between call-by-value and call-by-reference.
Recursive Functions	0	ALO 4.3.3-1: Describe Recursive Function: 6 min.
	0	ALO 4.3.3-2: Write Programs using Recursive Functions: 10 min.
	0	ALO 4.3.3-3: Describe Tower of Hanoi problem: 9 min.
	0	ALO 4.3.3-4: Write a Recursive Program to implement Tower of Hanoi problem: 10 min.

Week 4

Programming in C – Week 4
Week Topics : 5 Active Learning Outcomes : 21	Summary Quiz : 5 Video Play Time : ~4 Hours
Suggested Completion : 1 Topic Per Day

Topic Name	Video Play Time (min)	Learning Outcomes
Introduction to one-dimensional Array	5	ALO 5.1.1-1: Define and classify the Array.
	11	ALO 5.1.1-2: Declare, Initialize and represent 1D Array elements into the Memory.
	5	ALO 5.1.1-3: Calculate Address of an element from a given 1D Array.
	11	ALO 5.1.1-4: Explain Reading and Writing of 1D Array elements.
	14	ALO 5.1.1-5: Describe advantages and disadvantages of the Array.
One-dimensional Array operations	28	ALO 5.1.2-1: Write an Algorithm or Program to Insert an element into the given 1D Array.
	11	ALO 5.1.2-2: Write an Algorithm or Program to Delete an element from the given Linear Array.
	8	ALO 5.1.2-3: Write an Algorithm or Program to find the largest element from the given Linear Array.
	2	ALO 5.1.2-4: Write an Algorithm or Program to find the Smallest element from the given Linear Array.
Linear Search and Binary Search	8	ALO 5.1.3-1: Describe Linear Search
	11	ALO 5.1.3-2: Write an Algorithm or a Program to implement the Linear Search
	11	ALO 5.1.3-3: Describe Binary Search
	15	ALO 5.1.3-4: Write an Algorithm or a Program to implement the Binary Search
Introduction to Two-dimensional Array	10	ALO 5.2.1-1: Define Two-dimensional Array
	9	ALO 5.2.1-2: Declare, Initialize and represent 2D Array elements into the Memory.
	14	ALO 5.2.1-3: Explain reading and writing of 2D Array elements.
	0	ALO 5.2.1-4: Calculate Address of an element from a given 2D Array in Row-major and Column-major forms: 11 min.
Two-dimensional Array operations	24	ALO 5.2.2-1: Describe Addition of two Matrices.
	29	ALO 5.2.2-2: Describe Multiplication of two Matrices
	19	ALO 5.2.2-3: Describe Transpose of a Matrix
	18	ALO 5.2.2-4: Describe Saddle Point

Week 5

Programming in C – Week 5
Week Topics : 5 Active Learning Outcomes : 20	Summary Quiz : 5 Video Play Time : ~2 Hours
Suggested Completion : 1 Topic Per Day

Topic Name	Video Play Time (min)	Learning Outcomes
Introduction to Structures	10	ALO 5.3.1-1: Define, declare, and initialize Structure and its representation in the Memory.
	10	ALO 5.3.1-2: Describe accessing of members of Structure with and without Pointer variables.
	12	ALO 5.3.1-3: Describe reading and writing of Structure elements.
	7	ALO 5.3.1-4: Explain the concept of Self-referential Structure.
	9	ALO 5.3.1-5: Apply Structure concept to write the program in C.
Concept of nested Structures	11	ALO 5.3.2-1: Define, declare, and initialize Nested Structure.
Concept of nested Structures	11	ALO 5.3.2-2: Describe Reading and Writing of nested Structure elements.
Arrays of structures and Structures to Functions	6	ALO 5.3.3-1: Define Array of Structure.
	18	ALO 5.3.3-2: Describe reading and writing of Array of Structure
	5	ALO 5.3.3-3: Define Structures of Functions.
	5	ALO 5.3.3-4: Apply Structures of Function to write the program in C.
Introduction to Union	13	ALO 5.4.1-1: Define, declare, and initialize Union and its representation in the Memory.
	4	ALO 5.4.1-3: Differentiate between Structure and Union.
	3	ALO 5.4.1-4: Describe Union under Structure.
Enumerated Data type and use of typedef	12	ALO 5.4.2-1: Define, declare, and initialize Enumeration ALO 5.4.2-2: Describe Reading and Writing of Enumeration elements. ALO 5.4.2-3: Define typedef and differentiate it with enumeration.

Week 6

Programming in C – Week 6
Week Topics : 5 Active Learning Outcomes : 10	Summary Quiz : 5 Video Play Time : ~3 Hours
Suggested Completion : 1 Topic Per Day

Topic Name	Video Play Time (min)	Learning Outcomes
Arrays and Strings	12	ALO 6.1.1-1: Define, declare, and initialize Strings.
	2	ALO 6.1.1-2: Describe reading and writing of the Strings.
	4	ALO 6.1.1-3: Differentiate between scanf () and gets()
String manipulations	47	ALO 6.1.2: Describe Strings manipulation with and without using Library Functions.
Pointers and Pointers Arithmetic	17	ALO 6.2.1-1: Define, declare, and initialize Pointers in C.
Pointers and Pointers Arithmetic	25	ALO 6.2.1-2: Explain Pointers Arithmetic.
Pointers and Arrays	30	ALO 6.2.2-1: Describe Pointers and Arrays.
Pointers and Arrays	5	ALO 6.2.2-2: Differentiate between Pointers and Array.
Dynamic memory allocation	19	ALO 6.2.3-1: Describe Dynamic Memory Allocation Technique.
Dynamic memory allocation	13	ALO 6.2.3-2: Differentiate between Dynamic Memory Allocation and Static Memory Allocation Techniques.

Week 7

Programming in C – Week 7
Week Topics : 4 Active Learning Outcomes : 11	Summary Quiz : 4 Video Play Time : ~2 Hours
Suggested Completion : 1 Topic Per Day

Topic Name	Video Play Time (min)	Learning Outcomes
File handling and Input/output functions	11	ALO 6.3.1-1: Define and classify File.
	13	ALO 6.3.1-2: Describe various Formatted and Unformatted Input-Output Functions.
	7	ALO 6.3.1-3: Explain various File opening Modes in C.
File I/O operations and Error handling	27	ALO 6.3.2-1: Describe Input-Output operations to be performed on Files.
	12	ALO 6.3.2-2: Write Programs in C to perform operations of File.
	15	ALO 6.3.2-3: Discuss Error handling during Input-Output operations.
Standard C Pre-processors	14	ALO 6.4.1-1: Describe standard C Pre-processors and explain Header Files.
	17	ALO 6.4.1-2: Describe Macros used in â€˜Câ€™.
	5	ALO 6.4.1-3: Differentiate between Macros and Functions.
	12	ALO 6.4.1-4: List and explain Conditional Compilation commands.
Passing values to the compiler	10	ALO 6.4.2-1: Describe the concept of Passing Values to the Compiler in ‘C’.

Operating System

Week 1

Operating System – Week 1
Week Topics : 8 Active Learning Outcomes : 18	Summary Quiz : 8 Video Play Time : ~3 Hours
Suggested Completion : 2 Topics Per Day

Topic Name	Video Play Time (min)	Learning Outcomes
Introduction to System Softwares	11	ALO 1.1.1-1: Recall and classify the Software.
	7	ALO 1.1.1-2: Differentiate between Application Software and System Software.
	8	ALO 1.1.1-3: Define the terms: Software, Hardware, and Firmware.
Operating System and its functions	9	ALO 1.1.2-1: Define Operating System.
	6	ALO 1.1.2-2: List the Functions of Operating System.
	5	ALO 1.1.2-3: Differentiate between CLI and GUI based Operating Systems.
Buffering & Spooling	10	ALO 1.2.1-1: Explain the concept of Buffering.
Buffering & Spooling	4	ALO 1.2.1-2: Differentiate between Spooling and Buffering.
Batch & Time sharing OS	8	ALO 1.2.2-1: Describe Batch Operating System.
Batch & Time sharing OS	10	ALO 1.2.2-2: Describe Time-Sharing Operating System. ALO 1.2.2-3: Differentiate between Batch OS and Time-sharing Operating System
Real-time OS	5	ALO 1.2.3-1: Describe Real-time Operating System.
Real-time OS	5	ALO 1.2.3-2: Differentiate between Hard Real-time and Soft Real-time Operating Systems.
Multiprocessor, Multiprogramming & Multithreading OSs	19	ALO 1.3.1-1: Define and differentiate the following OS: i. Multi-processing and Multi-programming ii. Multi-processing and Multi-tasking iii. Multi-programming and Multi-tasking
Distributed and Network OS	9	ALO 1.3.2-1: Describe Distributed Operating System.
	6	ALO 1.3.2-2: Describe Network Operating System.
	2	ALO 1.3.2-3: Differentiate between Distributed OS and Network OS.
System Structure and Operating System Design Issues	22	ALO 1.4.1-1: Recall the various Operating System architectures such as Monolithic, Layered, and Micro-kernel.
System Structure and Operating System Design Issues	8	ALO 1.4.1-2: Recall the various OS Design Issues such as Transparency, Flexibility, Reliability, Performance and Scalability.

Week 2

Operating System – Week 2
Week Topics : 6 Active Learning Outcomes : 13	Summary Quiz : 6 Video Play Time : ~5 Hours
Suggested Completion : 1 Topic Per Day

Topic Name	Video Play Time (min)	Learning Outcomes
Process and Process Control Block	17	ALO 2.1.1-1: Define Process.
Process and Process Control Block	17	ALO 2.1.1-2: Discuss Process Control Block.
Process Communication	17	ALO 2.1.2-1: Describe Co-Operative Process.
Process Communication	17	ALO 2.1.2-2: Explain the Concept of Inter-Process Communication.
Process Synchronization	24	ALO 2.2.1-1: Explain the Principle of Concurrency and Process Synchronization.
Process Synchronization	34	ALO 2.2.1-2: Describe concept of Mutual Exclusion. ALO 2.2.1-3: Explain Critical Section problem and Race conditions
Semaphore and Monitor	12	ALO 2.2.2-1: Define Semaphore and its operations. ALO 2.2.2-2: Classify the Semaphores
	38	ALO 2.2.2-3: Explain each type of Semaphore.
	25	ALO 2.2.2-4: Explain the concept of Monitor.
The producer-consumer problem	22	ALO 2.2.3-1: Describe Producer – Consumer Problem. ALO 2.2.3-2: Explain Reader-writer Problem
The producer-consumer problem	48	ALO 2.2.3-3: Explain Dekker’s Algorithm. ALO 2.2.3-4: Explain Peterson’s Algorithm
Hardware solution to critical section problem	13	ALO 2.2.4-1: Describe Test and Set Instruction.
Hardware solution to critical section problem	15	ALO 2.2.4-2: Explain Swap Instruction.

Week 3

Operating System – Week 3
Week Topics : 8 Active Learning Outcomes : 16	Summary Quiz : 8 Video Play Time : ~6 Hours
Suggested Completion : 2 Topics Per Day

Topic Name	Video Play Time (min)	Learning Outcomes
Classical Synchronization Problems	24	ALO 2.3.1-1: Explain Classical Problem in Concurrency.
	15	ALO 2.3.1-2: Describe Dining-Philosopher problem.
	17	ALO 2.3.1-3: Explain Sleeping-Barber Problem.
CPU Scheduling concept	27	ALO 3.1.1-1: Explain the Concept of Scheduling and Performance Parameters.
CPU Scheduling concept	13	ALO 3.1.1-2: Differentiate between Preemptive and Non-preemptive Scheduling techniques.
Scheduling Algorithm: FCFS &SJF	32	ALO 3.1.2-1: Describe FCFS Algorithm and its Performance.
Scheduling Algorithm: FCFS &SJF	42	ALO 3.1.2-2: Describe SJF Algorithm and its Performance.
Scheduling Algorithm: RR & PRIORITY	33	ALO 3.1.3-1: Describe Round-Robin Algorithm and its Performance.
Scheduling Algorithm: RR & PRIORITY	22	ALO 3.1.3-2: Describe Priority Algorithm and its Performance.
Scheduling Algorithm: MLQ & MLFQ	22	ALO 3.1.4-1: Explain the concept of Multilevel Queue Scheduling and itâ€™s performance.
	16	ALO 3.1.4-2: Explain Multilevel Feedback Queue Scheduling with Performance.
	8	ALO 3.1.4-3: Comparison of all Scheduling Algorithms.
Process Generation & Process Transition Diagram	14	ALO 3.2.1-1: Define Process. ALO 3.2.1-2: Explain Process States Cycle
Schedulers & Process Control Block	31	ALO 3.2.2-1: Explain Scheduler and its type.
Threads and their management	27	ALO 3.2.3-1: Define Thread.
Threads and their management	34	ALO 3.2.3-2: Explain Thread Management. ALO 3.2.3-3: Differentiate between User and Kernel Threads

Week 4

Operating System – Week 4
Week Topics : 4 Active Learning Outcomes : 9	Summary Quiz : 4 Video Play Time : ~4 Hours
Suggested Completion : 1 Topic Per Day

Topic Name	Video Play Time (min)	Learning Outcomes
Deadlock System, Model & its Characteristics	25	ALO 3.3.1-1: Define Deadlock.
Deadlock System, Model & its Characteristics	16	ALO 3.3.1-2: Describe Deadlock Conditions. ALO 3.3.1-3: Explain Deadlock characteristics
Dealing with Deadlock and Deadlock Prevention	11	ALO 3.3.2-1: Explain the various techniques for dealing with Deadlock.
Dealing with Deadlock and Deadlock Prevention	48	ALO 3.3.2-2: Explain Deadlock Prevention methods.
Deadlock Avoidance and Banker’s Algorithm	31	ALO 3.3.3-1: Explain the Deadlock Avoidance Techniques.
	38	ALO 3.3.3-2: Describe Banker’s Algorithm for Single Resource.
	19	ALO 3.3.3-3: Describe Banker’s Algorithm for Multiple Resources.
Deadlock Detection and Recovery	31	ALO 3.3.4-1: Describe Deadlock Detection Techniques.
Deadlock Detection and Recovery	19	ALO 3.3.4-2: Explain the concept of Recovery from Deadlock.

Week 5

Operating System – Week 5
Week Topics : 6 Active Learning Outcomes : 17	Summary Quiz : 6 Video Play Time : ~9 Hours
Suggested Completion : 1 Topic Per Day

Topic Name	Video Play Time (min)	Learning Outcomes
Introduction to Memory Management	23	ALO 4.1.1-1: Recall the need of Memory Management.
	59	ALO 4.1.1-2: Recall the Process creation and loading into the Memory.
	30	ALO 4.1.1-3: Recall Memory Mapping and Protection.
	7	ALO 4.1.1-4: Differentiate between Logical Address and Physical Address.
Memory Management and Allocation Techniques	18	ALO 4.1.2-1: Define and classify Memory Allocation Techniques.
	40	ALO 4.1.2-2: Recall Contiguous Memory Allocation. ALO 4.1.3-3: Recall Fragmentation and itâ€™s types
	37	ALO 4.1.2-4: Recall the Contiguous Memory Allocation strategies.
Paging	17	ALO 4.2.1-1: Define Paging.
Paging	89	ALO 4.2.1-2: Recall the Concept of Paging and Page table.
Issues in Paging	23	ALO 4.2.2-1: Describe Optimal Page Size.
	22	ALO 4.2.2-2: Recall Memory protection in Page environment.
	29	ALO 4.2.2-3: Recall the concept of Translation Look-aside Buffer (TLB)
Multilevel Paging	49	ALO 4.2.3-1: Define Multilevel Paging. ALO 4.2.3-2: Recall the Concept of Multilevel Paging
Multilevel Paging	23	ALO 4.2.3-3: Describe Inverted Page Table.
Segmentation	31	ALO 4.2.4-1: Define Segmentation.
	22	ALO 4.2.4-2: Describe Segmentation with Paging.
	4	ALO 4.2.4-3: Differentiate between Paging and Segmentation.

Week 6

Operating System – Week 6
Week Topics : 3 Active Learning Outcomes : 8	Summary Quiz : 3 Video Play Time : ~2 Hours
Suggested Completion : 1 Topic Per Day

Topic Name	Video Play Time (min)	Learning Outcomes
Virtual Memory	21	ALO 4.3.1-1: Explain the concept of Virtual Memory.
	13	ALO 4.3.1-2: Describe Demand Paging and its Performance.
	12	ALO 4.3.1-3: Describe Page Fault.
Page Replacement Algorithms	17	ALO 4.3.2-1: Describe the concept of Frame Allocation.
	25	ALO 4.3.2-2: Describe Page Replacement Algorithms and explain FCFS.
	20	ALO 4.3.2-3: Explain the Optimal and LRU Techniques of Page Replacement.
Frame Allocation and Thrashing	28	ALO 4.3.3-1: Explain the concept of Thrashing in Page Replacement.
Frame Allocation and Thrashing	12	ALO 4.3.3-2: Describe Working Set Model.

Week 7

Operating System – Week 7
Week Topics : 5 Active Learning Outcomes : 14	Summary Quiz : 5 Video Play Time : ~6 Hours
Suggested Completion : 1 Topic Per Day

Topic Name	Video Play Time (min)	Learning Outcomes
I/O Devices and I/O Subsystems	26	ALO 5.1.1-1: Recall I/O System: Types of I/O, I/O hardware and Goals.
	10	ALO 5.1.1-2: Describe the Applications I/O Interface.
	30	ALO 5.1.1-3: Recall the following terms: kernel I/O subsystem, I/O Buffering, Caching, etc.
	15	ALO 5.1.1-4: Describe Transformation of I/O Request to Hardware Operations.
Interrupt Handler	21	ALO 5.1.2-1: Recall Interrupt Handler.
Interrupt Handler	49	ALO 5.1.2-2: Describe Disk Structure and management.
Disk Scheduling: FCFS & SSTF	20	ALO 5.2.1-1: Recall FCFS Disk Scheduling Technique.
Disk Scheduling: FCFS & SSTF	21	ALO 5.2.1-2: Recall SSTF Disk Scheduling Technique.
Disk Scheduling: SCAN & C-SCAN, LOOK & C-LOOK	29	ALO 5.2.2-1: Recall SCAN and C-SCAN Disk Scheduling Techniques.
	21	ALO 5.2.2-2: Recall LOOK and C-LOOK Disk Scheduling Techniques.
	11	ALO 5.2.2-3: Compare various Disk scheduling Techniques.
Disk Management	24	ALO 5.2.3-1: Recall Swap Space Management.
	40	ALO 5.2.3-2: Recall the following terms: a) Disk Formatting b) Boot Block c) Bad Block
	54	ALO 5.2.3-3: Recall the concept of RAID Structure and Disk Recovery.

Week 8

Operating System – Week 8
Week Topics : 5 Active Learning Outcomes : 15	Summary Quiz : 5 Video Play Time : ~5 Hours
Suggested Completion : 1 Topic Per Day

Topic Name	Video Play Time (min)	Learning Outcomes
File Organization and Access Mechanism	20	ALO 6.1.1-1: Recall File and its various attributes.
	28	ALO 6.1.1-2: Describe the File extensions and various Operations Performed on Files.
	13	ALO 6.1.1-3: Recall File access methods.
	8	ALO 6.1.1-4: Describe the concept of Memory Mapped Files.
File Directories and File Sharing	23	ALO 6.1.2-1: Recall various File Allocation methods Contiguous Memory Allocation, Linked List Allocation, and Indexed Allocation.
File Directories and File Sharing	23	ALO 6.1.2-2: Explain File system Architecture of Operating System.
File Allocation Methods and File System Architecture	41	ALO 6.1.3-1B: Recall File Directories and itâ€™s Operations.
	35	ALO 6.1.3-1A: Recall File Directories and itâ€™s Operations.
	21	ALO 6.1.3-2: Describe various Directory Structures and the concept of File Sharing.
System Protection	15	ALO 6.2.1-1: Define Protection.
	15	ALO 6.2.1-2: Recall Goals and Domains of Protection.
	12	ALO 6.2.1-3: Describe Access Matrix, Access control list, and ways of implementing it.
Security Threats	10	ALO 6.2.2-1: Describe Security and Security Problem.
	17	ALO 6.2.2-2: Define Program and System Threats.
	27	ALO 6.2.2-3: Recall the Threat Monitoring with the concept of Encryption and Authentication.