HirePro DSA Quiz 1

Question 1

Time: 00:00:00
How many vertices in a set must a top tree have for the underlying tree to be defined

1

1

2

2

3

3

4

4

Question 2

Time: 00:00:00
What is the space complexity of deleting a node in Linked list

O(1)

O(1)

O(n)

O(n)

O(logn)

O(logn)

O(n^2)

O(n^2)

Question 3

Time: 00:00:00
In the path cluster, how many edges are there

1

1

2

2

3

3

4

4

Question 4

Time: 00:00:00
Each node in a linked list has a minimum of two fields. A data field is used to hold data, and a second field is

Pointer to integer

Pointer to integer

Pointer to character

Pointer to character

Pointer to node

Pointer to node

None of these

None of these

Question 5

Time: 00:00:00
How many edges are there in a cluster of leaves

1

1

2

2

3

3

Zero

Zero

Question 6

Time: 00:00:00
It is possible to combine two lists in O(1) time.Which of the following linked list variations can be used

Singly linked list

Singly linked list

Doubly linked list

Doubly linked list

Circular doubly linked list

Circular doubly linked list

Array implementation of list

Array implementation of list

Question 7

Time: 00:00:00
Linked lists are not appropriate for implementing

Insertion sort

Insertion sort

Radix sort

Radix sort

Polynomial manipulation

Polynomial manipulation

Binary search

Binary search

Question 8

Time: 00:00:00
In order to maintain a dynamic forest utilizing a link or cut operation, which data structure is used

Top Tree

Top Tree

Stack

Stack

Linked List

Linked List

Queue

Queue

Question 9

Time: 00:00:00
A node in the implementation of a linked list carries information about

Data

Data

Link

Link

Node

Node

Data and Link

Data and Link

Question 10

Time: 00:00:00
When compared to an array, which of the following statements regarding the linked list data structure is/are true

better locality of the cache in an array can improve performance

better locality of the cache in an array can improve performance

It is simple to add and remove members from a linked list

It is simple to add and remove members from a linked list

A common implementation of linked lists does not permit random access.

A common implementation of linked lists does not permit random access.

Linked list element access is faster than array element access.

Linked list element access is faster than array element access.

null
null
×

Please login to report