ObjectiveMcq
Print Protected
This page is protected for print. Use the website to view the content.
Browse the question list for GATE CSE in 2025.
2 questions · Page 1 of 1
In a paging system, which data structure maps logical page numbers to physical frame numbers?
Segment table
Page table
File allocation table
Interrupt vector table
The page table stores the mapping between logical page numbers (used by the process) and physical frame numbers (in RAM).
Which algorithm finds the shortest path from a single source in a weighted graph with non-negative edge weights?
Bellman-Ford
Floyd-Warshall
Dijkstra's algorithm
BFS
Dijkstra's algorithm finds the shortest path from a single source in O((V + E) log V) for non-negative weights. Bellman-Ford handles negative weights but is slower.
