# 10 MCQ of Data Structure Paper-2(CS/IT) For NIC|SSC Scientific Assistant|IBPS IT Officer Exam 2017

1)The time complexity for evaluating a postfix expression is
a)O(n^2)
b)O(logn)
c)O(n)
d)O(nlogn)

2)We use malloc and calloc for
a)static memory allocation
b)dynamic memory allocation
c)both dynamic and static memory allocation
d)None of these

3)What is the function of “Free(P)”
a)Address that P is pointing to is unchanged but the data that reside at that address are now undefined
b)Delete P for further use
c)Insert element to 1
d)None of these

4)A list can be initialized to the empty list by which operation
a)list=1
b)list=NULL
c)list=0
d)None of these

5)What can be said about the array representation of a circular queue when it contains only one element?
a)front=rear=NULL
b)front=rear not equal to NULL
c)front=rear+1
d)front=rear-1

6)r=malloc(sizeof(struct node))
In this expression what should be written before malloc for appropriate type casting
a)(int*)
b)(char*)
c)(node*)
d)(struct node*)

7)Stack is useful for implementing
c)recursion
d)none of these

8)…………..is called self referential structure
a)stack
b)queue
d)graph

9)The postfix equivalent of the prefix *+ab-cd is
a)abcd+-*
b)ab+cd-*
c)ab+cd*-
d)ab+-cd*

10)Among the following which is not C the primitive data types
a)int
b)float
c)char
d)structure

1)c
2)b
3)a
4)b
5)b
6)d
7)c
8)c
9)b
10)d