Faculty Initial: INITIAL
Dept. of CSE
School of Engineering
Date: Jan 31, 2026 02:00 PM
Examination : Final Examination Semester : Fall 2025
Course Code : CSE265.13 Marks : 30
Course Title : Algorithm Section : 13
Slot : Slot - 22 Duration : 2 hours
General Instructions:
● All questions must be answered.
● All the devices (mobile, smartwatch, etc) should be turned off and kept in the student’s bag during the exam period.
Sl.
Tasks Marks COs BCL*
No.
1. Explain the concept of hash functions and how they map data to L-2
fixed-size values. Summarize how do we handle collisions in 7 CO2 [Underst
hashing? and]
2.
L-2
10 CO2 [Underst
and]
A) Explain Dijkstra’s algorithm for finding the shortest path
from a single source to all other vertices in a weighted
graph.
B) Describe Kruskal’s algorithm for finding the minimum
spanning tree (MST) of a graph.
3. Demonstrate the general approach to solving problems using DP, L-3
6 CO3
and give an example of a problem that can be solved using DP. [Apply]
4. Integrate Computational geometry in solving geometric problems L-4
using algorithms. Analyze the backtracking algorithm of solving 7 CO4 [Analyze
the 4-Queen problem. ]
Page 1 of 1 *Bloom’s Cognitive Level