← HomeHome

Past Questions (Year-wise)Past Questions (Year-wise)

Past Questions by YearPast Questions by Year

Real BUET MSc CSE admission questions from five recovered papers (2017–2024), each linked to the chapter that covers it. পাঁচটা recovered paper (2017–2024) থেকে বাস্তব BUET MSc CSE admission প্রশ্ন, প্রতিটার সাথে সংশ্লিষ্ট chapter-এর link।

Why English only? The real exam paper is in English. So the questions below are kept in English only — exactly the way you will face them. Reading them in the exam language is the best practice. The page header, section titles, and notes stay bilingual as usual.
শুধু English কেন? আসল exam paper English-এ হয়। তাই নিচের প্রশ্নগুলো শুধু English-এ রাখা হয়েছে — ঠিক যেভাবে exam hall-এ পাবেন। Exam-এর language-এই প্রশ্ন পড়া practice করাই সবচেয়ে ভালো। Page-এর header, section title আর note আগের মতোই bilingual।

Use these papers in two ways. First, after finishing a chapter, scan every year for that chapter's questions and try them. Second, in the last weeks, take one full paper with a 90-minute timer and write short answers for everything. Each question has a chapter link like [Ch 06] — if you get stuck, that is where to revise.

এই paper-গুলো দুইভাবে use করুন। প্রথমত, একটা chapter শেষ করার পর সব বছরের paper থেকে সেই chapter-এর প্রশ্নগুলো বের করে solve করুন। দ্বিতীয়ত, শেষের সপ্তাহগুলোতে ৯০-মিনিট timer দিয়ে পুরো একটা paper-এর সব প্রশ্নের short answer লিখুন। প্রতিটা প্রশ্নের পাশে [Ch 06]-এর মতো chapter link আছে — আটকে গেলে সেখান থেকে revise করবেন।

In this chapterএই chapter-এ যা আছে
  1. April 2017April 2017
  2. October 2017October 2017
  3. October 2018October 2018
  4. April 2019April 2019
  5. April 2024April 2024

1. April 20171. April 2017

  1. What is the purpose of an intermediate code generator in a compiler? [Ch 07]
  2. What are the advantages of the ID3 decision tree algorithm? [Ch 15]
  3. Design a MOD-12 up counter using T flip-flops. [Ch 12]
  4. Build a B+ tree by inserting 12, 14, 19, 30, 21, 22, 13, 34, 18, 23, 38, 40 (order n = 5). [Ch 08]
  5. Draw an ER diagram showing full and partial participation between Student and Course, then convert it into tables. [Ch 08]
  6. What is a superscalar microprocessor? [Ch 13]
  7. Write a regular expression for strings of alphanumerics that contain an even number of digits. [Ch 07]
  8. What problems and advantages come with a small page size? [Ch 14]
  9. Write the pseudocode of heapsort. [Ch 06]
  10. Check whether a string is a palindrome using one stack and one queue. [Ch 05]
  11. Write a recursive function to separate the digits of an integer. [Ch 01]
  12. Explain longest prefix match in routing. [Ch 09]
  13. Given an IP block, calculate the subnets and hosts per subnet. [Ch 09]
  14. Differentiate between a microprocessor and a microcontroller. [Ch 13]
  15. Express the given statements in first-order predicate logic. [Ch 03]
  16. Describe the waterfall model. [Ch 11]
  17. Construct the binary tree from the given preorder and inorder traversals. [Ch 05]
  18. Minimize F(W,X,Y,Z) = Σm(6,7,8,9) with don't cares d(3,4,5) using a K-map. [Ch 12]
  19. Explain pipeline hazards with a diagram. [Ch 13]
  20. Explain C++ access specifiers and how they behave under inheritance. [Ch 02]
  21. Fill in the blanks about pipelining. [Ch 13]
  22. True/False: statements about software component independence. [Ch 11]
  23. Prove by induction that any postage of the given amount can be formed with the given stamps. [Ch 03]
  24. Questions on bijective functions. [Ch 03]
  25. Differentiate multitasking, multiprogramming, and multithreading. [Ch 14]

