NEW
Font size
WorksheetsTECH FUED ROUND-1
Total questions: 20
Worksheet time: 10mins
Assume that source S and destination D are connected through two intermediate routers labeled R. Determine how many times each packet has to visit the network layer and the data link layer during a transmission from S to D.
Network layer – 4 times and Data link layer – 4 times
Network layer – 4 times and Data link layer – 3 times
Network layer – 4 times and Data link layer – 6 times
Network layer – 2 times and Data link layer – 6 times
In the slow start phase of the TCP congestion control algorithm, the size of the congestion window
does not increase
increases linearly
increases quadratically
increases exponentially
Which of the following statements is false?
Virtual memory implements the translation of a program‘s address space into physical memory address space
Virtual memory allows each program to exceed the size of the primary memory
Virtual memory increases the degree of multiprogramming
Virtual memory reduces the context switching overhead
A process executes the code
fork();
fork();
fork();
The total number of child processes created is
3
4
7
8
The following program consists of 3 concurrent processes and 3 binary semaphores. The semaphores are initialized as S0 = 1, S1 = 0, S2 = 0. How many times will process P0 print '0'?
At least twice
Exactly twice
Exactly thrice
Exactly once
Consider the following statements about process state transitions for a system using preemptive scheduling.
I. A running process can move to ready state.
II. A ready process can move to running state.
III. A blocked process can move to running state.
IV. A blocked process can move to ready state.
Which of the above statements are TRUE ?
I, II, and III only
II and III only
I, II, and IV only
I, II, III and IV only
If the quantum time of round robin algorithm is very large, then it is equivalent to:
First in first out
Shortest Job Next
Lottery scheduling
None of the above
The following postfix expression with single digit operands is evaluated using a stack:
8 2 3 ^ / 2 3 * + 5 1 - *
Note that ^ is the exponentiation operator. The top two elements of the stack after the first * is evaluated are:
6, 1
5, 7
3, 2
1, 5
Assume that the operators +, -, × are left associative and ^ is right associative. The order of precedence (from highest to lowest) is ^, x , +, -. The postfix expression corresponding to the infix expression a + b × c - d ^ e ^ f is
abc × + def ^ ^ -
abc × + de ^ f ^ -
ab + c × d - e ^ f ^
- + a × bc ^ ^ def
Suppose a stack is to be implemented with a linked list instead of an array. What would be the effect on the time complexity of the push and pop operations of the stack implemented using linked list (Assuming stack is implemented efficiently)?
O(1) for insertion and O(n) for deletion
O(1) for insertion and O(1) for deletion
O(n) for insertion and O(1) for deletion
O(n) for insertion and O(n) for deletion
What will be the output of the following C function when EOF returns?
int fputs(char line, FILE fp)
‘ ’ character of array line is encountered
‘n’ character in array line is encountered
‘t’ character in array line is encountered
When an error occurs
Which of the following is a correlated subquery?
Uses the result of an inner query to determine the processing of an outer query.
Uses the result of an outer query to determine the processing of an inner query.
Uses the result of an inner query to determine the processing of an inner query.
Uses the result of an outer query to determine the processing of an outer query.
What is the main disadvantage of using a monolithic kernel compared to a microkernel?
Poor performance
Less modularity
Decreased security
More complex codebase
Consider a node X in a Binary Tree. Given that X has two children, let Y be Inorder successor of X. Which of the following is true about Y?
Y has no right child
Y has no left child
Y has both children
None of the above
Output of following program?
# include <stdio.h>
void fun(int *ptr)
{
*ptr = 30;
}
int main()
{
int y = 20;
fun(&y);
printf("%d", y);
return 0;
}
20
30
Compiler Error
Runtime Error
Consider the following rooted tree with the vertex P labeled as root.
The order in which the nodes are visited during in-order traversal is
SQPTRWUV
SQPTURWV
SQPTWUVR
SQPTRUWV
The in-order and pre-order traversal of a binary tree are d b e a f c g and a b d e c f g respectively. The post order traversal of a binary tree is
e d b g f c a
e d b f g c a
d e b f g c a
d e f g b c a
SQL allows tuples in relations, and correspondingly defines the multiplicity of tuples in the result of joins. Which one of the following queries always gives the same answer as the nested query shown below
select * from R where a in (select S.a from S)
select R.* from R, S where R.a=S.a (D)
select distinct R.* from R,S where R.a=S.a
select R.* from R,(select distinct a from S) as S1 where R.a=S1.a
select R.* from R,S where R.a=S.a and is unique R
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?
255.255.255.0
255.255.255.128
255.255.255.192
255.255.255.224
How many networks and nodes per network, are allowed by the Class B network?
127 networks and 16,777,216 nodes per network
16,384 networks and 65,534 nodes per network
2,097,125 networks and 254 nodes per network
none of the above
