Model Exam: Cs1203 - System Software
Model Exam: Cs1203 - System Software
Model Exam: Cs1203 - System Software
MODEL EXAM
MAXIMUM MARKS: 100 TIME DURATION: 3 Hrs
Part-A 2*10=20
Part-B 16*5=80
3. a) State and Explain the algorithm for one pass macro processor. (8)
(or)
b) i) Explain recursive Macro expansion in detail. (8)
ii) Define concatenation of macro parameters. (8)
4. a) With neat diagram , explain the different components of an editor structure. (16)
(or)
b) How are interfaces are useful? Explain. (16)
Part-A 2*5=10
Part-B 16*5=40
Part-A 2*5=10
1. Define DBMS.
2. What is data abstraction?
3. Write the application of DBMS
4. What is instance and schema?
5. What are the instruction execution steps in hardware-based speculation?
Part-B 8*5=10
6. Explain in detail about Data models.
7. Explain database system structure
8. Explain in detail about extended ER features.
9. Write short notes on the following.
a. Constraints
b. Keys
c. Weak Entity sets
10. Explain in detail about ER diagram. Give the ER diagram for banking Enterprise.
S.K.R Engineering College
Department of Computer Science and Engineering
Internal Test-I
Part-A 2*5=10
11. Define DBMS.
12. What is data abstraction?
13. Write the application of DBMS
14. What is instance and schema?
15. What are the instruction execution steps in hardware-based speculation?
Part-B 8*5=10
16. Explain in detail about Data models.
17. Explain database system structure
18. Explain in detail about extended ER features.
19. Write short notes on the following.
d. Constraints
e. Keys
f. Weak Entity sets
20. Explain in detail about ER diagram. Give the ER diagram for banking Enterprise.
S.K.R Engineering College
Department of Computer Science and Engineering
Internal Test-III
Semester : V Time: 100 minutes
Subject Name: Database Management Systems Date: 06/10/06
Part-A 2*5=10
1. Define functional dependency
2. What is heap file?
3. Define transaction.
4. Draw the structure of a typical node of a B+ tree and explain briefly.
5. Stat the various pitfalls in relational database.
Part-B 8*5=40
6. State the goal of decomposition /normalization .Explain the level of normalization
with example. (8)
7. What is hashing technique? Explain the hash file organization (8)
8. Write short notes on the following.
a. Heap files (4)
b. Sorted file (4)
Part-A 2*5=10
1. What is a absolute loader?
2. What is the function of linkage editor?
3. What is a linking loader?
4. List out any two loader options with example.
5. Mention the usage of the directory by a loader.
Part-B
1. Explain the issues related to a loader.
a. Relocation (6)
b. Program linking (6) (12)
2. Explain the machine independent features of loader (8)
3. Explain the algorithm and data structures of a linking loader. (12)
4. What is bootstrap loader? Explain. (8)
-All the Best-