Graph Representations and Disjoint Sets

Questions

1. GATE CS 2017 Set 2MCQ1 markMedium (estimate)

   GATE CS 2017 Set 2, Q.15 (CS Q.15)

   The Breadth First Search (BFS) algorithm has been implemented using the queue data structure. Which one of the following is a possible order of visiting the nodes in the graph b...

   Graph Traversals, Topological Sort and Connectivity · Graph Representations and Disjoint Sets

2. GATE CS 2016 Set 2MCQ2 marksMedium (estimate)

   GATE CS 2016 Set 2, Q.51 (CS Q.41)

   In an adjacency list representation of an undirected simple graph $G=(V,E)$, each edge $(u,v)$ has two adjacency list entries: $[v]$ in the adjacency list of $u$, and $[u]$...

   Graph Representations and Disjoint Sets · Asymptotic Analysis and Time/Space Complexity

Other topics of Data Structures

• Arrays and Linked Lists
• Stacks and Queues
• Binary Trees, Binary Search Trees and Balanced Trees
• Binary Heaps and Priority Queues
• Hash Tables and Collision Resolution