Mcqs - Fds Multiple Choice Questions Mcqs - Fds Multiple Choice Questions

lOMoARcPSD|8283735
MCQs - FDS Multiple Choice Questions
Fundamentals of Data Structure (Savitribai Phule Pune University)
StuDocu is not sponsored or endorsed by any college or university

Downloaded by Rushi Ghonse (rushighonse73730@gmail.com)
lOMoARcPSD|8283735
MCQs
1. Which of these best describes an array?

a) A data structure that shows a hierarchical behavior
b) Container of objects of similar types
c) Container of objects of mixed types
d) All of the mentioned
Answer: b
Explanation: Array contains elements only of the same type.
2. How do you initialize an array in C?

a) int arr[3] = (1,2,3);
b) int arr(3) = {1,2,3};
c) int arr[3] = {1,2,3};
d) int arr(3) = (1,2,3);
Answer: c
Explanation: This is the syntax to initialize an array in C.
3. How do you instantiate an array in Java?

a) int arr[] = new int(3);
b) int arr[];
c) int arr[] = new int[3];
d) int arr() = new int(3);
Answer: c
Explanation: Note that option b is declaration whereas option c is to instantiate an array.
4. Which of the following is a correct way to declare a multidimensional array in Java?

a) int[][] arr;
b) int arr[][];
c) int []arr[];
Answer: d
Explanation: All the options are syntactically correct.
5. What is the output of the following piece of code?
public class array

{
public static void main(String args[])
{
int []arr = {1,2,3,4,5};
System.out.println(arr[2]);
}
}

lOMoARcPSD|8283735
a) 3 and 5
b) 5 and 3
c) 2 and 4
d) 4 and 2
Answer: a
Explanation: Array indexing starts from 0.
6. What is the output of the following piece of code?
public class array

{
public static void main(String args[])
{
int []arr = {1,2,3,4,5};
}
}
a) 4
b) 5
c) ArrayIndexOutOfBoundsException
d) InavlidInputException
Answer: c
Explanation: Trying to access an element beyond the limits of an array gives
ArrayIndexOutOfBoundsException.
7. When does the ArrayIndexOutOfBoundsException occur?

a) Compile-time
b) Run-time
c) Not an error
d) None of the mentioned
Answer: b
Explanation: ArrayIndexOutOfBoundsException is a run-time exception and the compilation is
error-free.
8. Which of the following concepts make extensive use of arrays?

a) Binary trees
b) Scheduling of processes
c) Caching
d) Spatial locality
Answer: d
Explanation: Whenever a particular memory location is referred, it is likely that the locations
nearby are also referred, arrays are stored as contigous blocks in memory, so if you want to
access array elements, spatial locality makes it to access quickly.
9. What are the advantages of arrays?

a) Easier to store elements of same data type
b) Used to implement other data structures like stack and queue

lOMoARcPSD|8283735
c) Convenient way to represent matrices as a 2D array

Answer: d
Explanation: Arrays are simple to implement when it comes to matrices of fixed size and type, or
to implement other data structures.
10. What are the disadvantages of arrays?

a) We must know before hand how many elements will be there in the array
b) There are chances of wastage of memory space if elements inserted in an array are lesser than
than the allocated size
c) Insertion and deletion becomes tedious
Answer: d
Explanation: Arrays are of fixed size, hence during the compile time we should know its size and
type, since arrays are stored in contigous locations, insertion and deletion becomes time
consuming.
11. Assuming int is of 4bytes, what is the size of int arr[15];?

a) 15
b) 19
c) 11
d) 60
Answer: d
Explanation: Since there are 15 int elements and each int is of 4bytes, we get 15*4 = 60bytes.
Queues:
1. A linear list of elements in which deletion can be done from one end (front) and insertion can
take place only at the other end (rear) is known as a ?
a) Queue
b) Stack
c) Tree
d) Linked list
Answer: a
Explanation: Self Explanatory.
3. A queue is a ?
a) FIFO (First In First Out) list
b) LIFO (Last In First Out) list
c) Ordered array
d) Linear tree
View Answer
Answer: a

