DAA Exam Prep
Shared by a Veda learner · Generated with Veda AI
What you'll study, topic by topic
DAA Exam Prep
Sample questions with model answers
Every question in the paper gets a full exam-length answer in the app — organised by marks, the way a topper writes it.
What is the sum of subsets problem? Let $w=\{5,7,10,12,15,18,20\}$ and $m=35$. Find all possible subsets of $w$ that sum to $m$ using recursive backtracking algorithm for it. Draw the portion of the state-space tree that is generated.
Show answer outline
The sum of subsets problem involves finding subsets of a set that sum to a specific value using recursive backtracking, generating a state-space tree.
The full exam-length answer is in the app.
Apply the greedy single source shortest path algorithm Dijkstra's on the graph given below graph.
Show answer outline
Dijkstra's algorithm finds the shortest path from a source vertex to all other vertices in a graph by iteratively selecting the vertex with the smallest tentative distance.
The full exam-length answer is in the app.
What is Knapsack problem? Solve Fractional knapsack problem using greedy programming for the following four items with their weights $w = \{3, 5, 9, 5\}$ and values $P = \{45, 30, 45, 10\}$ with knapsack capacity is 16.
Show answer outline
The knapsack problem involves maximizing value within a weight limit; for fractional knapsack, items can be divided to achieve maximum value.
The full exam-length answer is in the app.
Apply Branch and Bound technique to solve travelling salesman problem for the graph whose cost matrix is given below:
Show answer outline
Branch and Bound systematically explores all possible routes in the travelling salesman problem, pruning paths that exceed known bounds.
The full exam-length answer is in the app.
Study it properly — free, in the app
The full Veda Bites deck, complete notes, spaced-repetition flashcards, leveled MCQs, tests and games for this kit — plus Daily Facts and the Arena, every day.