3_Operating System
Detailed Notes:
Definition: OS is system software that manages hardware, software, and user interaction.
Functions:
o Process Management: CPU scheduling, multitasking
o Memory Management: Paging, Segmentation, Virtual Memory
o File System Management: File creation, deletion, access control
o Device Management: Input/output device coordination
o Security & Access Control
Types of OS:
o Batch OS
o Time-Sharing OS
o Distributed OS
o Real-Time OS
Process States: New → Ready → Running → Waiting → Terminated
Scheduling Algorithms: FCFS, SJF, Round Robin, Priority
Memory Management:
o Contiguous Allocation
o Paging
o Segmentation
Summary / Key Points
OS is the interface between user and hardware
Handles processes, memory, files, and devices
Scheduling ensures CPU efficiency
Types include Batch, Time-Sharing, Distributed, Real-Time
MCQs (Moderate Level)
1. Which OS component manages hardware?
Answer: Kernel
2. Paging is used in which type of memory management?
Answer: Virtual Memory
3. Which scheduling algorithm is non-preemptive?
Answer: FCFS
4. Real-Time OS is used for ______ applications.
Answer: Time-critical
5. Which process state indicates completion?
Answer: Terminated
6. Device management is done by ______.
Answer: OS
7. File allocation table (FAT) is related to?
Answer: File system
8. Round Robin scheduling uses ______.
Answer: Time quantum
9. Multitasking OS allows?
Answer: Multiple processes simultaneously
10. Segmentation divides memory based on ______.
Answer: Logical segments
04_DBMS (Database Management System)
Detailed Notes:
Definition: DBMS is software to store, manage, and retrieve data efficiently.
Components: DB Engine, DB Schema, Query Processor, Transaction Manager
Database Models:
o Hierarchical
o Network
o Relational (most common)
o Object-Oriented
Normalization:
o 1NF: Atomic values
o 2NF: No partial dependency
o 3NF: No transitive dependency
SQL Basics:
o DDL: CREATE, ALTER, DROP
o DML: INSERT, UPDATE, DELETE
o SELECT queries with JOINs, GROUP BY, ORDER BY
ER Model: Entity, Attribute, Relationship
Summary / Key Points
DBMS stores and manages data efficiently
Relational DBMS uses tables
Normalization reduces redundancy
SQL is used to query and manipulate data
MCQs (Moderate Level)
1. Primary key cannot be ______.
Answer: NULL
2. Which command deletes records?
Answer: DELETE
3. 2NF eliminates?
Answer: Partial dependency
4. JOIN is used to?
Answer: Combine tables
5. DDL commands include?
Answer: CREATE, ALTER, DROP
6. ER model defines ______.
Answer: Entities and relationships
7. Which DBMS model is most common?
Answer: Relational
8. SQL statement to modify data?
Answer: UPDATE
9. Foreign key establishes?
Answer: Relationship between tables
10. 3NF ensures?
Answer: No transitive dependency
05_Data Structures & Algorithms
Detailed Notes:
Definition: Data Structure = way to store data; Algorithm = step-by-step procedure to solve a problem.
Linear DS: Array, Linked List, Stack, Queue
Non-linear DS: Tree, Graph
Stack Operations: Push, Pop, Peek (LIFO)
Queue Types: Simple, Circular, Priority, Dequeue (FIFO)
Tree Traversals: Preorder, Inorder, Postorder
Sorting Algorithms: Bubble, Selection, Insertion, Quick, Merge
Searching Algorithms: Linear Search, Binary Search
Summary / Key Points
Arrays and Linked Lists are linear
Stack = LIFO, Queue = FIFO
Trees have root, nodes, leaves
Sorting and searching are basic algorithm operations
MCQs (Moderate Level)
1. Stack follows which principle?
Answer: LIFO
2. Queue follows which principle?
Answer: FIFO
3. Which search is faster for sorted arrays?
Answer: Binary Search
4. Preorder traversal visits nodes in which order?
Answer: Root → Left → Right
5. Circular queue overcomes problem of ______.
Answer: Memory wastage in simple queue
6. Which sorting is divide-and-conquer?
Answer: Quick Sort
7. Linked List is better than array for ______.
Answer: Frequent insertions/deletions
8. In a binary tree, max children per node?
Answer: 2
9. Linear search time complexity?
Answer: O(n)
10. Merge Sort best for ______ arrays.
Answer: Large arrays