In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is

Consider the following algorithm for searching for a given number x in an unsorted array A[1..n] having n distinct value

The running time of the following algorithm Procedure A(n) If n<=2 return (1) else return (A([$$\sqrt n $$])); is bes

The solution to the recurrence equation T(2k) = 3 T(2k-1) + 1, T (1) = 1, is:

In $$2’s$$ complement addition, the overflow

Sign extension is the step in

The performance of a pipelined processor suffers if

Which of the following is not a form of memory?

In absolute addressing mode

Horizontal micro programming

In serial data transmission, every byte of data is padded with a $$‘0’$$ in the beginning and one or two $$‘1’s$$ at the

In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is

The number of leaf nodes in a rooted tree of n nodes, with each node having 0 or 3 children is:

Relation $$R$$ with an associated set of functional dependencies, $$F,$$ is decomposed into $$BCNF.$$ The redundancy (ar

From the following instance of a relation schema $$R(A, B, C),$$ we can conclude that:

Relation $$R$$ is decomposed using a set of functional dependencies, $$F,$$ and relation $$S$$ is decomposed using anoth

With regard to the expressive power of the formal relational query languages, which of the following statements is true?

A B+ - tree index is to be built on the Name attribute of the relation STUDENT. Assume that all student names are of len

The decimal value $$0.25$$

The $$2's$$ compliment representation of the decimal value $$-15$$ is

Sign extension is the step in

Consider the following logic circuit whose inputs are functions $${f_1},$$ $${f_2},$$ $${f_3},$$ and output is $$f.$$

Transform the following logic circuit (without expressing its switching function) into an equivalent logic circuit that

$$f\left( {A,B} \right) = A' + B$$ Simplified expression for function $$f((x+y,y),z)$$ is

Express the function $$f( x, y, z)= xy'+ yz'$$ with only one complement operation and one or more $$AND/OR$$ operations.

Minimum $$SOP$$ for $$f(w, x, y, z)$$ shown in karnaugh $$-$$ map below is

Consider the following multiplexer where $$10, 11, 12, 13$$ are four data input lines selected by two address line combi

"If X then Y unless Z" is represented by which of the following formulas in propositional logic? (" $$\neg $$ " is negat

Four fair coins are tossed simultaneously. The probability that at least one head and one tail turn up is

The binary relation $$S = \phi $$ (emply set) on set A = {1, 2, 3} is

Determine whether each of the following is a tautology, a contradiction, or neither ("$$ \vee $$" is disjunction, "$$ \w

The minimum number of colors required to color the vertices of a cycle with $$n$$ nodes in such a way that no two adjace

The rank of the matrix$$\left[ {\matrix{ 1 & 1 \cr 0 & 0 \cr } } \right]\,\,is$$

Maximum number of edges in a n - node undirected graph without self loops is

Let $$A$$ be a set of $$n\left( { > 0} \right)$$ elements. Let $${N_r}$$ be the number of binary relations on $$A$$ a

(a) $$S = \left\{ { < 1,2 > ,\, < 2,1 > } \right\}$$ is binary relation on set $$A = \left\{ {1,2,3} \right\

Obtain the eigen values of the matrix $$$A = \left[ {\matrix{ 1 & 2 & {34} & {49} \cr 0 & 2 &amp

The function $$f\left( {x,y} \right) = 2{x^2} + 2xy - {y^3}$$ has

Which of the following scheduling algorithms is non-preemptive?

Draw the process state transition diagram of an $$OS$$ in which (i) each process is in one of the five states: created,

Which combination of the following features will suffice to characterize an $$OS$$ as a multi-programmed $$OS?$$ $$(a).$

Which of the following scheduling algorithms is non-preemptive?

Which of the following is not a form of memory?

The optimal page replacement algorithm will select the page that.

Dynamic linking can cause security concerns because

A computer system uses $$32$$-bit virtual address, and $$32$$-bit physical address. The physical memory is byte addressa

In the index allocation scheme of blocks to a file, the maximum possible size of the file depends on

The results returned by function under value-result and reference parameter passing conventions

In the C language

Consider the following declaration of a two-dimensional array in C: char a[100][100]; Assuming that the main memory is b

The smallest finite automaton which accepts the language $$L = \left. {\left\{ x \right.} \right|$$ length of $$x$$ is

The Finite state machine described by the following state diagram with $$A$$ as starting state, where an arc label is $$

The language accepted by a pushdown Automation in which the stack is limited to $$10$$ items is best described as

Which of the following is true?

The $$C$$ language is: