PyQdeck LogoPyQdeckSubjectsSyllabusBlog
Back to the 2025 paper

Module 2: Fundamental Algorithmic Strategies

20252m

A FIFO Branch-and-Bound strategy is typically implemented using which data structure?

(i) Stack
(ii) Queue
(iii) Priority Queue
(iv) Array

Search GoogleAsk AI
Worked SolutionAI Assisted

Answer: (ii) Queue

  • BFS → Queue, DFS → Stack
  • Branch-and-Bound FIFO → Queue, LIFO → Stack, LC → Priority Queue

Similar questions

Design and Analysis of Algorithms In DFS traversal of a graph, which data structure is used to keep track of visited nodes? (i) Queue (ii) Stack (iii) Priority Queue (iv) Heap20242m Compiler DesignWhich data structure is mainly used in lexical analysis? (i) Queue (ii) Stack (iii) Tree (iv) Finite automata20252mFORMAL LANGUAGE & AUTOMATA THEORYWhich of the following is a PDA? (i) Finite automaton with a stack (ii) Turing machine with a stack (iii) Finite automaton with a queue (iv) Turing machine with a queue20242mOperating SystemWhich free-space management technique uses a bitmap to indicate free and occupied blocks? (i) Bit Vector (ii) Indexing (iii) Grouping (iv) Linked List20252m
PreviousIn Asymptotic notation, Big- \Omega (Omega) is used to represent (i) The upper bound (Worst-case) (ii) The lower bound (Best-case) (iii) The tight bound (Average-case) (iv) None of the aboveNextThe 0/1 Knapsack problem is traditionally solved using which approach to ensure an optimal solution? (i) Greedy Method (ii) Dynamic Programming (iii) Brute-Force only (iv) Linear Search
Budget AppAndroid App

Pocketly on Android

Log daily food, travel, and hostel expenses instantly. Set monthly spending limits and see where your money goes without complex spreadsheets.

Install Pocketly