Teletalk Bangladesh Ltd.
Post: Assistant Manager (IT)
Exam Date: 2023
1. Minimize the following function in SOP minimal form using K-map.
Question not fully collected
2. Explain knight knave problem.
3. What is CIA Triad?
4. What is MAC flooding? How to prevent MAC flooding?
5. What is the difference between black box and white box testing?
6. Binary search using recursive function.
#include <stdio.h> int recursiveBinarySearch(int array[], int start_index, int end_index, int element) { // Base case: If the element is not present in the array if (end_index >= start_index) { int middle = start_index + (end_index - start_index) / 2; // Check if the element is present at the middle if (array[middle] == element) return middle; // Return the index of the element // If the element is smaller than middle, search the left subarray if (array[middle] > element) return recursiveBinarySearch(array, start_index, middle - 1, element); // If the element is greater than middle, search the right subarray return recursiveBinarySearch(array, middle + 1, end_index, element); } // Element is not found in the array return -1; } int main(void) { int array[] = {1, 4, 7, 9, 16, 56, 70}; // Array should be sorted for binary search int n = 7; // Size of the array int element = 9; // Element to be searched // Call recursive binary search function int found_index = recursiveBinarySearch(array, 0, n - 1, element); // Check if element is found or not if (found_index == -1) { printf("Element not found in the array.\n"); } else { printf("Element found at index: %d\n", found_index); } return 0; }
7. Describe RSA Algorithm and how it works?
8. Find average turnaround time and average waiting time using round robin and FCFS algorithm?
| Process | Arrival Time | Execute Time |
|---|---|---|
| P0 | 0 | 5 |
| P1 | 1 | 3 |
| P2 | 2 | 8 |
| P3 | 3 | 6 |
FCFS
Round Robin with Quantam 3:
9. Explain Primary key, Candidate key, and Foreign key.
10. C programming output problem.
Incomplete Question
