JavaScript isn't enabled in your browser, so this file can't be opened. Enable and reload.
Mock Exam # 155 : Model Exam Part - II
Model Exam Part - II
Question: 11 to 20
* Indicates required question
Email
*
Your email
11. Method that allows an input/output (I/O) device to send or receive data directly to or from the main memory, by passing the CPU to speed up memory operations.
1 point
a) Caching
b) Buffering
c) Direct Memory Access
d) Parallel Memory Access
Clear selection
12. A Compact Disk made of ________ layers
1 point
a) Two
b) Three
c) Four
d) Only one
Clear selection
13. High Speed in ECL is possible because transistors are used in difference amplifier configuration, in which they are never driven into ...............
1 point
a) Race condition
b) Saturation
c) Delay
d) High impedance
Clear selection
14) 1 GB is equal to
1 point
a) 2^30 bits
b) 2^30 bytes
c) 2^20 bits
d) 2^20 bytes
Clear selection
15. The depth of a complete binary tree is given by
1 point
a) Dn = n log2n
b) Dn = n log2n+1
c) Dn = log2n
d) Dn = log2n+1
Clear selection
16) When converting binary tree into extended binary tree, all the original nodes in binary tree are
1 point
a) internal nodes on extended tree
b) external nodes on extended tree
c) vanished on extended tree
d) None of above
Clear selection
17) Which of the following sorting algorithm is of divide-and-conquer type?
1 point
a) Bubble sort
b) Insertion sort
c) Quick sort
d) All of above
Clear selection
18) Which of the following data structure can't store the non-homogeneous data elements?
1 point
a) Arrays
b) Records
c) Pointers
d) None
Clear selection
19) Best time complexity of Heap sort is
1 point
a)O(n log(n))
b)O(n)
c)O(n^2)
d)O(log n )
Clear selection
20) Two main measures for the efficiency of an algorithm are
1 point
a) Processor and memory
b) Complexity and capacity
c) Time and space
d) Data and space
Clear selection
Submit
Clear form
This content is neither created nor endorsed by Google.
Report Abuse
-
Terms of Service
-
Privacy Policy
Forms
