IT Officer Questions | Basic Computer Knowledge

1.

_____ contains the information about an array used in a program.

   A.) Dope vector
   B.) Record
   C.) Table
   D.) None of these

Answer: Option 'A'

Dope vector

2.

A sort that compares each element with its adjacent element in a list is called _______

   A.) Insertion Sort
   B.) Bubble Sort
   C.) Quick Sort
   D.) Heap Sort

Answer: Option 'B'

Bubble Sort

3.

The term DEQUE refers _______

   A.) single ended queue
   B.) double ended queue
   C.) Both (A) & (B)
   D.) None of these

Answer: Option 'B'

double ended queue

4.

Which of the following data structure is required to evaluate a post fix expression?

   A.) Stack
   B.) linked list
   C.) Array
   D.) None of these

Answer: Option 'A'

​Stack

5.

A matrix in which number of zero elements are much higher than the number of non zero elements is called

   A.) Scalar Matrix
   B.) Identity Matrix
   C.) Sparse Matrix
   D.) None of these

Answer: Option 'C'

​Sparse Matrix

6.

In order traversal is also known as _______

   A.) Pre order
   B.) Symmetric order
   C.) End order
   D.) None of these

Answer: Option 'B'

​Symmetric order

7.

Which data structure is required to check balanced parenthesis in an expression?

   A.) Linked List
   B.) Queue
   C.) Stack
   D.) Tree

Answer: Option 'C'

​Stack

8.

The smallest element of an Array’s index is known as _______

   A.) Range
   B.) Upper bound
   C.) Lower bound
   D.) None of these

Answer: Option 'C'

​Lower bound

9.

A linked list that has no beginning and no end is called _______

   A.) Doubly linked list
   B.) Singly linked list
   C.) Circular linked list
   D.) None of these

Answer: Option 'C'

Circular linked list

10.

Rows of a relation are called ________

   A.) entity
   B.) degree
   C.) tuples
   D.) None of these

Answer: Option 'C'

tuples


IT Officer Questions Download Pdf

Recent Posts