Given below are some algorithms, and some algorithm design paradigms. .tg {border-collapse:collapse;border-spacing:0;b

A Young tableau is a $$2D$$ array of integers increasing from left to right and from top to bottom. Any unfilled entries

Suppose you are provided with the following function declaration in the C programming language. int partition(int a[],

An unordered list contains $$n$$ distinct elements. The number of comparisons to find an element in this list that is ne

Consider two decision problems $${Q_1},{Q_2}$$ such that $${Q_1}$$ reduces in polynomial time to $$3$$-$$SAT$$ and $$3$$

Consider the intermediate code given below. (1) i = 1 (2) j = 1 (3) t1 = 5 ∗ i (4) t2 = t1 + j (5) t3 = 4 ∗ t2 (6)

In the context of abstract-syntax-tree $$(AST)$$ and control-flow-graph $$(CFG),$$ which one of the following is TRUE?

Match the following: .tg {border-collapse:collapse;border-spacing:0;border-color:#999;} .tg td{font-family:Arial, san

A link has a transmission speed of 106 bits/sec. It uses data packets of size 1000 bytes each. Assume that the acknowled

Two hosts are connected via a packet switch with 107 bits per second links. Each link has a propagation delay of 20 micr

Host A sends a UDP datagram containing 8880 bytes of user data to host B over an Ethernet LAN. Ethernet frames may carry

Consider the following routing table at an IP router: For each IP address in Group I identify the correct choice of the

Identify the correct order in which a server process must invoke the function calls accept, bind, listen, and recv accor

Assume that the bandwidth for a TCP connection is 1048560 bits/sec. Let $$\alpha $$ be the value of RTT in milliseconds(

Consider the sequence of machine instructions given below: .tg {border-collapse:collapse;border-spacing:0;border:none

Consider a typical disk that rotates at $$15000$$ rotations per minute $$(RPM)$$ and has a transfer rate of $$50 \times

Consider a processor with byte-addressable memory. Assume that all registers, including Program Counter $$(PC)$$ and Pro

Assume that for a certain processor, a read request takes $$50$$ nanoseconds on a cache miss and $$5$$ nanoseconds on a

Which one of the following hash functions on integers will distribute keys most uniformly over $$10$$ buckets numbered $

Consider a complete binary tree where the left and the right sub-trees of the root are max-heaps. The lower bound for th

A binary tree $$T$$ has $$20$$ leaves. The number of nodes in $$T$$ having two children is _______________.

Consider the following transaction involving two bank accounts x and y. read (x) ; x: = x - 50; write (x); read (y); y:

Consider a simple checkpointing protocol and the following set of operations in the log. (start, $$T4$$); (write, $$T4,

Consider two relations $${R_1}\left( {A,B} \right)$$ with the tuples $$(1,5), (3,7)$$ and $${R_2}\left( {A,C} \right) =

With reference to the B+ tree index of order 1 shown below, the minimum number of nodes (including the Root node) that m

The number of min-terms after minimizing the following Boolean expression is _______________ . $$$\left[ {D' + AB' + A'

A half adder is implemented with $$XOR$$ and $$AND$$ gates. A full adder is implemented with two half adders and one $$O

The minimum number of $$JK$$ flip-flops required to construct a synchronous counter with the count sequence $$\left( {0,

Let $$X$$ and $$Y$$ denote the sets containing $$2$$ and $$20$$ distinct objects respectively and $$𝐹$$ denote the set

The number of onto functions (subjective functions) from set $$X = \left\{ {1,2,3,4} \right\}$$ to set $$Y = \left\{ {a

Which one of the following well formed formulae is a tautology?

In a connected graph, bridge is an edge whose removal disconnects a graph. Which one of the following statements is true

A graph is self-complementary if it is isomorphic to its complement. For all self-complementary graphs on $$n$$ vertices

Let $$𝑅$$ be the relation on the set of positive integers such that $$aRb$$ if and only if $$𝑎 $$ and $$𝑏$$ are disti

The larger of the two eigenvalues of the matrix $$\left[ {\matrix{ 4 & 5 \cr 2 & 1 \cr } } \right]$$

Let $$\,\,f\left( x \right) = {x^{ - \left( {1/3} \right)}}\,\,$$ and $${\rm A}$$ denote the area of the region bounded

Consider the following two statements. $$S1:$$ If a candidate is known to be corrupt, then he will not be elected $$S2:$

The cardinally of the power set of $$\left\{ {0,1,2,\,\,....,\,\,10} \right.\left. \, \right\}$$ is _____________.

Perform the following operations on the matrix $$\left[ {\matrix{ 3 & 4 & {45} \cr 7 & 9 & {105}

The number of divisors of $$2100$$ is ___________.

Consider six memory partitions of sizes $$200$$ $$KB,$$ $$400$$ $$KB,$$ $$600$$ $$KB,$$ $$500$$ $$KB,$$ $$300$$ $$KB$$ a

A computer system implements $$8$$ kilobyte pages and a $$32$$-bit physical address space. Each page table entry contain

A system has 6 identical resources and N processes competing for them. Each process can request atmost 2 resources. Whic

A computer system implements a $$40$$-bit virtual address, page size of $$8$$ kilobytes, and a $$128$$-entry translation

Consider the following function written in the C programming language. void foo(char *a){ if ( *a && *a != ' ')

Consider the C program below. #include < stdio.h > int *A, stkTop; int stkFunc(int opcode, int val) { static

Consider the following C function. int fun ( int n ) {    int x = 1, k ;    if ( n == 1) return x ;

Consider the basic $$COCOMO$$ model where $$E$$ is the effort applied in person-months, $$D$$ is the development time in

Which one of the following assertions concerning code inspection and code walk-through is true?

A software requirements specification $$(SRS)$$ document should avoid discussing which one of the following?

The number of states in the minimal deterministic finite automaton corresponding to the regular expression $${\left( {0

Which of the following languages is/are regular? $${L_1}:\left\{ {wx{w^R}|w,x\, \in \left\{ {a,b} \right\}{}^ * } \right

Consider the alphabet $$\sum { = \left\{ {0,1} \right\},} $$ the null/empty string $$\lambda $$ and the sets of strings

Consider the following statements. $$\,\,\,$$ $${\rm I}.\,\,\,\,\,\,\,\,\,$$ The complement of every Turing decidable la

Which one of the following statements is NOT correct about $$HTTP$$ cookies?