IIIT delhi PGCAT-2025 Memory-Based questions 🔥

The exam was conducted on 4th May 2025 and comprised two parts. Part 1 focused on core subjects, featuring questions on functions, semaphores, subnetting, inodes, and data structures and algorithms (DSA). Part 2 consisted of two coding questions.

## Part-1 Core subject questions:

1. Which data structure is used to implement Dijkstra's algorithm?

# 3 Inode-based questions like:

2. Why do we use Inode?

3. What are the challenges faced by using Inode?

# Rank question:

4. One linear algebra question based on rank. It was based on properties like rank of(A) = Rank of (AA^T )= Rank of (A^T A )

# 2 Output-based programming questions:

5. How to delete a node if a pointer to a node is given (not the head pointer) in O(1)?

# 2 questions based on mutex:

6. What is the time complexity to sort n numbers, each of a single digit (base 10) ?

# 4–5 questions from functions in set theory, like surjective and injective asked

7. L1= {0^k1u0^k | k ≥ 1, u € {0,1}}, L2= {0^ku0^k | k ≥ 1, u € {0,1}}, which one is regular or both?

8. Given page fault service time (S) = 2 ns and main memory access time (M) = 80 ms and page fault rate (P) = 10%. Calculate the EMAT(in ns).

9. Number of Binary search trees with 4 distinct keys?

10. What is the number of one-to-one functions from A->B that have n elements?

11. 32-bit Virtual Address, 4KB page size, 2-level page table. Find the entries in each level?

12. What is Translation Lookaside Buffer used for?

13. What is a zombie process in Unix?

14. A function f from A to B, B is an equivalence relation and S € (a,b) if and only if(f(a),f(b)) € A. Then S is an equivalence relation, reflexive only, reflexive and symmetric, and transitive?

15. If there is a single mutex in multithreading processes, a load on the system occurs when

a) Use spinlock

b) give more work to computing

c) Add multiple mutexes, which will slow down computing

16. What should be the trade-off?

17. Max Height of AVL: log2(n), log3(n), 2*log(n+1)

# # Part-2 coding questions:

1. ) Count Distinct Elements In Every Window of Size K | GeeksforGeeks
2. ) Converting Decimal Number lying between 1 to 3999 to Roman Numerals | GeeksforGeeks

Thank you for taking the time to read this.