0

Data Structure (UGC/ NET)

Description: DS
Number of Questions: 15
Created by:
Tags: DS Data and File Structures
Attempted 0/15 Correct 0 Score 0

Which of the following types of block allocation in storage management is the one in which blocks of variable sizes are used for storage of data?

  1. Fixed block storage allocation

  2. Variable block storage allocation

  3. Fixed non-contiguous storage allocation

  4. Variable contiguous storage allocation

  5. Push


Correct Option: B
Explanation:

This type of block allocation in storage management is the one in which blocks of variable sizes are used for storage of data.

(A + B) * C is an example of _________________ type of expression in data structure.

  1. prefix

  2. postfix

  3. infix

  4. overflow

  5. underflow


Correct Option: C
Explanation:

This is an example of infix type of expression in data structure.

Which of the following types of graphs can be defined as G where each edge e in G is assigned a direction and each edge e is identified with an ordered pair of nodes?

  1. Undirected graph

  2. Directed graph

  3. Weighted graph

  4. Multigraph

  5. Sparse graph


Correct Option: B
Explanation:

This type of graph can be defined as G where each edge e in G is assigned a direction and each edge e is identified with an ordered pair of nodes.

Which of the following data structures are used to implement stack in a computer?

  1. Queues

  2. Pointers

  3. Arrays

  4. Classes

  5. Enumeration


Correct Option: C
Explanation:

This data structure is used to implement stack in a computer.

Which of the following sorting algorithms is based on divide-and-conquer method?

  1. Bubble sort

  2. Selection sort

  3. Heap sort

  4. Merge sort

  5. Binary search


Correct Option: D
Explanation:

This sorting algorithm is based on divide-and-conquer method. It divides the list into two subsets.

If Top = MAX - 1, then what would be the state of the stack?

  1. Stack is empty.

  2. Stack is full.

  3. Stack is having only one element.

  4. Stack is having two elements.

  5. Stack underflow.


Correct Option: B
Explanation:

If Top = MAX-1, then it means that the stack is full of elements or stack overflow.

Which of the following conditions is verified in stack before deleting any element from it?

  1. Stack underflow

  2. Stack overflow

  3. Push

  4. Pop

  5. Top


Correct Option: A
Explanation:

This condition is verified in stack before deleting any element from it.

If Front = Rear, then what does it state about a queue?

  1. Queue overflow

  2. Queue underflow

  3. Queue is having only one element.

  4. Queue elements cannot be deleted.

  5. Queue is full of elements.


Correct Option: C
Explanation:

If Front = Rear, then it states that the queue is having only one element.

Which of the following forms of tree has only left subtree?

  1. Full binary tree

  2. Complete binary tree

  3. Left skewed tree

  4. Binary tree

  5. Forest


Correct Option: C
Explanation:

A tree which is having only left subtree is called as left skewed tree.

Which of the following data structures is the one in which a subgraph of G includes all the vertices of G and is also a tree?

  1. Spanning forest

  2. Spanning tree

  3. Adjacency matrix

  4. Complete binary tree

  5. Queue


Correct Option: B
Explanation:

This data structure is the one in which a subgraph of G includes all the vertices of G and is also a tree.

Which of the following properties of list structures states that the maximum level attributed to any element is within the list or within any sublist in the list?

  1. Order

  2. Depth

  3. Length

  4. Height

  5. Width


Correct Option: B
Explanation:

This property of list structure states that the maximum level attributed to any element is within the list or within any sublist in the list.

Which of the following lists is used to insert a new node into the queue?

  1. New

  2. Avail

  3. Top

  4. Front

  5. Push


Correct Option: B
Explanation:

This list is used to insert a new node into a queue.

Which of the following forms of traversing is the one in which the left subtree of a tree is traversed first, then the root node and finally the right subtree are traversed?

  1. Preorder

  2. Inorder

  3. Postorder

  4. Breadth first traversal

  5. Sorting


Correct Option: B
Explanation:

This form of traversing is the one in which the left subtree of a tree is traversed first, then the root node and finally the right subtree are traversed.

Which of the following types of linked list is the one where the null pointer in the last node is replaced with the address of the first node?

  1. Doubly linked list

  2. Two way list

  3. Circular linked list

  4. Stack

  5. Queue


Correct Option: C
Explanation:

This type of linked list is the one where the null pointer in the last node is replaced with the address of the first node.

Which of the following types of records in file organisation is normally used for files that are stored on magnetic tapes or direct access devices?

  1. Logical record

  2. Physical record

  3. Label record

  4. File

  5. Field


Correct Option: C
Explanation:

This type of record in file organisation is normally used for files that are stored on magnetic tapes or direct access devices.

- Hide questions