BUET M.Sc. Admission — Department of CSE — October: 2017 | প্রশ্ন ও সমাধান

Written question 1Software Engineering

Explain Inversion of Control in C++.

Sign up free to see the model answer · উত্তর দেখতে বিনামূল্যে সাইন আপ করুন

Written question 2Software Engineering

What is Extreme Programming (XP)? Prove Pair Programming is type of Extreme Programming.

Sign up free to see the model answer · উত্তর দেখতে বিনামূল্যে সাইন আপ করুন

Written question 3Algorithms

If you know 21 Cumulative multiplications can multiply by two 33 Matrix. How many multiplication is required to multiply by two nn matrix where n i the integral power of 3.

Sign up free to see the model answer · উত্তর দেখতে বিনামূল্যে সাইন আপ করুন

Written question 4Data Structures

Write the function of enQueue() and deQueue() with single FIFO queue using link list with O(1) runtime.

Sign up free to see the model answer · উত্তর দেখতে বিনামূল্যে সাইন আপ করুন

Written question 5Microprocessor

Why AT mega AVR32 microprocessor is better over 8086 microprocessors?

Sign up free to see the model answer · উত্তর দেখতে বিনামূল্যে সাইন আপ করুন

Written question 6Programming

Write a function of factorial in C++-11 ..........(Don't use Pthread.)

Sign up free to see the model answer · উত্তর দেখতে বিনামূল্যে সাইন আপ করুন

Written question 7General ICT

Why problem solving must follow goal solving to solve real life problem for a problem solving agent in Artificial Intelligence?

Sign up free to see the model answer · উত্তর দেখতে বিনামূল্যে সাইন আপ করুন

Written question 8Mathematics

Suppose 50 persons are in line to take Tiffin where no two people are in same height. Prove that there is at least 8 persons is in increase/decrease cumulative order.

Sign up free to see the model answer · উত্তর দেখতে বিনামূল্যে সাইন আপ করুন

Written question 9Digital Logic

f(A,B,C,D)=Summation w(3,5,7,9)+Summation d(6,12,13). Find/Solve SOP expression.

Sign up free to see the model answer · উত্তর দেখতে বিনামূল্যে সাইন আপ করুন

Written question 10Data Structures

Write a function to insert a value x to the sorted list of N elements (but not use array) using this prototype. Insert List (int *list, int N, int x).

Sign up free to see the model answer · উত্তর দেখতে বিনামূল্যে সাইন আপ করুন

Written question 11Programming

Convert a Java code into Java8..................

Sign up free to see the model answer · উত্তর দেখতে বিনামূল্যে সাইন আপ করুন

Written question 12Database

Suppose there is a table named hall_room_allocation where student_id is primary key. Write a DDL code where each student can get only one hall, only one room and only one bed. Show the possible foreign key.

Sign up free to see the model answer · উত্তর দেখতে বিনামূল্যে সাইন আপ করুন

Written question 13Database

Let A(A1[PK], A2, A3), B(B1[PK], B2, B3), C(C1[PK], C2, C3), D(D1[PK], D2) and E(E1[PK], E2, E3) Transform an ERD into table from the given ERD design. Relations are [A->B], [B<-->C], [B-->D, B<-->E]

Sign up free to see the model answer · উত্তর দেখতে বিনামূল্যে সাইন আপ করুন

Written question 14Operating Systems

Describe Deadlock conditions.

Model answer

A deadlock occurs when a set of processes are each waiting indefinitely for a resource held by another process in the same waiting cycle, so none of them can ever proceed — and this can only happen when all four Coffman conditions hold simultaneously.

#	Condition	Meaning
1	Mutual Exclusion	At least one resource must be held in a non-shareable mode
2	Hold and Wait	A process holds at least one resource while waiting to acquire more
3	No Preemption	A resource cannot be forcibly taken away; it is released only voluntarily
4	Circular Wait	A closed chain P1 -> P2 -> ... -> Pn -> P1 exists, each waiting on the next

graph LR
    P1((Process P1)) -->|holds| R1[Resource R1]
    R1 -->|requested by| P2((Process P2))
    P2 -->|holds| R2[Resource R2]
    R2 -->|requested by| P1

This Resource Allocation Graph cycle is the classic signature of deadlock: P1 holds R1 and wants R2, P2 holds R2 and wants R1 — neither can ever proceed.

Handling strategies:

Prevention — structurally break one of the 4 conditions (e.g. request all resources up front to eliminate Hold-and-Wait).
Avoidance — Banker's Algorithm: grant a request only if the resulting state is still "safe".
Detection & Recovery — allow deadlocks to occur, periodically check the wait-for graph for cycles, then kill or preempt a process to break it.
Ignorance (Ostrich algorithm) — do nothing special; used by most general-purpose OSes since deadlocks are rare in practice.

Exam takeaway: all four Coffman conditions (Mutual Exclusion, Hold-and-Wait, No Preemption, Circular Wait) are individually necessary but only jointly sufficient for deadlock — breaking even one prevents it.

Written question 15Mathematics

Suppose one Mimi wants to reach a city she doesn't know the way. There are two people A and B where A tells always lies and B tells always true. Mimi ask A the way. A replies "The city is near the lake and the right way goes to the city". She again asks B same question to B. B replies, "The city is near the lake and the right way goes to the city". After hearing that, A replies, "Don't believe B, He tells lie." B also replies Don't believe A, he tells lie. How Mimi will go to the city? Solve with using truth table.

Sign up free to see the model answer · উত্তর দেখতে বিনামূল্যে সাইন আপ করুন

Written question 16Data Structures

How to search an element in the list in best way with O(1) runtime. Explain.

Sign up free to see the model answer · উত্তর দেখতে বিনামূল্যে সাইন আপ করুন

Written question 17General ICT

Write the meaning:

Sign up free to see the model answer · উত্তর দেখতে বিনামূল্যে সাইন আপ করুন

Written question 18Networking

Difference between NAT and PAT in networking.

Sign up free to see the model answer · উত্তর দেখতে বিনামূল্যে সাইন আপ করুন

Written question 19Algorithms

Context free grammar (Theory of Automata).

Sign up free to see the model answer · উত্তর দেখতে বিনামূল্যে সাইন আপ করুন

Written question 20Algorithms

What are three address codes in compiler? How data structure for memory for three address code?

Sign up free to see the model answer · উত্তর দেখতে বিনামূল্যে সাইন আপ করুন

Written question 21Digital Logic

A math from flip flop.

Sign up free to see the model answer · উত্তর দেখতে বিনামূল্যে সাইন আপ করুন

Written question 22Computer Architecture

How to divides two number using computer?

Sign up free to see the model answer · উত্তর দেখতে বিনামূল্যে সাইন আপ করুন

Written question 23Algorithms

A question from Greedy Algorithm.

Sign up free to see the model answer · উত্তর দেখতে বিনামূল্যে সাইন আপ করুন

Written question 24Operating Systems

A system uses 32-bit address. P page with 4KBytes will contain how many entries? How many space/memory is required to load the page with entries if each entry takes 8-bits memory?

Sign up free to see the model answer · উত্তর দেখতে বিনামূল্যে সাইন আপ করুন

Written question 25Software Engineering

Write down the Waterfall model of software.

Sign up free to see the model answer · উত্তর দেখতে বিনামূল্যে সাইন আপ করুন