Data Structures Quiz

What is a tree in data structures?

• A linear data structure

• A hierarchical data structure

• A non-linear data structure

• Both b and c

In a binary search tree (BST), which traversal gives elements in sorted order?

• Preorder

• Postorder

• Inorder

• Level-order

Which tree data structure is best suited for hierarchical representation?

• Binary Tree

• B-Tree

• Heap

• Trie

In a binary tree, how many children can a node have at most?

• 1

• 2

• 3

• Any number

What is a graph in data structures?

• A tree-like structure

• A collection of nodes connected by edges

• A linear data structure

• A stack-based structure

What is the difference between a directed graph and an undirected graph?

• Directed graphs have weights on edges, while undirected graphs do not

• Directed graphs have edges with a direction, while undirected graphs do not

• Directed graphs cannot have cycles

• Undirected graphs require more memory

A graph without cycles is called a:

• Complete graph

• Connected graph

• Acyclic graph

• Weighted graph

Which graph representation is more efficient for a sparse graph?

• Adjacency matrix

• Adjacency list

• Incidence matrix

• Edge list

Which algorithm is used to find the shortest path in a weighted graph with non-negative weights?

• DFS

• Dijkstra's Algorithm

• Kruskal's Algorithm

• Bellman-Ford Algorithm

In a weighted graph, an edge's weight represents:

• The number of edges in the graph

• The cost or distance between two nodes

• The degree of a vertex

• The number of cycles in the graph