1 vote
1
How to solve it(clear explanation please)
2
The elements $42, 25, 30, 40, 22, 35, 26$ are inserted one by one in the given order into a max-heap. The resultant max-heap is sorted in an array implementation as $<42, 40, 35, 25, 22, 30, 26>$ $<42, 35, 40, 22, 25, 30, 26>$ $<42, 40, 35, 25, 22, 26, 30>$ $<42, 35, 40, 22, 25, 26, 30>$
3
​​​​​​​A host is connected to a department network which is part of a university network. The university network, in turn, is part of the Internet. The largest network, in which the Ethernet address of the host is unique, is the Internet the university network the department network the subnet to which the host belongs
1 vote
4
​​​​​​​Suppose $P, Q$ and $R$ are co-operating processes satisfying Mutual Exclusion condition. Then, if the process $Q$ is executing in its critical section then Both $‘P’$ and $‘R’$ execute in critical section Neither $‘P’$ nor $‘R’$ executes in their critical section $‘P’$ executes in critical section $‘R’$ executes in critical section
5
​​​​​​​______ system call creates new process in Unix. create create new fork fork new
6
​​​​​​​Dirty bit is used to show the wrong page page with corrupted data page with low frequency occurrence page that is modified after being loaded into cache memory
7
In computers, subtraction is generally carried out by $9$’s complement $1$’s complement $10$’s complement $2$’s complement
8
​​​​​​​Suppose a system has $12$ instances of some resource with $n$ processes competing for that resource. Each process may require $4$ instances of the resources. The maximum value of $n$ for which the system never enters into deadlock is $3$ $4$ $5$ $6$
1 vote
9
Consider a disk pack with $32$ surfaces, $64$ tracks and $512$ sectors per pack. $256$ bytes of data are stored in a bit serial manner in a sector. The number of bits required to specify a particular sector in the disk is $18$ $19$ $20$ $22$
10
The boolean expression $\overline{A} \cdot B + A \cdot \overline{B}+ A \cdot B$ is equivalenet to $\overline{A} \cdot B$ $\overline{A+B}$ $A \cdot B$ $A+B$
1 vote
11
A survey has been conducted on methods of commuter travel. Each respondent was asked to check Bus, Train and Automobile as a major method of travelling to work. More than one answer was permitted. The results reported were as follows : Bus $30$ people; Train $35$ people; ... $20$ people; and all the three methods $5$ people. How many people completed the survey form? $120$ $165$ $160$ $115$
1 vote
12
Match List-I with List-II and choose the correct answer from the code given below : ... iii), (d)-(iv) (a)-(iii), (b)-(iv), (c)-(ii), (d)-(i) (a)-(iv), (b)-(iii), (c)-(ii), (d)-(i)
1 vote
13
​​​​​​In mathematical logic, which of the following are statements? There will be snow in January. What is the time now? Today is Sunday. You must study Discrete mathematics Choose the correct answer from the code given below: i and iii i and ii ii and iv iii and iv
14
How to solve this question?
1 vote
15
void foo(int n) { while (n! = 0) { if (!(n & 1)) printf(“*”); n = n >> 1 ; } } The number of times printf(“*”) is executed, when the value 2 raised to power 24 is passed to the function foo() is ?
16
The height of a binary tree is defined as the number of nodes in the longest path form the root node to the leaf node. Let X be the height of complete binary tree with 256 nodes. The value of X will be ______.
17
$P$ looks at $Q$ while $Q$ looks at $R$. $P$ is married, $R$ is not. The number of pairs of people in which a married person is looking at an unmarried person is $0$ $1$ $2$ Cannot be determined.
1 vote
18
Please derive this $1+2+4+........+\frac{n}{4}+\frac{n}{2}=2^{log n}-1$
19
Velocity of an object fired directly in upward direction is given by ܸ$V\mathit{}=80-32 t\mathit{}$, where $t\mathit{}$ (time) is in seconds. When will the velocity be between $32 \;m/sec$ and $64 \;m/sec$? $\left(1, \dfrac{3}{2}\right)$ $\left(\dfrac{1}{2}, 1\right)$ $\left(\dfrac{1}{2},\dfrac{3}{2}\right)$ $\left(1, 3\right)$
20
Consider the following C function: void foo(int n) { while(n!=0) { if(!(n&1)) printf("*"); n=n>>1; } } The number of times printf (“*”) statement is executed, when the value $2^{24}$ is passed to the function foo().
1 vote
21
______ is NOT a part of the ACID properties Inconsistency Consistency Atomicity Isolation
Find the effective access time for the memory for the given data. Page fault service time $=8$ ms Average memory access time $=20$ ns One page fault is generated for every memory access $=10^6$ $29$ ns $33$ ns $28$ ns $30$ ns
Consider the following Finite State Automaton. The language accepted by the automaton is given by the regular. $ab^*b^*$ $a^*b^*$ $b^*b$ $b^*ab^*$
Maximum number of superkeys for the relation schema $R(X,Y,Z,W)$ with $X$ as the key is $6$ $8$ $9$ $12$
Identify the total number of tokens in the given statement printf("A%B="&i); $7$ $8$ $9$ $13$