Bakhrabad Gas Distribution Company Limited
Post: Assistant Engineer (CSE)
Exam Date: 19-11-2021, Exam Taker: BUET
1. Simplify the Boolean Expression F = ABC'D' + ABC'D+ ABCD+ ABCD'+ AB'C'D + AB'CD + AB'CD'
2. DFS & BFS Tree make from below Graph. When traversal graph note considers alphabetic order.
BFS Traversal order: A B C D E F
DFS Traversal order: A B C D E F
3. Find the step-by-step output of the program-
#include <stdio.h>
int main() {
int i, sum = 0, p;
for (i = -1, p = 0; i <= 10; i = i + 2) {
p = i * i;
if (i > 5)
break;
sum = sum + (i + p);
printf("i = %d p = %d sum = %d\n", i, p, sum);
}
printf("The Outer Loop i = %d p = %d sum = %d", i, p, sum);
return 0;
}
#include <stdio.h>
int main() {
int i, sum = 0, p;
for (i = -1, p = 0; i <= 10; i = i + 2) {
p = i * i;
if (i > 5)
break;
sum = sum + (i + p);
printf("i = %d p = %d sum = %d\n", i, p, sum);
}
printf("The Outer Loop i = %d p = %d sum = %d", i, p, sum);
return 0;
}
i = -1 p = 1 sum = 0 i = 1 p = 1 sum = 2 i = 3 p = 9 sum = 14 i = 5 p = 25 sum = 44 The Outer Loop i = 7 p = 49 sum = 44
4. What is a 3-way handshake in TCP uses it.
