Rupantarita Prakritik Gas Company Limited
Post: AGM (ICT)
Exam Date: 2022, Exam Taker: BUET
1. Write a C program: input: programming then taking input: gram Output: programming without having the gram from string
#include <stdio.h>
#include <string.h>
int main() {
char str[100], word[20];
int i, j, lw, pos = -1;
// Taking input from user
printf("Enter the main string: ");
fgets(str, sizeof(str), stdin);
printf("Enter the word to remove: ");
fgets(word, sizeof(word), stdin);
// Remove newline characters
str[strcspn(str, "\n")] = '\0';
word[strcspn(word, "\n")] = '\0';
int ls = strlen(str);
lw = strlen(word);
// Find the word in the string
for (i = 0; i <= ls - lw; i++) {
for (j = 0; j < lw; j++) {
if (str[i + j] != word[j])
break;
}
if (j == lw) {
pos = i;
break;
}
}
// Remove the word if found
if (pos != -1) {
for (i = pos; i < ls - lw; i++) {
str[i] = str[i + lw];
}
str[ls - lw] = '\0';
}
printf("New String = %s\n", str);
return 0;
}
Sample I/O:
Enter the main string: Programming
Enter the word to remove: gram
New String = Proming
=== Code Execution Successful ===
2. Wirte the Complexity best case, worst case: binary search, quick sort, DFS.
| Algorithm Name | Worst Case | Average Case | Best Case |
|---|---|---|---|
| Binary Search | O(logn) | O(logn) | O(1) |
| Quick Sort | O(n^2) | O(nlogn) | O(nlogn) |
| DFS | O(E+V) | O(V+E) | O(1) |
3. What is Starvation in SJF? Write the name of Starvation free scheduling algorithm.
4. Name four information stored in PCB.
