# Data Structure Questions Answers - Chapter 1

Data Structure Questions Answers Chapter - 1 (mcq) listings are important for IBPS IT Officer Aptitude exam and other technical interviews and exams.

1) The complexity of merge sort algorithm

• 1) O(n)
• 2) O(log n)
• 3) O(n2)
• 4) O(n log n)
Ans.   D
Explanation :

2) How many divisions are there in COBOL langu

• 1) Two
• 2) Three
• 3) Four
• 4) Five
Ans.   C
Explanation :

3) O log(n) can be conneted wi

• 1) Selection sort
• 2) Insertion sort
• 3) Binary sort
• 4) Merge sort
Ans.   C
Explanation :

4) Which of the languages is often translated to the pseudo c

• 1) PASCAL
• 2) FORTRAN
• 3) PL/I
• 4) BASIC
Ans.   A
Explanation :

5) Merge sort u

• 1) Divide and conquer strategy
• 2) Backtracking approach
• 3) Heuristic search
• 4) Greedy approach
Ans.   A
Explanation :

6) Which is having highest precedence i

• 1) relational operators
• 2) equality operator
• 3) logical operator
• 4) arithmetic operator
Ans.   D
Explanation :

7) Which sorting method is slow

• 1) Quick sort
• 2) Heap sort
• 3) Shell sort
• 4) Bubble sort
Ans.   D
Explanation :

8) Which data structure is needed to convert infix notations to postfix notati

• 1) linear list
• 2) tree
• 3) stack
• 4) queue
Ans.   C
Explanation :

9) A graph with one or more edges is at le

• 1) 1-chromatic
• 2) 2-chromatic
• 3) 3-chromatic
• 4) 4-chromatic
Ans.   B
Explanation :

10) The memory address of the first element of an array is cal