C Programming: MCQ Set – 10
Q91: An array of pointers is same as
- (A) Pointer to array
- (B) Pointers to pointers
- (C) Pointer to function
- (D) Pointer to structure
Q92: The smallest element of an array’s index is called its
- (A) Lower bound
- (B) Upper bound
- (C) Range
- (D) Extraction
Q93: Which one of the following is a physical data structure?
- (A) Array
- (B) Linked list
- (C) Stack
- (D) Table
Q94: Set of values of the same type, which have a single name followed by an index is called
- (A) Function
- (B) Structure
- (C) Array
- (D) Union
Q95: In C, if you pass an array as an argument to a function, what actually gets passed?
- (A) Value of elements in array
- (B) First element of the array
- (C) Base address of the array
- (D) Address of the last element of array
Q96: The process of accessing data stored in a serial access memory is similar to manipulating data on a
- (A) Heap
- (B) Queue
- (C) Stack
- (D) Binary tree
Q97: The following postfix expression is evaluated using a stack: 823^/23* + 51* –
The top two elements of the stack after first * is evaluated
- (A) 6, 1
- (B) 5,7
- (C) 3, 2
- (D) 1, 5
Q98: What data structure would you mostly likely see in a non recursive implementation of a recursive algorithm?
- (A) Stack
- (B) Linked list
- (C) Queue
- (D) Trees
Q99: Which data structure allows deleting data elements from front and inserting at rear?
- (A) Stacks
- (B) Queues
- (C) Deques
- (D) Binary search tree
Q100: What is the most appropriate data structure to implement a priority queue ?
- (A) Heap
- (B) Circular array
- (C) Linked list
- (D) Binary tree
Answer:
Question | Q91 | Q92 | Q93 | Q94 | Q95 | Q96 | Q97 | Q98 | Q99 | Q100 |
Answer | B | A | A | C | C | C | A | A | B | A |