Data Structure Questions & Answers (Compiled from UPSC, SSC ,PSC ,IBPS previous question papers)

Which of the following statement is false
Pointers are very useful.
Pointers store the next data element of a list
Data elements in linked lists need not be stored in adjacent space in memory
Linked lists are collection of the nodes that contain information part and next pointer.
Arrays are dense lists and static data structure.

What are the minimum number of queues needed to implement the priority queue?
One
Two
Three
Four

The complexity of merge sort algorithm is
O(n)
O(log n)
O(n2)
O(n log n)

The complexity of Bubble sort algorithm is
O(n)
O(log n)
O(n2)
O(n log n)

The complexity of Binary search algorithm is
O(n)
O(log n)
O(n2)
O(n log n)

The complexity of linear search algorithm is
O(n)
O(log n)
O(n2)
O(n log n)

Which of the following data structure is linear data structure
Trees
Graphs
Array
None of above

Which of the following name does not relate to stacks
FIFO lists
LIFO list
Piles
Push-down lists

The memory address of the first element of an array is called
floor address
first address
foundation address
base address

A graph with one or more edges is at least
1-chromatic
2-chromatic
3-chromatic
4-chromatic

Which data structure is needed to convert infix notations to postfix notations
linear list
tree
stack
queue

Which sorting method is slowest
Quick sort
Heap sort
Shell sort
Bubble sort

Which is having highest precedence in C
relational operators
equality operator
logical operator
arithmetic operator

Merge sort uses
Divide and conquer strategy
Backtracking approach
Heuristic search
Greedy approach

Which of the languages is often translated to the pseudo code
PASCAL
FORTRAN
PL/I
BASIC

O log(n) can be conneted with
Selection sort
Insertion sort
Binary sort
Merge sort

How many divisions are there in COBOL language
Two
Three
Four
Five

Which is ALGOL based simulation language
FORTRAN
SIMSCRIPT
GASP IV
none of above

A linear list from which elements can be added or removed from either end is called
stack
queue
deque
tree

Recursive problems are implemented by
queues
stacks
linked lists
strings

Recursive problems are implemented by
queues
stacks
linked lists
strings

Sort which compares adjacent elements in a list and switches where necessary is
Insertion sort
Heap sort
Quick sort
Bubble sort

Which is problem oriented language
BASIC
PL/I
FORTRAN
none of above

minimum number of stacks of size n required to implement a queue of size n
One
Two
Three
Four

In C how many parameters can passed to a function
2
5
10
as many as defined in function definition

Which statement we should ignore in structure programming
WHILE-DO
GO-TO
IT-ELSE
SWITCH

Deletion from one end and insertion from other end is
stack
branch
tree
queue

Repeated execution of simple computation may cause compounding of
round off errors
syntax errors
run time errors
logic errors

++i is equivalent to
i = i + 2
i = i + 1
i = i + i
i = i - 1

Information about an array used in a program will be stored in
symbol table
activation record
dope vector
system table

1 2

Categories

Android C programming C++ programming Cloud Computing Computer Computer System Architecure Data Base Data Structure Internet & Social Media Java programming Manual Testing MS Office MySQL Networking Operating System PHP Programming Software Engineering Software Testing

Data Structure Question Answers, PSC, UPSC, IBPS, SSC Previous Papers