TECH FUED ROUND-1

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