Terms & Conditions
Contact

Home
GK
Computer
TRB
TNPSC
Aptitude
English
Reasoning
Technical
Bank Exams
SSC
Engineering
Puzzles
Interview
- GD Topics
Blogs
Online Test

Free computer quiz Online Test - MeritNotes

Home
Online Exam

No. of Questions :10

Remaining Time :

1. Which of the following data structures are indexed structures?

(a) trees
(b) graphs
(c) linear arrays
(d) linked lists

2. The number of comparisons made my algorithm is given by

(a) O(n*log₂n)
(b) 0(n)
(c) O(n)²
(d) O(n)³

3. Binary trees with threads are called as

(a) special pointer trees
(b) special trees
(c) pointer trees
(d) threaded trees

4. The command used to change contents of one database using the contents of another database by linking them on a common key field

(a) update
(b) change
(c) replace
(d) join

5. The name of a function ends with

(a) double quotes
(b) parentheses
(c) single quotes
(d) #

6. Which of the following statements about a binary tree is correct?

(a)
No binary tree is both complete and full
(b)
Every full binary tree is also a complete binary tree
(c)
Every complete binary tree is also a full binary tree
(d)
Every binary tree is either complete or full

7. What is the worst-case time for binary search finding a single item in an array?

(a)
Quadratic time
(b)
Linear time
(c)
Logarithmic time
(d)
Constant time

8. With an array-based stack, the algorithm for push is

(a)
Increment top and add item to the new top location
(b)
Add item to the top location and then increment top
(c)
Return the top item and increment top
(d)
Return the top item and decrement top

9. If a binary tree satisfies shape and order property, it is known as

(a)
Rooted tree
(b)
Heap
(c)
Sequential search tree
(d)
Binary search tree

10. Name the tree in which, for every node, the height of left sub tree and height of right sub tree can differ by at most one

(a)
AVL tree
(b)
B-tree
(c)
Threaded tree
(d)
Complete tree

Home

Terms & Conditions

Contact

2024 © MeritNotes