Recent questions tagged multiple-selects

For the initial state of $000$, the function performed by the arrangement of the $\text{J-K}$ flip-flops in figure is:Shift Register$\text{Mod- 3}$ Counter$\text{Mod- 6}$...

Let $f(n)=\Omega(n), g(n)=O(n)$ and $h(n)=\Theta(n)$. Then $g(n)+f(n).h(n)=$...................$\Omega(n)$$\Omega(n^2)$$\Theta(n)$$\Theta(n^2)$

Consider the following two functions:$g_1(n) = \begin{cases} n^3 \text{ for } 0 \leq n \leq 10,000 \\ n^2 \text{ for } n 10,000 \end{cases}$$g_2(n) = \begin{cases} n \te...

Consider a simple connected graph $G$ with $n$ vertices and $n$ edges $(n 2)$. Then, which of the following statements are true?$G$ has no cyclesThe graph obtained by re...

Consider a system having $m$ resources of the same type. These resources are shared by $3$ processes $A, B$, and $C$ which have peak demands of $3, 4$, and $6$ respective...

A simple two-pass assembler does the following in the first pass:It allocates space for the literals.It computes the total length of the program.It builds the symbol tabl...

Which of the following statements is false? A tree with a $n$ nodes has $(n – 1)$ edges A labeled rooted binary tree can be uniquely constructed given its postorder and p...

The string $1101$ does not belong to the set represented by$110^*(0 + 1)$$1(0 + 1)^*101$$(10)^*(01)^*(00 + 11)^*$$(00 + (11)^*0)^*$

A certain processor supports only the immediate and the direct addressing modes. Which of the following programming language features cannot be implemented on this proces...

The main difference(s) between a CISC and a RISC processor is/are that a RISC processor typicallyhas fewer instructionshas fewer addressing modeshas more registersis easi...

Zero has two representations inSign-magnitude$2's$ complement$1's$ complementNone of the above

Which of the following is/are advantage(s) of virtual memory?Faster access to memory on an average.Processes can be given protected address spaces.Linker can assign addre...

A multi-user, multi-processing operating system cannot be implemented on hardware that does not supportAddress translationDMA for disk transferAt least two modes of CPU e...

Which of the following sets of component(s) is/are sufficient to implement any arbitrary Boolean function?XOR gates, NOT gates$2$ to $1$ multiplexersAND gates, XOR gatesT...

If $L1$ is context free language and $L2$ is a regular language which of the following is/are false?$L1-L2$ is not context free$L1 \cap L2$ is context free$\sim L1$ is co...

Let $L$ be a set with a relation $R$ which is transitive, anti-symmetric and reflexive and for any two elements $a, b \in L$, let the least upper bound $lub (a, b)$ and ...

The function $f\left(x,y\right) = x^2y - 3xy + 2y +x$ hasno local extremumone local minimum but no local maximumone local maximum but no local minimumone local minimum an...

Simpson's rule for integration gives exact result when $f(x)$ is a polynomial of degree$1$$2$$3$$4$

The differential equation $\frac{d^2 y}{dx^2}+\frac{dy}{dx}+\sin y =0$ is:linearnon- linear ...

The eigen vector $(s)$ of the matrix $$\begin{bmatrix} 0 &0 &\alpha\\ 0 &0 &0\\ 0 &0 &0 \end{bmatrix},\alpha \neq 0$$ is (are)$(0,0,\alpha)$$(\alpha,0,0)$$(0,0,1)$$(0,\al...

In which of the cases stated below is the following statement true?"For every non-deterministic machine $M_{1}$ there exists an equivalent deterministic machine $M_{2}$ r...

Context-free languages are:closed under unionclosed under complementationclosed under intersectionclosed under Kleene closure

Consider the $\text{SLR(1)}$ and $\text{LALR (1)}$ parsing tables for a context free grammar. Which of the following statement is/are true?The goto part of both tables m...

For a context free grammar, FOLLOW(A) is the set of terminals that can appear immediately to the right of non-terminal $A$ in some "sentential" form. We define two sets L...

Which of the following is an example of a spooled device?The terminal used to input data for a program being executed.The secondary memory device in a virtual memory syst...

A computer system has $6$ tape devices, with n processes competing for them. Each process may need $3$ tape drives. The maximum value of n for which the system is guarant...

A $2-3$ tree is such thatAll internal nodes have either $2$ or $3$ childrenAll paths from root to the leaves have the same lengthThe number of internal nodes of a $2-3$ t...

Which of the following problems is not $\text{NP}$-hard?Hamiltonian circuit problemThe $0/1$ Knapsack problemFinding bi-connected components of a graphThe graph coloring ...