CS8391 - Data Structure - IAT I

Elements in an array are accessed _____________

• randomly

• Sequentially

• Exponentially

• Logarithmically

In general, the index of the first element in an array is __________

• 0

• -1

• 1

• 2

A linear collection of data elements where the linear node is given by means of pointer is called?

• Linked list

• Node list

• Primitive list

• Unordered list

In linked list each node contain minimum of two fields. One field is data field to store the data second field is?

• Pointer to character

• Pointer to integer

• Pointer to node

• Node

The concatenation of two list can performed in O(1) time. Which of the following variation of linked list can be used?

• Singly linked list

• Doubly linked list

• Circular doubly linked list

• Array implementation of list

Linked list is considered as an example of ___________ type of memory allocation.

• Dynamic

• Compile time

• Static

• Heap

Linked list data structure offers considerable saving in _____________

• Computational Time

• Space Utilization

• Space Utilization and Computational Time

• Speed Utilization

Which of the following points is/are not true about Linked List data structure when it is compared with array?

• Arrays have better cache locality that can make them better in terms of performance

• It is easy to insert and delete elements in Linked List

• Random access is not allowed in a typical implementation of Linked Lists

• Access of elements in linked list takes less time than compared to arrays

In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is

• log 2 n

• n/2

• log 2 n – 1

• n

You are given pointers to first and last nodes of a singly linked list, which of the following operations are dependent on the length of the linked list?

• Delete the first element

• Insert a new element as a first element

• Delete the last element of the list

• Add a new element at the end of the list