Match the LIST-I with LIST-II
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: D. A-IV, B-III, C-I, D-II
Explanation
BFS uses a queue, DFS uses a stack, prefix notation is the syntax of LISP, and infix expressions are represented by syntax trees.
More Data Structures and Algorithms questions
- Which of the following algorithms are based on the Breadth First Search (BFS) ? A. Prim's algorithms B. Kruskal algorithms C. Dijkstra algo…
- Which of the following is the solution of the recurrence T(n) = T(2n/3) + 1?
- Match the LIST-I with LIST-II
- Arrange the following recurrence relations in increasing order of their time complexity: (A) T(n) = T(n/2) + 1 (B) T(n) = 2T(n/2) + n (C) T…
- Select the Sorting Algorithms that are stable. (A) Quick Sort (B) Bubble Sort (C) Insertion Sort (D) Merge Sort (E) Shell Sort
- Match List - I with List - II.