Date of Visit : 11.08.2018
Criteria : 6.0 and above (No Current Arrear)
ROUND 1
Duration : 1 hr
This round composed of both written and online test
Each one happened for 30 Minutes consecutively without any filtration.
There is no negative grading.
This is a MCQ type round.
Both test covered OS Topics like Job Scheduling,Process,Dead lock detection and avoidance algorithm,semaphore,Output for C programs,Network Topics from sub net mask problems,TCP header information,Purpose of Time To Live (TTL),DBMS queries from natural join,left join,join,Age Problems,Data structure
1. Here are some words translated from an artificial language.
migenlasan means cupboard
lasanpoen means boardwalk
cuopdansa means pullman
Which word could mean "walkway"?
A. poenmigen
B. cuopeisel
C. lasandansa
D. poenforc
2. Consider three processes (process id 0, 1, 2 respectively) with compute time bursts 2, 4 and 8 time units. All processes arrive at time zero. Consider the longest remaining time first (LRTF) scheduling algorithm. In LRTF ties are broken by giving priority to the process with the lowest process id. The average turn around time is:
A. 13 units
B. 14 units
C. 15 units
D. 16 units
3. Consider three processes, all arriving at time zero, with total execution time of 10, 20 and 30 units, respectively. Each process spends the first 20% of execution time doing I/O, the next 70% of time doing computation, and the last 10% of time doing I/O again. The operating system uses a shortest remaining compute time first scheduling algorithm and schedules a new process either when the running process gets blocked on I/O or when the running process finishes its compute burst. Assume that all I/O operations can be overlapped as much as possible. For what percentage of time does the CPU remain idle?
A. 0%
B. 10.6%
C. 30.0%
D. 89.4%
4. An operating system uses Shortest Remaining Time first (SRT) process scheduling algorithm. Consider the arrival times and execution times for the following processes:
Process Execution time Arrival time
P1 20 0
P2 25 15
P3 10 30
P4 15 45
5. What is the total waiting time for process P2?
A. 5
B. 15
C. 40
D. 55
6. What is the number of binary search trees with 20 nodes with elements 1, 2, 3,…..20 such that the root of tree is 12 and the root of left subtree is 7?
(A) 2634240
(B) 1243561
(C) 350016
(D) 2642640
7. What is the time complexity of Build Heap operation. Build Heap is used to build a max(or min) binary heap from a given array. Build Heap is used in Heap Sort as a first step for sorting.
A. O(nLogn)
B. O(n^2)
C. O(Logn)
D. O(n)
8. A priority queue is implemented as a Max-Heap. Initially, it has 5 elements. The level-order traversal of the heap is: 10, 8, 5, 3, 2. Two new elements 1 and 7 are inserted into the heap in that order. The level-order traversal of the heap after the insertion of the elements is:
A. 10, 8, 7, 3, 2, 1, 5
B. 10, 8, 7, 2, 3, 1, 5
C. 10, 8, 7, 1, 2, 3, 5
D. 10, 8, 7, 5, 3, 2, 1
9. You have an array of n elements. Suppose you implement quicksort by always choosing the central element of the array as the pivot. Then the tightest upper bound for the worst case performance is
A. O(n^2)
B. O(nLogn)
C. Theta(nLogn)
D. O(n^3)
10. Suppose computers A and B have IP addresses 10.105.1.113 and 10.105.1.91 respectively and they both use the same netmask N. Which of the values of N given below should not be used if A and B should belong to the same network?
(A) 255.255.255.0
(B) 255.255.255.128
(C) 255.255.255.192
(D) 255.255.255.224
11. Which of the following transport layer protocolss is used to support electronic mail?
(A) SMTP
(B) IP
(C) TCP
(D) UDP
12. In Ethernet when Manchester encoding is used, the bit rate is:
(A) Half the baud rate.
(B) Twice the baud rate.
(C) Same as the baud rate.
(D) none of the above
13. Two computers C1 and C2 are configured as follows. C1 has IP address 203.197.2.53 and netmask 255.255.128.0. C2 has IP address 203.197.75.201 and netmask 255.255.192.0. which one of the following statements is true?
(A) C1 and C2 both assume they are on the same network
(B) C2 assumes C1 is on same network, but C1 assumes C2 is on a different network
(C) C1 assumes C2 is on same network, but C2 assumes C1 is on a different network
(D) C1 and C2 both assume they are on different networks
ROUND 2
Duration : 45 min
1) Sum of subarray (not very sure)
2) Given a Binary Search Tree (BST) and a range [min, max], remove all keys which are outside the given range. The modified tree should also be BST. For example, consider the following BST and range [-10, 13].
Solution
3) To generate a Hosoyas triangle of given depth
Eg: n=5
1
1 1
2 1 2
3 2 2 3
5 3 4 3 5
Criteria : 6.0 and above (No Current Arrear)
ROUND 1
Duration : 1 hr
This round composed of both written and online test
Each one happened for 30 Minutes consecutively without any filtration.
There is no negative grading.
This is a MCQ type round.
Both test covered OS Topics like Job Scheduling,Process,Dead lock detection and avoidance algorithm,semaphore,Output for C programs,Network Topics from sub net mask problems,TCP header information,Purpose of Time To Live (TTL),DBMS queries from natural join,left join,join,Age Problems,Data structure
1. Here are some words translated from an artificial language.
migenlasan means cupboard
lasanpoen means boardwalk
cuopdansa means pullman
Which word could mean "walkway"?
A. poenmigen
B. cuopeisel
C. lasandansa
D. poenforc
2. Consider three processes (process id 0, 1, 2 respectively) with compute time bursts 2, 4 and 8 time units. All processes arrive at time zero. Consider the longest remaining time first (LRTF) scheduling algorithm. In LRTF ties are broken by giving priority to the process with the lowest process id. The average turn around time is:
A. 13 units
B. 14 units
C. 15 units
D. 16 units
3. Consider three processes, all arriving at time zero, with total execution time of 10, 20 and 30 units, respectively. Each process spends the first 20% of execution time doing I/O, the next 70% of time doing computation, and the last 10% of time doing I/O again. The operating system uses a shortest remaining compute time first scheduling algorithm and schedules a new process either when the running process gets blocked on I/O or when the running process finishes its compute burst. Assume that all I/O operations can be overlapped as much as possible. For what percentage of time does the CPU remain idle?
A. 0%
B. 10.6%
C. 30.0%
D. 89.4%
4. An operating system uses Shortest Remaining Time first (SRT) process scheduling algorithm. Consider the arrival times and execution times for the following processes:
Process Execution time Arrival time
P1 20 0
P2 25 15
P3 10 30
P4 15 45
5. What is the total waiting time for process P2?
A. 5
B. 15
C. 40
D. 55
6. What is the number of binary search trees with 20 nodes with elements 1, 2, 3,…..20 such that the root of tree is 12 and the root of left subtree is 7?
(A) 2634240
(B) 1243561
(C) 350016
(D) 2642640
7. What is the time complexity of Build Heap operation. Build Heap is used to build a max(or min) binary heap from a given array. Build Heap is used in Heap Sort as a first step for sorting.
A. O(nLogn)
B. O(n^2)
C. O(Logn)
D. O(n)
8. A priority queue is implemented as a Max-Heap. Initially, it has 5 elements. The level-order traversal of the heap is: 10, 8, 5, 3, 2. Two new elements 1 and 7 are inserted into the heap in that order. The level-order traversal of the heap after the insertion of the elements is:
A. 10, 8, 7, 3, 2, 1, 5
B. 10, 8, 7, 2, 3, 1, 5
C. 10, 8, 7, 1, 2, 3, 5
D. 10, 8, 7, 5, 3, 2, 1
9. You have an array of n elements. Suppose you implement quicksort by always choosing the central element of the array as the pivot. Then the tightest upper bound for the worst case performance is
A. O(n^2)
B. O(nLogn)
C. Theta(nLogn)
D. O(n^3)
10. Suppose computers A and B have IP addresses 10.105.1.113 and 10.105.1.91 respectively and they both use the same netmask N. Which of the values of N given below should not be used if A and B should belong to the same network?
(A) 255.255.255.0
(B) 255.255.255.128
(C) 255.255.255.192
(D) 255.255.255.224
11. Which of the following transport layer protocolss is used to support electronic mail?
(A) SMTP
(B) IP
(C) TCP
(D) UDP
12. In Ethernet when Manchester encoding is used, the bit rate is:
(A) Half the baud rate.
(B) Twice the baud rate.
(C) Same as the baud rate.
(D) none of the above
13. Two computers C1 and C2 are configured as follows. C1 has IP address 203.197.2.53 and netmask 255.255.128.0. C2 has IP address 203.197.75.201 and netmask 255.255.192.0. which one of the following statements is true?
(A) C1 and C2 both assume they are on the same network
(B) C2 assumes C1 is on same network, but C1 assumes C2 is on a different network
(C) C1 assumes C2 is on same network, but C2 assumes C1 is on a different network
(D) C1 and C2 both assume they are on different networks
ROUND 2
Duration : 45 min
1) Sum of subarray (not very sure)
2) Given a Binary Search Tree (BST) and a range [min, max], remove all keys which are outside the given range. The modified tree should also be BST. For example, consider the following BST and range [-10, 13].
Solution
3) To generate a Hosoyas triangle of given depth
Eg: n=5
1
1 1
2 1 2
3 2 2 3
5 3 4 3 5
Comments
Post a Comment