lOMoARcPSD|8283735
4. In Breadth First Search of Graph, which of the following data structure is used?
a) Stack
b) Queue
c) Linked list
View Answer
Answer: b
5. If the elements “A”, “B”, “C” and “D” are placed in a queue and are deleted one at a time, in
what order will they be removed?
a) ABCD
b) DCBA
c) DCAB
d) ABCD
Answer: a
Explanation: Queue follows FIFO approach.
6. A data structure in which elements can be inserted or deleted at/from both the ends but not in
the middle is?
a) Queue
b) Circular queue
c) Dequeue
d) Priority queue
Answer: c
7. A normal queue, if implemented using an array of size MAX_SIZE, gets full when
a) Rear = MAX_SIZE – 1
b) Front = (rear + 1)mod MAX_SIZE
c) Front = rear + 1
d) Rear = front
Answer: a
Explanation: Condition for size of queue.
8. Queues serve major role in

a) Simulation of recursion
b) Simulation of arbitrary linked list
c) Simulation of limited resource allocation
Answer: c
Explanation: Rest all are implemented using other data structures.
9. Which of the following is not the type of queue?

a) Ordinary queue

lOMoARcPSD|8283735
b) Single ended queue

c) Circular queue
d) Priority queue
Answer: b
Explanation: Queue always has two ends.
10. In linked list implementation of queue, if only front pointer is maintained, which of the
following operation take worst case linear time?
a) Insertion
b) Deletion
c) To empty a queue
d) Both a and c
Answer: d
Explanation: Since front pointer is used for deletion, so worst time for the other two cases.
11. In linked list implementation of a queue, where does a new element be inserted?
a) At the head of link list
b) At the centre position in the link list
c) At the tail of the link list
Answer: c
Explanation: Since queue follows FIFO so new element inserted at last.
12. In linked list implementation of a queue, front and rear pointers are tracked. Which of these
pointers will change during an insertion into a NONEMPTY queue?
a) Only front pointer
b) Only rear pointer
c) Both front and rear pointer
Answer: b
Explanation: Since queue follows FIFO so new element inserted at last.

Mcqs - Fds Multiple Choice Questions Mcqs - Fds Multiple Choice Questions

Uploaded by

Copyright:

Available Formats

Mcqs - Fds Multiple Choice Questions Mcqs - Fds Multiple Choice Questions

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Mcqs - Fds Multiple Choice Questions Mcqs - Fds Multiple Choice Questions

Uploaded by

Copyright:

Available Formats

lOMoARcPSD|8283735

MCQs - FDS Multiple Choice Questions

Fundamentals of Data Structure (Savitribai Phule Pune University)

StuDocu is not sponsored or endorsed by any college or university

1. Which of these best describes an array?

2. How do you initialize an array in C?

3. How do you instantiate an array in Java?

4. Which of the following is a correct way to declare a multidimensional array in Java?

5. What is the output of the following piece of code?

public class array

Downloaded by Rushi Ghonse (rushighonse73730@gmail.com)

6. What is the output of the following piece of code?

public class array

7. When does the ArrayIndexOutOfBoundsException occur?

8. Which of the following concepts make extensive use of arrays?

9. What are the advantages of arrays?

Downloaded by Rushi Ghonse (rushighonse73730@gmail.com)

c) Convenient way to represent matrices as a 2D array

10. What are the disadvantages of arrays?

11. Assuming int is of 4bytes, what is the size of int arr[15];?

Downloaded by Rushi Ghonse (rushighonse73730@gmail.com)

8. Queues serve major role in

9. Which of the following is not the type of queue?

Downloaded by Rushi Ghonse (rushighonse73730@gmail.com)

b) Single ended queue

Downloaded by Rushi Ghonse (rushighonse73730@gmail.com)

You might also like