Persistent Previous Years Solved Sample Placement Papers
-
The fastest type of memory is:
- a) tape
- b) semiconductor memory (Ans)
- c) disk
- d) bubble memory
-
Which of the following statements is wrong:
- a) magnetic core memory, RAMs, and ROMs have constant access time
- b) magnetic tape is non-volatile
- c) semiconductor memories are used as mass memory medium (Ans)
- d) An EPROM can be programmed, erased, and reprogrammed by the user with an EPROM programming instrument
-
The memory which is programmed at the time it is manufactured is:
- a) ROM (Ans)
- b) RAM
- c) PROM
- d) EPROM
-
Which memory is non-volatile and may be written only once:
- a) RAM
- b) EE-PROM
- c) EPROM
- d) PROM (Ans)
-
In magnetic disks, data is organized on the platter in a concentric set of rings called:
- a) sector
- b) track (Ans)
- c) head
- d) block
-
When we move from the outermost track to the innermost track in a magnetic disk, the density:
- a) increases (Ans)
- b) decreases
- c) remains the same
- d) either remains constant or decreases
- Which is not object oriented concept?
A) Inheritance
B) Polymorphism
C) Class
D) Variable
Ans: D) Variable - The operator that releases previously allocated memory is ___
A) release
B) return
C) new
D) delete
Ans: D) delete -
A typical modern computer uses:
- a) magnetic cores for secondary storage
- b) LSI chips (Ans)
- c) magnetic tape for primary memory
- d) more than 10,000 vacuum tubes
- A parentheses checker program would be best implemented using ____
a) List
b) Queue
c) Stack
d) Any of the above
Answer: c) Stack - To perform level-order traversal on a binary tree, which of the following data structure will be required?
a) Hash table
b) Queue
c) Binary search tree
d) Stack
Answer: b) Queue - Which of the following data structure is required to convert arithmetic expression in infix to its equivalent postfix notation?
a) Queue
b) Linked list
c) Binary search tree
d) None of the above
Answer: d) None of the above - A binary tree in which all its levels except the last, have maximum numbers of nodes, and all the nodes in the last level have only one child, it will be its left child. Name the tree.
a) Threaded tree
b) Complete binary tree
c) M-way search tree
d) Full binary tree
Answer: b) Complete binary tree - Which of the following data structure is more appropriate for implementing quick sort iteratively?
a) Deque
b) Queue
c) Stack
d) Priority queue
Answer: c) Stack - The number of edges in a complete graph of n vertices is ____
a) n(n+1)/2
b) n(n-1)/2
c) n²/2
d) n
Answer: b) n(n-1)/2 - If two trees have the same structure but different node content, then they are called ____
a) Synonyms trees
b) Joint trees
c) Equivalent trees
d) Similar trees
Answer: d) Similar trees