These questions are basic level ones and can be answered in less than a minute if you have seen the topic.

Recent questions tagged easy

3 votes
1 answer
691
Newton-Raphson method is used to compute a root of the equation $x^2 - 13 = 0$ with 3.5 as the initial value. The approximation after one iteration is3.5753.6763.6673.607...
38 votes
4 answers
692
37 votes
7 answers
693
The minimum number of colours required to colour the following graph, such that no two adjacent vertices are assigned the same color, is$2$$3$$4$$5$
27 votes
5 answers
694
Let $A = 1111 1010$ and $B = 0000 1010$ be two $8-bit$ $2’s$ complement numbers. Their product in $2’s$ complement is$1100 0100$$1001 1100$$1010 0101$$1101 0101$
42 votes
4 answers
695
Two matrices $M_1$ and $M_2$ are to be stored in arrays $A$ and $B$ respectively. Each array can be stored either in row-major or column-major order in contiguous memory ...
27 votes
3 answers
696
The elements $32, 15, 20, 30, 12, 25, 16,$ are inserted one by one in the given order into a maxHeap. The resultant maxHeap is
34 votes
2 answers
697
28 votes
3 answers
698
Consider the following C function:int f(int n) { static int i = 1; if(n >= 5) return n; n = n+i; i++; return f(n); }The value returned by $f(1)$ is:$5$$6$$7$$8$
15 votes
7 answers
699
The problem $\text{3-SAT}$ and $\text{2-SAT}$ are both in $\text{P}$both $\text{NP}$ complete$\text{NP}$-complete and in $\text{P}$ respectivelyundecidable and $\text{NP}...
77 votes
5 answers
700
The tightest lower bound on the number of comparisons, in the worst case, for comparison-based sorting is of the order of$n$$n^2$$n \log n$$n \log^2n$
16 votes
3 answers
701
If a fair coin is tossed four times. What is the probability that two heads and two tails will result?$\frac{3}{8}$$\frac{1}{2}$$\frac{5}{8}$$\frac{3}{4}$
41 votes
4 answers
704
Which of the following addressing modes are suitable for program relocation at run time?Absolute addressingBased addressingRelative addressingIndirect addressingI and IVI...
19 votes
2 answers
705
If $73_x$ (in base-x number system) is equal to $54_y$ (in base $y$-number system), the possible values of $x$ and $y$ are$8, 16$$10, 12$$9, 13$$8, 11$
47 votes
9 answers
706
In an $SR$ latch made by cross-coupling two NAND gates, if both $S$ and $R$ inputs are set to $0$, then it will result in$Q = 0, Q' = 1$$Q = 1, Q' = 0$$Q = 1, Q' = 1$Inde...
28 votes
5 answers
707
A Boolean function $x’y’ + xy + x’y$ is equivalent to$x' + y'$$x + y$$x + y'$$x' + y$
29 votes
2 answers
710
19 votes
3 answers
712
Level order traversal of a rooted tree can be done by starting from the root and performingpreorder traversalin-order traversaldepth first searchbreadth first search
19 votes
4 answers
713
The best data structure to check whether an arithmetic expression has balanced parentheses is aqueuestacktreelist
27 votes
6 answers
714
24 votes
2 answers
717
39 votes
4 answers
718
Which one of the following in place sorting algorithms needs the minimum number of swaps?Quick sortInsertion sortSelection sortHeap sort