Which of the following is the tightest upper bound that represents the number of swaps required to sort n numbers using

Which one of the following is the tightest upper bound that represents the time complexity of inserting an object in to

What is the time complexity of Bellman-Ford single-source shortest path algorithm on a complete graph of n vertices?

The number of elements that can be stored in $$\Theta (\log n)$$ time using heap sort is

Consider the following operation along with Enqueue and Dequeue operations on queues, where k is a global parameter. Mul

Consider the following function: int unknown(int n) { int i, j, k = 0; for (i = n/2; i <= n; i++) fo

Which of the following statements are TRUE? 1. The problem of determining whether there exists a cycle in an undirected

What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon and uni

Consider the following two sets of LR(1) items of an LR(1) grammar. $$\eqalign{ & X \to c.X,\,c/d\,\,\,\,\,\,\,\,X

The transport layer protocols used for real time multimedia, file transfer, DNS and email, respectively are

Assume that source S and destination D are connected through two intermediate routers labeled R. Determine how many time

Determine the maximum length of cable (in km) for transmitting data at a rate of 500 Mbps in an Ethernet LAN with frames

In an IPv4 datagram, the M bit is 0, the value of HLEN is 10, the value of total length is 400 and the fragment offset v

Using public key cryptography, X adds a digital signature σ to message M, encrypts, and sends it to Y, where it is decry

In a $$k$$-way set associative cache, the cache is divided into $$v$$ sets, each of which consists of $$k$$ lines. The l

A $$RAM$$ chip has a capacity of $$1024$$ words of $$8$$ bits each $$\left( {1K \times 8} \right).$$ The number of $$2 \

Consider an instruction pipeline with five stages without any branch prediction: Fetch Instruction $$(FI),$$ Decode Inst

Consider a hypothetical processor with an instruction of type $$LW$$ $$R1, 20(R2),$$ which during execution reads a $$32

Consider the following sequence of micro-operations $$\eqalign{ & \,\,\,\,\,\,\,\,\,\,\,\,\,MBR\,\,\,\,\,\,\, \lef

The preorder traversal sequence of a binary search tree is 30, 20, 10, 15, 25, 23, 39, 35, 42. Which one of the followin

Consider the following relational schema. Students(rollno: integer, sname: string) Courses(courseno: integer, cname: str

An index is clustered, if

Relation $$R$$ has eight attribution $$ABCDEFGH.$$ Fields of $$R$$ contain only atomic values. $$F = \left\{ {CH \to G,\

Relation $$R$$ has eight attribution $$ABCDEFGH.$$ Fields of $$R$$ contain only atomic values. $$F = \left\{ {CH \to G,\

In the following truth table $$V=1$$ if and only if the input is valid. What function does the truth table represent?

The smallest integer that can be represented by an $$8$$-bit number in $$2's$$ complement form is

Which one of the following expressions does NOT represent exclusive NOR of $$x$$ and $$y?$$

What is the logical translation of the following statement? "None of my friends are perfect."

Which one of the following is NOT logically equivalent to $$\neg \exists x\left( {\forall y\left( \alpha \right) \wedge

A Binary operation $$ \oplus $$ on a set of integers is defined as $$x$$ $$ \oplus $$ $$y$$ $$ = {x^2} + {y^2}$$. Whi

Which one of the following functions is continuous at $$x = 3$$?

Function $$f$$ is known at the following points: The value of $$\int\limits_0^3 {f\left( x \right)dx} $$ computed usi

Consider an undirected random$$^ \circ $$ graph of eight vertices. The probability that there is an edge between a pair

Which of the following statements is/are TRUE for undirected graphs? P: Number of odd degree vertices is even. Q:

The line graph $$L(G)$$ of a simple graph $$G$$ is defined as follows: $$\,\,\,\,$$There is exactly one vertex $$v(e)$$

Which of the following does not equal $$\left| {\matrix{ 1 & x & {{x^2}} \cr 1 & y & {{y^2}} \

Which one of the following functions is continuous at $$x=3?$$

Suppose p is the number of cars per minute passing through a certain road junction between 5PM and 6PM and p has a poiss

A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with priorit

Three concurrent processes X, Y, and Z execute three different code segments that access and update certain shared varia

A shared variable x, initialized to zero, is operated on by four concurrent processes W, X, Y, Z as follows. Each of the

A certain computation generates two arrays a and b such that a[i]=f(i)for 0 ≤ i < n and b[i] = g (a[i] )for 0 ≤ i &lt

What is the return value of f (p, p), if the value of p is initialized to 5 before the call? Note that the first paramet

The following figure represents access graphs of two modules $$M1$$ and $$M2.$$ The filled circles represent methods and

The procedure given below is required to find and replace certain characters inside an input character string supplied i

The procedure given below is required to find and replace certain characters inside an input character string supplied i

Which of the following is/are undecidable? $$1.$$ $$G$$ is a $$CFG.$$ Is $$L\left( G \right) = \Phi ?$$ $$2.$$ $$G$$ is

Consider the languages $${L_1} = \phi $$ and $${L_2} = \left\{ a \right\}.$$ Which one of the following represents $${L_

Consider the following languages $${L_1} = \left\{ {{0^p}{1^q}{0^r}\left| {p,q,r \ge 0} \right.} \right\}$$ $${L_2} = \

Consider the $$DFA$$ $$A$$ given below. Which of the following are FALSE? $$1.$$ Complement of $$L(A)$$ is context - f

Which of the following statements is/are FALSE? $$1.$$ For every non-deterministic Turing machine, there exists an equiv