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

1. The organised collection of data is called a

A. record structure
B. file structure
C. data structure
D. None of these

2. ____ are basic building block for more complex data structures

A. files
B. arrays
C. records
D. None of these

3. Data structure can be classified as

A. linear and non linear data structure
B. static and dynamic structure
C. both (A) and (B)
D. None of these

4. An array is homogenous structure in which all

A. element are of same type
B. element are of different type
C. both (A) and (B)
D. None of these

5. The example of non-homogeneous data structure are

A. records
B. files
C. data
D. None of these

6. ____ is called the first element of linked list

A. head
B. tail
C. both (A) and (B)
D. None of these

7. ____ is called the last element of linked list

A. head 
B. tail
C. both (A) and (B)
D. None of these

8. ______ is called the next element to the head of linked list

A. predecessor
B. Successor
C. head
D. tail

9. ______ is called the previous element to the tail of linked list

A. predecessor
B. Successor
C. head
D. tail

10. We can traverse the singly linked list in

A. only one direction
B. two direction
C. sometime (A) or (B) (
D. None of these

1. Object Oriented Programming gives the concept of

A. data abstraction,inheritance and polymorphism
B. data abstraction,inheritance and array
C. data abstraction,inheritance and I/O
D. None of these

2. C++ allow multiple functions with in single class, Known by the number and type of arguments is called

A. overloading
B. constructor
C. distructor
D. struct

3. C++ does not have

A. constructor
B. garbage collector I/O
C. distructor
D. struct

4. A constructor and distructor of C++ simply

A. insert object
B. initialise and free object memory
C. both (A) and (B)
D. None of these

5. C++ provide

A. flexibility in memory allocation
B. a complete control on allocation and creation of objects
C. both (A) and (B)
D. None of these

6. The default constructor is a constructor that takes

A. no arguments
B. one arguments
C. two arguments
D. None of these

7. In C++ comment is represented as

A. /
B. //
C. /* */
D. None of these

8. In C++  "<<" operator is known as

A. an insertion operator
B. put to operator
C. either (A) or (B)
D. None of these

9. In C++  ">>" operator is known as

A. an extraction operator
B. a get from operator
C. either (A) or (B)
D. None of these

10. What is reference

A. an operator
B. used to rename an object
C. a reference is an alias for an object
D. None of these

1. BY _____ signal CPU suspend the current execution and divert to the request process

A. Switch
B. Interrupt
C. End
D. Suspend

2. Which is the element of cache

A. Cache size and Block size
B. Mapping function
C. Replacement algorithm
D. All of the above

3. Select the valid I/O communication technique

A. Direct memory access
B. Interrupt driven I/O
C. Programmed I/O
D. All of the above

4. In multi-programming environment the main memory consist of _____ number of process

A. >500
B. >100
C. only one
D. more than one

5. At the time of execution a program is called

A. A Process
B. Dynamic program
C. Static program
D. Program binding

6. A technique in which a process executing an application is divided into threads that can run concurrently is called

A. Dynamic threading
B. Static threading
C. Multi threading
D. All the above

7. Operating system that provide the distributed file system is called

A. Distributed operating system
B. Multi operating system
C. uni Operating system
D. Dual operating system

8. GUI means

A. Geographical user interface
B. Graphical user interface
C. Graphical user interconnection
D. None of these

9. _____ convert high level language to low level language

A. Compiler
B. Assembler
C. Interpreter
D. None of these

10. When an interrupt occurs the operating system

A. Always changes state of interrupted process after processing the interrupt
B. Ignores the interrupt
C. Always resumes execution of interrupted process after processing the interrupt
D. None of these

1. Which is not an operating system

A. Wndows 2000
B. Windows 95
C. MS-Dos
D.   Windows 2-1

2. The functions of operating system are

A. Resource allocator
B. Control Program
C. Creates user friendly environment
D. All of the above

3. It is not layer of operating system

A. Kernel
B. Shell
C. Application programs
D. Critical section

4. Data stores temporarily in _____

A. heap
B. Buffer
C. register
D. None of these

5. ______ increases the cpu through put

A. Multi programming
B. Multi tasking
C. Time sharing jobs
D. All the above

6. Choose which is the type of system call

A. Program execution
B. File manipulation
C. Accounting
D. Protection

7. Which is the services of operating system

A.    Program execution and I/O operation 
B. File manipulation and Error detection
C. Information maintenance and Protection
D. Job control system call and Resource allocation

8. ______ is the interface between H/W and shell

A. CPU
B. Processor
C. Kernel
D. Cache

9. ________ is the interface between kernel and user programs

A. Processor
B. Shell
C.    Critical section
D. None of these

10. ______ is a collection of related information

A. File
B. Folder
C. Program
D. None of these

1. Which of the following process is faster for threaded trees compared with their unthreaded

A. Insertion
B. Traversal
C. Deletion
D. None of these

2. Inorder traversal of the binary search tree implies visiting records

A. the order of increasing magnitude of their key
B. the order of decreasing magnitude of their key
C. Arbitrary order
D. None of these

3. Level of any node of a tree is

A. its distance from the root
B. height of its left subtree minus height of its right subtree
C. height of its right subtree minus height of its left subtree
D. None of these

4. A dynamic data structure where we can search for desired records in Bigo(log n) time is

A. heap
B. array
C. circular link list
D. binary search tree

5. How many cycles must be contained in a tree

A. one
B. zero
C. at least one
D. two

6. The maximum number of nodes in a binary tree of depth 5 is

A. 31
B. 16
C. 32
D. 15

7. Post order traversal of a binary tree starts with

A. Processing of the root node 
B. Postorder traversal of the left subtree
C. Postorder traversal of the right subtree
D. None of these

8. Number of all posible binary trees with 4 nodes is

A. 34
B. 14
C. 24
D. None of these

9. A tree where each node have ____ children is called binary tree

A. 3
B. 2
C. 4
D. None of these

10. Which of the following steps is performed first for inorder traversal of a binary tree

A. Traversal of the left subtree in postorder
B. Processing of the root node
C. Traversal of the left sub tree in inorder
D. None of these