Ministry of Food
Post: Network/Website Manager (CSE)
Exam Date:21-05-2025; Exam Taker: BPSC
1. Explain the concept of polymorphism in Object-oriented Programming with example. ৫
2. Write an Algorithm to detect a cycle in a directed graph.
Cycle Detection in Directed Graph (Using DFS)
Idea:
Use DFS (Depth First Search) and keep track of nodes in the current recursion stack. If we visit a node already in the recursion stack → cycle exists.
Algorithm:
Algorithm DetectCycle(Graph G)
1. For each vertex v in G:
visited[v] = false
recStack[v] = false
2. For each vertex v in G:
if visited[v] == false:
if DFS(v) == true:
return "Cycle Found"
3. Return "No Cycle"
Function DFS(v):
1. visited[v] = true
2. recStack[v] = true
3. For each neighbor u of v:
if visited[u] == false:
if DFS(u) == true:
return true
else if recStack[u] == true:
return true
4. recStack[v] = false
5. return false
3. Design a full adder using two half adders and an OR gate.
4. Compare "Paging" and "Segmentation" memory management technique.
5. What is a Man-in-The-Middle (MitM) attack? How can it be prevented?
6. Write a C program to find the sum of digits of an integer number using "recursion"
#include <stdio.h>
// Recursive function to find sum of digits
int sumDigits(int n) {
if (n == 0)
return 0;
return (n % 10) + sumDigits(n / 10);
}
int main() {
int num;
printf("Enter a number: ");
scanf("%d", &num);
printf("Sum of digits = %d\n", sumDigits(num));
return 0;
}
7. Write down the Pseudo Code for recursive binary search algorithm. Use the following function definition: binarySearch (array, target, low, high)
binarySearch(array, target, low, high):
1. if low > high:
return -1 // not found
2. mid = (low + high) / 2
3. if array[mid] == target:
return mid
4. else if target < array[mid]:
return binarySearch(array, target, low, mid - 1)
5. else:
return binarySearch(array, target, mid + 1, high)
8. Write down the names of different stages of instruction pipelining in a multi-cycle datapath architecture. What is a data-hazard in a pipelined datapath?
9. There are 3 tasks P1. P2, and P3. The arrival time and duration of each task is given below. Apply the round-robin scheduling algorithm with quantum size=20 to schedule the tasks in a single core machine. Calculate the turnaround time for each task. (All tasks have the same priority)
| Task | Arrival time (ms) | Duration (ms) |
|---|---|---|
| P1 | 0 | 40 |
| P2 | 5 | 40 |
| P3 | 10 | 20 |
