# Recent questions and answers in Others 1
Let $G$ be a connected bipartite simple graph (i.e., no parallel edges) with distinct edge weights. Which of the following statements on $\text{MST}$ (minimum spanning tree) need $\text{NOT}$ be true? $G$ has a unique $\text{MST}$. Every $\text{MST}$ in $G$ ... the second lightest edge. Every $\text{MST}$ in $G$ contains the third lightest edge. No $\text{MST}$ in $G$ contains the heaviest edge.
2
Hi , I need a suggestion from those who got decent rank while studying in m.tech first year at nits/iits. This year I have prepared well but dint get much time to practice. So,I am planning to join m.tech and will appear next time with better preparation. So, Is this possible to give that much time if i join m.tech? And what about the course load there for first two semesters?
3
The Boolean expression $AB+A \overline{B}+\overline{A}C+AC$ is unaffected by the value of the Boolean variable _________. $A$ $B$ $C$ $A, B$ and $C$
1 vote
4
A basic feasible solution of an $m \times n$ transportation problem is said to be non-degenerate, if basic feasible solution contains exactly _______ number of individual allocation in ______ positions. $m+n+1$, independent $m+n-1$, independent $m+n-1$, appropriate $m-n+1$, independent
5
Let $A$ be the base class in $\text{C++}$ and $B$ be the derived class from $A$ with protected inheritance. Which of the following statement is false for class $B$? Member function of class $B$ can access protected data of class $A$ ... $A$ Member function of class $B$ cannot access private data of class $A$ Object of derived class $B$ can access public base class data
6
Piconet is a basic unit of a bluetooth system consisting of __________ master node and up to _________ active slave nodes. one, five one, seven two, eight one, eight
1 vote
7
Let e: B˄m→B˄n be a group code. The minimum distance of ‘e’ is equal to: (A) the maximum weight of a non zero code word (B) the minimum weight of a non zero code word (C) m (D) n
8
Which of the following are legal statements in $C$ programming language? int *P=&44; int *P=&r; int P=&a; int P=a; Choose the correct option: (a) and (b) (b) and (c) (b) and (d) (a) and (d)
9
Consider the following sequence of instructions : $a= a \oplus b, b= a \oplus b, a= b \oplus a$ This Sequence retains the value of the $a$ and $b$ complements the value of $a$ and $b$ swap $a$ and $b$ negates values of $a$ and $b$
10
What is the worst case running time of Insert and Extract-min, in an implementation of a priority queue using an unsorted array? Assume that all the insertions can be accomodated. $\theta(1), \theta(n)$ $\theta(n), \theta(1)$ $\theta(1), \theta(1)$ $\theta(n), \theta(n)$
11
Java Virtual Machine $\text{(JVM)}$ is used to execute architectural neutral byte code. Which of the following is needed by the $\text{JVM}$ for execution of Java Code? Class loader only Class loader and Java Interpreter Class loader, Java Interpreter and $\text{API}$ Java Interpreter only
12
Which of the following $\text{CPU}$ scheduling algorithms is/are supported by $\text{LINUX}$ operating system? Non-preemptive priority scheduling Preemptive priority scheduling and time sharing $\text{CPU}$ scheduling Time sharing scheduling only Priority scheduling only
13
Which of the following is not needed by an encryption algorithm used in Cryptography? $\text{KEY}$ Message Ciphertext User details
1 vote
14
What are the greatest lower bound $\text{(GLB)}$ and the least upper bound $\text{(LUB)}$ of the sets $A= \{ 3, 9, 12 \}$ and $B=\{1,2,4,5,10 \}$ if they exist in poset $(z^+, / )$? $\text{A(GLB – 3, LUB – 36); B(GLB – 1, LUB – 20)}$ $\text{A(GLB – 3, LUB – 12); B(GLB – 1, LUB – 10)}$ $\text{A(GLB – 1, LUB – 36); B(GLB – 2, LUB – 20)}$ $\text{A(GLB – 1, LUB – 12); B(GLB – 2, LUB – 10)}$
15
Which tag is used to enclose any number of javascript statements in HTML document? <code> <script> <title> <body>
16
Which of the component module of $\text{DBMS}$ does rearrangement and possible ordering of operations, eliminate redundancy in query and use efficient algorithms and indexes during the execution of a query? query compiler query optimizer Stored data manager Database processor
1 vote
17
Let $P$ be the set of all people. Let $R$ be a binary relation on $P$ such that $(a, b)$ is in $R$ if $a$ is a brother of $b$. Is $R$ symmetric transitive, an equivalence relation, a partial order relation? $\text{NO, NO, NO, NO}$ $\text{NO, NO, YES, NO}$ $\text{NO, YES, NO, NO}$ $\text{NO, YES, YES, NO}$
18
A micro instruction format has microoperation field which is divided into $2$ sunbfields $F1$ and $F2$ , each having $15$ distinct microoperations, condition field $\text{CD}$ for four status bits, branch field $\text{BR}$ having four options used in conjunction with address field $\text{AD}$. The address space is of $128$ memory words. The size of micro instruction is: $19$ $18$ $17$ $20$
19
An organization needs to maintain database having five attributes $\textbf{A, B, C, D, E}$. These attributes are functionally dependent on each other for which functionality dependency set $F$ ... normal form in which relation $R$ belong to $1 \text{ NF}$ $2 \text{ NF}$ $3 \text{ NF}$ $\text{BCNF}$
20
How many reflexive relations are there on a set with $4$ elements? $2^4$ $2^{12}$ $4^2$ $2$
21
What is the output of the following $C$ program? # include <stdio.h> main () { int i, j, x=0; for (i=0; i<5; ++i) for (j=0; j<i; ++j) { x+=(i+j-1); break; } printf(“%d”, x); } $6$ $5$ $4$ $3$
22
What is the prefix expression corresponding to the expression: $\left ( \left ( 9+8 \right ) \ast 7+\left ( 6\ast \left ( 5+4 \right ) \right )\ast 3\right )+2?$ You may assume that $\ast$ has precedence over $+$? $\ast + +\: 987 \ast \ast \: 6 + + \:5432$ ... $+ + \ast +\: 987 \ast \ast \: 6 + \:5432$ $+ \ast + \ast \: 987+ + \: 6 \ast \:5432$
23
Given the following definition of the function $foo$, what does $foo(1037,2)$ return? Note that $a//b$ denotes the quotient (integer part) of $a\div b$, for integers $a$ and $b$. For instance $7//3$ is $2$. function foo(n,d) { x:=0; while(n>=1) { x:=x+1; n:=n//d; } return(x); }
24
A non-pipelined system takes $\text{30ns}$ to process a task. The same task can be processed in a four-segment pipeline with a clock cycle of $\text{10ns}$. Determine the speed up of the pipeline for $100$ tasks. $3$ $4$ $3.91$ $2.91$
25
A flow graph $F$ with entry node $(1)$ and exit node $(11)$ is shown below: What is the cyclomatic complexity of flowgraph $F$? $2$ $3$ $4$ $5$
26
A flow graph $\textsf{F}$ with entry node $(1)$ and exit node $(11)$ is shown below: How many nodes are there in flowgraph $\text{F}$ $9$ $10$ $11$ $12$
27
A flow graph $F$ with entry node $(1)$ and exit node $(11)$ is shown below: How many predicate nodes are there and what are their names? Three: $(1,(2,3),6)$ Three: $(1,4,6)$ Four: $((2,3), 6, 10, 11)$ Four: $((2,3), 6, 9, 10)$
28
A flow graph $F$ with entry node $(1)$ and exit node $(11)$ is shown below: How many regions are there in flowgraph $F$? $2$ $3$ $4$ $5$
29
Consider the following Linear programming problem $\text{(LPP)}$: Maximize $z=x_1+x_2$ Subject to the constraints: $x_1+2x_2 \leq 2000 \\ x_1+x_2 \leq 1500 \\ x_2 \leq 600 \\ \text{and } x_1, x_2 \geq 0$ The solution of the above $\text{LPP}$ is $x_1=750, x_2= 750, z=1500$ $x_1=500, x_2= 1000, z=1500$ $x_1=1000, x_2= 500, z=1500$ $x_1=900, x_2= 600, z=1500$
30
A tree has $2n$ vertices of degree $1$, $3n$ vertices of degree $2$, $n$ vertices of degree $3$. Determine the number of vertices and edges in tree. $12, 11$ $11, 12$ $10, 11$ $9, 10$
31
Given following equation: $(142)_b + (112)_{b-2} = (75)_8$, find base $b$. $3$ $6$ $7$ $5$
1 vote
32
Let $M$ be an $n \times m$ real matrix. Consider the following: Let $k_{1}$ be the smallest number such that $M$ can be factorized as $A \cdot B$, where $A$ is an $n \times k_{1}$ and $B$ is a $k_{1} \times m$ matrix. Let $k_{2}$ ... $k_{2}= k_{3}< k_{1}$ $k_{1}= k_{2}= k_{3}$ No general relationship exists among $k_{1}, k_{2}$ and $k_{3}$
1 vote
33
The weight of minimum spanning tree in graph $G$, calculated using Kruskal’s algorithm is: $14$ $15$ $17$ $18$
34
An organization needs to maintain database having five attributes $\textbf{A, B, C, D, E}$. These attributes are functionally dependent on each other for which functionality dependency set $F$ ... primary key of table $R$ with functional dependency set $F$ $\textbf{BC}$ $\textbf{AD}$ $\textbf{A}$ $\textbf{AB}$
35
Consider a paging system where translation look aside buffer ($\textsf{TLB}$) a special type of associative memory is used with hit ratio of $80 \%$. Assume that memory reference takes $80$ nanoseconds and reference time to $\textsf{TLB}$ is $20$ nanoseconds. ... will be the effective memory access time given $80\%$ hit ratio? $110$ nanoseconds $116$ nanoseconds $200$ nanoseconds $100$ nanoseconds
36
Given two tables $R1(x,y)$ and $R2(y,z)$ with $50$ and $30$ number of tuples respectively. Find maximum number of tuples in the output of natural join between tables $R1$ and $R2$ i.e. $R1 * R2$? ($*$- Natural Join) $30$ $20$ $50$ $1500$
37
A computer uses a memory unit of $512\:K$ words of $32$ bits each. A binary instruction code is stored in one word of the memory. The instruction has four parts: an addressing mode field to specify one of the two-addressing mode (direct and indirect), an operation code, a register code part to specify one of ... part and the address part? $1, 3, 9, 19$ $1, 4, 9, 18$ $1, 4, 8, 19$ $1, 3, 8, 20$
1 vote
$(A+B) \bar{AB}$ is equivalent to $A \bigoplus B$ $A \bigodot B$ $(A \bigoplus B) \bigodot A$ $(A \bigodot B) \bigoplus A$
Consider the following circuit : to make it a Tautology the $?$ should be : $\text{NAND}$ gate $\text{AND}$ gate $\text{OR}$ gate $\text{EX-OR}$ gate
The following program is stored in the memory unit of the basic computer. Give the content of accumulator register in hexadecimal after the execution of the program. ... $\text{A}1\text{B}4$ $81\text{B}4$ $\text{A}184$ $8184$