2. October 20172. October 2017

  1. Multiplying two 7×7 matrices takes 21 steps on a machine. How many steps for two n×n matrices? [Ch 06]
  2. Show binary division using the shift-and-subtract method. [Ch 13]
  3. What are the bottlenecks of a greedy approach in AI search? [Ch 15]
  4. Why must an AI system be designed after its goals are fixed? [Ch 15]
  5. Pointer arithmetic questions on int A[3][4]. [Ch 01]
  6. Insert a node into a sorted linked list using pointer manipulation only. [Ch 05]
  7. Rewrite the given Java Swing listener code using a lambda expression. [Ch 02]
  8. Compute factorial using C++ threads. [Ch 02]
  9. Explain the given ER diagram. [Ch 08]
  10. Write SQL DDL statements with the required constraints. [Ch 08]
  11. Fill in the blanks on computer architecture (program counter, pipelining, stalls, microprogramming). [Ch 13]
  12. Where does the cache sit, and what is write-through vs write-back? [Ch 13]
  13. How is the Pentium's superscalar design different from the 80386? [Ch 13]
  14. What advantages does an AVR microcontroller have over the 80386? [Ch 13]
  15. Implement a queue with a linked list in C. [Ch 05]
  16. Which data structure gives O(1) average search time, and how? [Ch 05]
  17. Compute the physical address from the given logical address. [Ch 14]
  18. State the four necessary conditions for deadlock. [Ch 14]
  19. Minimize the given function with don't cares using a K-map. [Ch 12]
  20. Derive 50 MHz and 25 MHz clocks from 100 MHz using D flip-flops. [Ch 12]
  21. Advantages and disadvantages of the waterfall model. [Ch 11]
  22. Draw a use case diagram for an e-commerce system. [Ch 11]
  23. Write a CFG for even-length palindromes over {a, b, c}. [Ch 07]
  24. Represent the given expression using quadruples and triples. [Ch 07]
  25. Logic riddle: villagers who always lie or always tell the truth. [Ch 03]
  26. Prove that among 50 students there is an increasing or decreasing subsequence of the given length. [Ch 03]
  27. Differentiate NAT and PAT. [Ch 09]
  28. Should you compress before encrypting, or the reverse? Why? [Ch 10]
  29. What is cohesion in a system? [Ch 11]
  30. What is coupling between components? [Ch 11]

3. October 20183. October 2018

  1. Build a max-heap from [10, 20, 15, 30, 40]. [Ch 05]
  2. What is the time complexity of binary search, and why? [Ch 06]
  3. Why must left recursion be eliminated for top-down parsing? [Ch 07]
  4. Draw a DFA for strings ending in "aa". [Ch 07]
  5. C question: comparing strings with == compares pointers — explain the output. [Ch 01]
  6. Questions on variable-length arrays in C. [Ch 01]
  7. Why does the given C++ constructor code fail to compile? [Ch 02]
  8. Using Java Streams, print the length of each string without a loop. [Ch 02]
  9. Count the positive integers ≤ 100 not divisible by 3, 5, or 7. [Ch 03]
  10. Logic riddle: which platform does the liar point to? [Ch 03]
  11. Minimize the given Boolean function using a K-map. [Ch 12]
  12. Identify the circuit from the given truth table. [Ch 12]
  13. Why is branching a problem for pipelining, and what are the solutions? [Ch 13]
  14. Assign IP addresses using CIDR for the given networks. [Ch 09]
  15. Design classes for an Employees–Projects relationship. [Ch 02]
  16. What are the bottlenecks of a greedy approach? [Ch 15]
  17. Find the critical path of the given scheduling problem. [Ch 11]
  18. Compare the pins of the 8085 and 8086. [Ch 13]
  19. Show the instruction flow difference between CISC and RISC. [Ch 13]
  20. Shell command questions (grep and others). [Ch 01]
  21. State the four necessary conditions for deadlock. [Ch 14]
  22. Classify the given SQL statements as DDL, DML, DCL, or TCL. [Ch 08]
  23. Analyze the register values after the given assembly code runs. [Ch 13]
  24. Design an ER diagram for the given scenario. [Ch 08]
  25. Design the business logic for the given system. [Ch 11]
  26. How would you refactor a legacy system with 1000 functions? [Ch 11]
  27. List the standard port numbers of common services. [Ch 09]

