PAPER 1
Group A (1×10=10)
1. What is multi-tasking OS?
A multitasking operating system allows multiple processes to run
simultaneously by sharing CPU time and system resources.
2. Define throughput.
Throughput refers to the number of processes completed by a system within a
given time frame.
3. What is race condition?
A race condition occurs when multiple processes access shared resources
concurrently, leading to unpredictable behavior if synchronization is not
managed.
4. State the difference between binary semaphore and counting semaphore.
o Binary semaphore: Can take only two values (0 or 1) and is used for
mutual exclusion.
o Counting semaphore: Can take a range of values and is used to manage
multiple resources.
5. How can a deadlock be detected?
Deadlock can be detected by maintaining a resource allocation graph and
checking for cycles. If a cycle exists, a deadlock is present.
6. What is the primary purpose of a DBMS?
The primary purpose of a DBMS is to provide efficient, reliable, and secure data
storage, retrieval, and management.
7. Define the term normalization in database design.
Normalization is the process of organizing a database to reduce redundancy and
dependency by dividing tables into smaller related tables.
8. What are the ACID properties of a transaction in DBMS?
o Atomicity: Ensures all operations of a transaction are completed or none.
o Consistency: Guarantees the database remains in a valid state after a
transaction.
o Isolation: Ensures concurrent transactions do not interfere with each
other.
o Durability: Ensures changes persist even after a system failure.
9. Differentiate between primary key and foreign key.
o Primary key: A unique identifier for each record in a table.
o Foreign key: A field in a table that references the primary key in another
table to establish a relationship.
10. What is the difference between SQL and NoSQL databases?
o SQL: Structured, relational databases using a fixed schema.
o NoSQL: Non-relational, schema-less databases designed for scalability
and flexibility.
Group B (5×3=15)
1. Discuss the architecture of a DBMS, including its components.
The architecture of a DBMS includes:
o Database Engine: Manages data storage, retrieval, and updates.
o Query Processor: Interprets and executes queries.
o Storage Manager: Handles disk space, data structures, and file
management.
o Transaction Manager: Ensures ACID properties are maintained.
o User Interface: Allows interaction with the DBMS.
2. Describe the ACID properties of transactions in DBMS and their importance.
o Atomicity ensures all operations succeed or fail together, preventing
partial updates.
o Consistency maintains database integrity.
o Isolation prevents conflicts between concurrent transactions.
o Durability ensures data changes are saved despite crashes, enhancing
reliability.
3. Page Replacement Algorithms:
Reference String: 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1
Frame Size = 3
o FIFO (First-In-First-Out): Calculate by replacing the oldest page first.
o Optimal: Replace the page not needed for the longest time.
o LRU (Least Recently Used): Replace the page least recently accessed.
Group C (15×3=45)
4. Scheduling Algorithms:
Processes:
5. P1: 35 ms
6. P2: 6 ms
7. P3: 7 ms
o FCFS (First-Come-First-Serve):
Gantt Chart: P1 → P2 → P3
Average Turnaround Time: Calculate by adding completion times of all
processes and dividing by 3.
o SJF (Shortest Job First):
Gantt Chart: P2 → P3 → P1
Average Turnaround Time: Same approach as above.
8. Normalization:
o Objective: Reduce redundancy, improve data integrity, and optimize query
performance.
o Normal Forms:
▪ 1NF: Eliminate duplicate columns.
▪ 2NF: Eliminate partial dependencies.
▪ 3NF: Remove transitive dependencies.
9. Relational Algebra Operations:
o Selection (σ): Retrieves rows meeting a condition.
o Projection (π): Retrieves specific columns.
o Set Operations:
▪ Union: Combines two tables.
▪ Intersection: Finds common rows.
▪ Difference: Finds rows in one table but not the other.
PAPER 2
Group A (1×10=10)
1. What is Batch systems OS?
A batch operating system processes jobs in batches without user interaction.
Jobs are queued, and the system executes them sequentially.
2. What is the job of PCB?
A Process Control Block (PCB) stores information about a process, including
process ID, state, priority, CPU registers, memory allocation, and I/O status.
3. What do you mean by fixed memory partitioning?
Fixed memory partitioning divides memory into fixed-sized partitions, where
each partition can hold one process. It leads to internal fragmentation.
4. State the difference between binary semaphore and counting semaphore.
o Binary semaphore: Has values 0 or 1, used for mutual exclusion.
o Counting semaphore: Can have any non-negative value, used for
managing resources.
5. How can the deadlock be avoided?
Deadlock can be avoided by:
o Preventing circular wait.
o Allocating resources using the Banker’s Algorithm.
o Ensuring at least one of the deadlock conditions is not met.
6. What is the primary purpose of DBMS?
To efficiently manage, store, retrieve, and manipulate data in a secure and
reliable manner.
7. Define the term functional dependency with example.
A functional dependency occurs when one attribute uniquely determines
another.
Example: In a table with attributes (A, B), if A → B, then B is functionally
dependent on A.
8. What are the ACID properties of a transaction in DBMS?
o Atomicity: Ensures all operations succeed or none.
o Consistency: Guarantees database integrity.
o Isolation: Transactions do not interfere with each other.
o Durability: Ensures data is saved even after system failure.
9. Differentiate between super key and candidate key.
o Super key: Any set of attributes that uniquely identify a row in a table.
o Candidate key: Minimal subset of a super key with no redundant
attributes.
10. Describe C-Scan disk scheduling algorithm.
C-Scan (Circular Scan) serves requests in one direction, then jumps to the
beginning of the disk to continue. It ensures uniform wait time for requests.
Group B (5×3=15)
1. Describe the different types of relationships in an ER model.
o One-to-One (1:1): One entity instance relates to one instance of another
entity.
o One-to-Many (1:N): One entity instance relates to many instances of
another entity.
o Many-to-Many (M:N): Many instances of one entity relate to many
instances of another.
2. State and explain necessary conditions for a deadlock situation.
o Mutual Exclusion: At least one resource must be non-shareable.
o Hold and Wait: A process holding resources is waiting for additional
resources.
o No Preemption: Resources cannot be forcibly taken from a process.
o Circular Wait: A closed chain of processes exists, each holding a
resource the next needs.
3. What is the difference between entity integrity and referential integrity?
o Entity Integrity: Ensures a table’s primary key is unique and not null.
o Referential Integrity: Ensures foreign keys correctly reference primary
keys in related tables.
Example: A "StudentID" in the "Enrollment" table must exist in the
"Students" table.
Group C (15×3=45)
4. Design an ER diagram for a Library Management System:
Entities:
o Books: Attributes include BookID, Title, Author, ISBN.
o Members: Attributes include MemberID, Name, Address.
o BorrowTransactions: Attributes include TransactionID, BorrowDate,
ReturnDate.
Relationships:
o Members borrow Books (One-to-Many).
o BorrowTransactions involve Books and Members (Many-to-One).
(ER diagram not provided here but can be drawn as requested.)
5. Relational Algebra and SQL Query:
Relations:
o Student(SID, Name, Age, Major)
o Enrollment(SID, CourseID, Grade)
(i) Relational Algebra:
σ CourseID = 'CS101'(Enrollment) ⨝ Student
Result size: 200 rows.
(ii) Students aged above 20:
σ Age > 20(Student)
Result size: 300 rows.
6. Scheduling Algorithms (SJF, SRTF):
Processes:
7. P1: Arrival=0, Burst=8
8. P2: Arrival=1, Burst=4
9. P3: Arrival=2, Burst=9
10. P4: Arrival=3, Burst=5
o Gantt Chart (SJF): Shortest remaining job first is considered.
o Metrics Calculation: Average Waiting Time, Turnaround Time, and
Response Time.
