1. In operating ___ system software is responsible to reside program into memory

A. Linker
B. Loder
C. Compiler
D. Assembler

2. The primary aim of an operating system is

A. to make computer easier
B. to allow people to use the computer
C. to make efficient use of computer H/W
D. to keep programming easy

3. The operating system manages

A. Memory
B. Processor
C. Disk and I/O devices
D. All of the above

4. Multiprogramming system

A. An easier to develop than single programming systems.
B. Execute each job faster.
C. Execute more jobs in the same time.
D. uses more than one CPUs

5. Real time system are

A. Primarily used on mainframe computers.
B. used for monitoring events as they are occur
C. used for programming development
D. use for real time interactive users.

6. Cryptography technique is used in

A. job scheduling
B. Protection
C. file management
D. None of these

7. Which of the following file name extension suggests that the file is Backup copy of another file

A. txt
B. com
C. bat
D. bak

8. Which of the following is not application software

A. word-processing
B. Spread sheet
C. unix
D. desktop publishing

9. What is the name given to all programs inside the computer which make it useful

A. Application Software
B. System software
C. Firmware
D. share ware

10. The operating system of a computer serves as a software interface between the user and

A. hardware
B. peripheral
C. Memory
D. screen

1. Trees are useful in computer science such as

A. compiler construction
B. database design window
C. operating system programs etc
D. All the above

2. A special case of binary tree is called a 2-tree or a

A. ordinary binary tree
B. specially binary tree
C. strictly binary tree
D. None of these

3. We use graphs as models of practical situations involving

A. routers
B. electric circuit
C. transportation
D. All the above

4. Queues are employed in many situations such as

A. car waiting at the service station
B. vehicle waiting at a crossing
C. customers in a check-out line at a departmental store
D. All the above

5. The term node is used to designate

A. a unit of storage space
B. data
C. an item
D. address

6. Small nodes improve

A. much space is not waste
B. flexibility
C. Both (A) and (B)
D. No effect

7. List of several data structure

A.    cannot share same place 
B. can share same place
C. do not provide flexibility and sharing of same place
D. None of these

8. List like arrays are used to store

A. ordered data
B. input data
C. current data
D. processed data

9. A list can be implemented static or dynamic using

A. pointers
B. an array index
C. Both (A) and (B) respectively
D. None of these

10. An algorithm choose an execution path depending

A. on the set of data values (Input)
B. on the set of data values (output)
C. Both (A) and (B) 
D. None of these

1. We can say that Garbage collection is

A. when some programme runs out of space
B. when two program run out of space
C. when three program run out of space
D. None of these

2. Fragmentation means

A. splitting
B. sampling
C. spotting
D. None of these

3. The open end of stack is called

A. bottom of the stack
B. top of the stack
C. head of the stack
D. None of these

4. The insertion and deletion operation for a stack is called

A. push and pop respectively
B. pop and push respectively
C. head and tail respectively
D. None of these

5. The simplest way to represent a stack is by using

A. one dimension array
B. two dimension array
C. multi dimension array
D. None of these

6. The another approach for implementing queues is by using the

A. dynamic storage allocation through the use of pointers
B. sequential storage allocation through the use of stacks
C. tree
D. None of these

7. In queue items are managed by

A. front and rare 
B. top and bottom
C. middle of queue
D. None of these

8. A set of tree is known as

A. nodes
B. graph
C. forest
D. None of these

9. sometimes nonterminal nodes are refered to as

A. internal nodes
B. external nodes
C. both (A) and (B)
D. None of these

10. Sometimes terminal nodes are referred as

A. internal nodes
B. external nodes
C. internal and external nodes
D. None of these