4. April 20194. April 2019

  1. Implement F1 = A + B and F2 = AB together using the minimum number of NAND/NOR gates. [Ch 12]
  2. Which graph representation fits a graph with 100 vertices and 300 edges, and why? [Ch 05]
  3. Java: comparing a String made with new vs a literal — what does == give? [Ch 02]
  4. How does Bellman-Ford handle negative edges and negative cycles? [Ch 06]
  5. Design O(1) enqueue and dequeue using a singly linked list. [Ch 05]
  6. Implement assembly PUSH and POP using only mov and add. [Ch 13]
  7. How do you instantiate a Java inner class? [Ch 02]
  8. Write an SQL UPDATE that uses a CASE expression. [Ch 08]
  9. What are database triggers and when do they fire? [Ch 08]
  10. Draw an NFA for strings with an odd number of 1s or an even number of 0s. [Ch 07]
  11. Draw a UML class diagram for an online shopping system. [Ch 11]
  12. Draw a state diagram for the shopping workflow. [Ch 11]
  13. Describe the six phases of the software/system life cycle. [Ch 11]
  14. Name and explain the four levels of testing. [Ch 11]
  15. What advantage does IDDFS have over plain DFS? [Ch 15]
  16. Why does returning the address of a local variable create a dangling pointer? [Ch 01]
  17. Draw the relationship diagram of P, NP, NP-Hard, and NP-Complete. [Ch 06]
  18. Write a C function to reverse a string. [Ch 01]
  19. Eliminate left recursion from the given grammar. [Ch 07]
  20. Why is the addressing range of a branch instruction limited? [Ch 13]
  21. Why are Java Strings immutable? [Ch 02]
  22. Compare mesh and star topologies. [Ch 09]
  23. Find the subnet mask needed for 512 subnets. [Ch 09]
  24. Write a program to sum all palindromic numbers between 100 and 999. [Ch 01]
  25. Pigeonhole problem on students' initials. [Ch 03]
  26. Address translation with a 4KB page size. [Ch 14]
  27. What is memory interleaving and why is it used? [Ch 13]

5. April 20245. April 2024

  1. What is overfitting and how can you avoid it? [Ch 15]
  2. Why is the pumping lemma called a "negative proof"? [Ch 07]
  3. What is a DHCP starvation attack? [Ch 09]
  4. For 192.168.10.45/27, find the subnet address and related values. [Ch 09]
  5. Find the output of the given quicksort script. [Ch 06]
  6. C++ output question: comparing signed and unsigned values. [Ch 01]
  7. Count the output tuples of the given SQL queries. [Ch 08]
  8. What is a Java functional interface? [Ch 02]
  9. State the rules for filling a cell of an LL(1) parsing table. [Ch 07]
  10. Detect a loop in a singly linked list. [Ch 05]
  11. Probability question on run lengths. [Ch 04]
  12. Define P and NP; compare approximation and heuristic algorithms. [Ch 06]
  13. Implement XOR using a 2-to-4 decoder and a NOR gate. [Ch 12]
  14. Apply the Strategy pattern to a sorting problem. [Ch 02]
  15. Under what conditions does A* find the optimal solution? [Ch 15]
  16. What are the reasons a software project fails? [Ch 11]
Note: In each of these written exams, the full paper was 30 questions × 10 marks = 300 marks in 90 minutes — about 3 minutes per question. The lists above are the publicly recovered portions of each paper, so some years show fewer than 30 questions. Treat them as the core sample, not the complete paper.
Note: এই written exam-গুলোর প্রতিটাতে পুরো paper ছিল ৩০টা প্রশ্ন × ১০ marks = ৯০ মিনিটে ৩০০ marks — প্রতি প্রশ্নে প্রায় ৩ মিনিট। উপরের list-গুলো প্রতিটা paper-এর publicly recovered অংশ, তাই কোনো কোনো বছরে ৩০টার কম প্রশ্ন দেখা যাচ্ছে। এগুলোকে core sample হিসেবে নিন, complete paper হিসেবে না।