CSE Career Master Guide, Dhaka (2026)

23/05/2026

Banker’s Selection Committee
Assistant Programmer - Job ID:10226
Exam Date: 22/05/2026
Time: 2 hours
Marks: 200

৪-৯ চ্যাটজিপিটিকে কনসেপ্ট দিলে সে প্রশ্ন তৈরি করেছে। আপনারা যেহেতু এক্সাম দিয়েছেন টেকনিক্যাল ও নন টেকনিক্যাল পার্ট গুলো যার যত টুকু মনে আছে কমেন্টে জানাইলে আমরা একটা পূর্নাঙ্গ প্রশ্ন পেলে উত্তর দেওয়াটা সহজ হবে।

1. Compare BFS & DFS with examples

2. Explain the time complexity of merge sort. Best, average, Worst.

3. Suppose your dataset has missing values and noise. How would you preprocess it?

4. A voice signal is band-limited to 4 kHz. Each sample is quantized using 256 discrete levels. Find the resulting bit rate in a Pulse Code Modulation (PCM) system.

5. Two separate threads are initialized with the exact same instance of CounterSubsystem and run concurrently to completion. State definitively whether the final value of transactionCounter is guaranteed to be exactly 2000. Name the specific multithreading hazard that occurs here and explain the low-level mechanical steps that cause this behavior.
class CounterSubsystem implements Runnable {
public int transactionCounter = 0;

public void run() {
for (int i = 0; i < 1000; i++) {
transactionCounter++;
}
}
}

6. In a B+ tree, each node can have a maximum of 4 child pointers (order m = 4). From height 0 to height 2 (where height 0 is the root), what is the maximum number of keys that can be stored across all nodes in the tree?

7.
int main() {
int ledger[5] = {10, 20, 30, 40, 50};
int *ptr1 = (int *)(&ledger + 1);
int *ptr2 = (int *)(ledger + 1);
// Note: Assuming the prompt meant to print using the variables defined above.
// If evaluating the exact expression printed in the prompt: *(ptr1 - 1) and *(ptr2 + 2)
printf("%d, %d", *(ptr1 - 1), *(ptr2 + 2));
return 0;
}

8. A system utilizes a 32-bit logical address space and a page size of 2^{20} bytes. If each entry (block) in the Translation Lookaside Buffer (TLB) requires 6 bytes, calculate the total memory required for the TLB to map the entire logical address space

9. Consider a concurrent transaction schedule involving two data items, X and Y:
Transaction 1 (T_1): Read(X), Write(X), Read(Y), Write(Y)
Transaction 2 (T_2): Read(Y), Write(Y), Read(X), Write(X)
Describe how the standard Two-Phase Locking (2PL) protocol treats these transactions if they execute concurrently, identifying the exact operational state (hazard) the system will enter. Contrast this outcome with how the Strict 2PL protocol alters the lock release timeline.

10. Compare between TCP and UDP, their connection, reliability, speed. One real life use case of UDP.

11. Assume a banking application wants to add fingerprint system for their App. Write one functional requirement and one security requirement.