Dark Mode

Recent activity by Nitesh_Yadav

3 answers

1

Array
An array VAL[1..15][1..10] is stored in the memory with each element requiring 4 bytes of storage. If the base address of array VAL is 1500, determine the location of VAL[12][9] when the array VAL is stored in Row wise. ?

asked in Programming Jul 3, 2022

648 views

4 answers

2

GATE CSE 2018 | Question: GA-9
In the figure below, $\angle DEC + \angle BFC$ is equal to _____ $\angle BCD - \angle BAD$ $\angle BAD + \angle BCF$ $\angle BAD + \angle BCD$ $\angle CBA + \angle ADC$

commented in Quantitative Aptitude Apr 21, 2022

8.9k views

1 answer

3

Applied Root Test Series
Let C(X) be the number of leaves in a binary tree rooted at T. Assume that IsLeaf(T) returns I if T is a leaf. Which of the following observations leads to a recursive implementation? C(T)=C(T.Left) +C(T.Right) C(T):C(T.Left)+C(T.Right)+1 C(T)=C(T.Left]+C(T.right)+Isleaf(T)

asked in Programming Apr 12, 2022

122 views

2 answers

4

Test Series
What is the time complexity of the below mentioned recursive function. int f(n) { if(n!=1) { return f(n/2)+f(n/2); } else return 10; } O(n) O(n^2) O(log n) O(n logn)

answered in Algorithms Apr 11, 2022

120 views

15 answers

5

GATE IT 2007 | Question: 83
The head of a hard disk serves requests following the shortest seek time first (SSTF) policy. What is the maximum cardinality of the request set, so that the head changes its direction after servicing every request if the total number of tracks are $2048$ and the head can start from any track? $9$ $10$ $11$ $12$

answered in Operating System Apr 10, 2022

17.9k views

2 answers

6

#Quicksort
In Quicksort of the following numbers, if the pivot is chosen as the first element, what will be the order of the numbers after the use of partition function? Assume we are sorting in increasing order. 11, 15, 9, 13, 17, 7, 5, 12, 6, 18

commented in Algorithms Apr 8, 2022

188 views

1 answer

7

GATE CSE 1989 | Question: 11b
Consider the following precedence graph $(\text{Fig}.6)$ of processes where a node denotes a process and a directed edge from node $P_{i}$ to node $P_{j}$ implies; that $P_{i}$ must complete before $P_{j}$ commences. Implement the graph using FORK and JOIN constructs. The actual computation done by a process may be indicated by a comment line.

commented in Operating System Apr 3, 2022

1.9k views

5 answers

8

GATE CSE 2015 Set 2 | Question: 3
Consider the following two statements. $S_1$: If a candidate is known to be corrupt, then he will not be elected $S_2$: If a candidate is kind, he will be elected Which one of the following statements follows from $S_1$ and $S_2$ as per sound inference ... If a person is kind, he is not known to be corrupt If a person is not kind, he is not known to be corrupt

commented in Mathematical Logic Mar 4, 2022

6.7k views

5 answers

9

GATE CSE 2011 | Question: 18
If the difference between the expectation of the square of a random variable $\left(E\left[X^2\right]\right)$ and the square of the expectation of the random variable $\left(E\left[X\right]\right)^2$ is denoted by $R$, then $R=0$ $R<0$ $R\geq 0$ $R > 0$

answered in Probability Feb 23, 2022

6.9k views

3 answers

10

GATE CSE 1998 | Question: 12
Let $(A, *)$ be a semigroup, Furthermore, for every $a$ and $b$ in $A$, if $a \neq b$, then $a*b \neq b*a$. Show that for every $a$ in $A$, $a*a=a$ Show that for every $a$, $b$ in $A$, $a*b*a=a$ Show that for every $a,b,c$ in $A$, $a*b*c=a*c$

commented in Set Theory & Algebra Feb 13, 2022

5.5k views

6 answers

11

GATE CSE 2020 | Question: 52
Graph $G$ is obtained by adding vertex $s$ to $K_{3,4}$ and making $s$ adjacent to every vertex of $K_{3,4}$. The minimum number of colours required to edge-colour $G$ is _______

answered in Graph Theory Feb 9, 2022

9.1k views

10 answers

12

GATE CSE 2001 | Question: 2.13
Consider the following data path of a simple non-pipelined CPU. The registers $A, B$, $A_{1},A_{2}, \textsf{MDR},$ the $\textsf{bus}$ and the $\textsf{ALU}$ are $8$-$bit$ wide. $\textsf{SP}$ and $\textsf{MAR}$ are $16$-$bit$ registers. The ... $\textsf{CPU}$ clock cycles are required to execute the "push r" instruction? $2$ $3$ $4$ $5$

answered in CO and Architecture Jan 24, 2022

16.9k views

4 answers

13

GATE CSE 2017 Set 2 | Question: 45
The read access times and the hit ratios for different caches in a memory hierarchy are as given below: ... and $40\%$ are for memory operand fetch. The average read access time in nanoseconds (up to $2$ decimal places) is _________

answered in CO and Architecture Jan 22, 2022

24.4k views

18 answers

14

GATE CSE 2004 | Question: 62
A 4-bit carry look ahead adder, which adds two 4-bit numbers, is designed using AND, OR, NOT, NAND, NOR gates only. Assuming that all the inputs are available in both complemented and uncomplemented forms and the delay of each gate is one time ... the carry network has been implemented using two-level AND-OR logic. 4 time units 6 time units 10 time units 12 time units

answered in Digital Logic Jan 21, 2022

23.9k views

19 answers

15

GATE CSE 2016 Set 1 | Question: 8
We want to design a synchronous counter that counts the sequence $0-1-0-2-0-3$ and then repeats. The minimum number of $\text{J-K}$ flip-flops required to implement this counter is _____________.

answered in Digital Logic Jan 17, 2022

44.4k views

0 answers

16

#aktu university
Solve this question

asked in Theory of Computation Jan 11, 2022

89 views

8 answers

17

GATE CSE 2016 Set 2 | Question: 11
Breadth First Search (BFS) is started on a binary tree beginning from the root vertex. There is a vertex $t$ at a distance four from the root. If $t$ is the $n^{\text{th}}$ vertex in this BFS traversal, then the maximum possible value of $n$ is __________

answered in Algorithms Jan 8, 2022

9.9k views

3 answers

18

GATE CSE 2004 | Question: 43
Consider the following C program segment struct CellNode{ struct CellNode *leftChild int element; struct CellNode *rightChild; }; int Dosomething (struct CellNode *ptr) { int value = 0; if(ptr != NULL) { if (ptr -> leftChild != NULL) value = 1 + ... leaf nodes in the tree The number of nodes in the tree The number of internal nodes in the tree The height of the tree

answered in DS Jan 7, 2022

5.9k views

12 answers

19

GATE CSE 2019 | Question: 29
Suppose that in an IP-over-Ethernet network, a machine X wishes to find the MAC address of another machine Y in its subnet. Which one of the following techniques can be used for this? X sends an ARP request packet to the local gateway' ... packet with broadcast MAC address in its local subnet X sends an ARP request packet with broadcast IP address in its local subnet

answered in Computer Networks Jan 5, 2022

14.6k views

1 answer

20

#Made Easy Test Series
Find the time complexity of the given program

asked in Algorithms Jan 4, 2022

272 views

1 answer

21

#aktu #aktu 2016-17
please provide the solution

asked in Algorithms Dec 29, 2021

166 views

1 answer

22

Made Easy Test Series

commented in Databases Dec 27, 2021

313 views

7 answers

23

GATE CSE 2010 | Question: 50
Consider a complete undirected graph with vertex set $\{0, 1, 2, 3, 4\}$. Entry $W_{ij}$ in the matrix $W$ below is the weight of the edge $\{i, j\}$ ... possible weight of a spanning tree $T$ in this graph such that vertex $0$ is a leaf node in the tree $T$? $7$ $8$ $9$ $10$

commented in Algorithms Dec 25, 2021

18.3k views

6 answers

24

GATE CSE 2014 Set 2 | Question: 54
SQL allows duplicate tuples in relations, and correspondingly defines the multiplicity of tuples in the result of joins. Which one of the following queries always gives the same answer as the nested query shown below: select * from R where a in (select S.a from S) select R. ... a from S) as S1 where R.a=S1.a select R.* from R,S where R.a=S.a and is unique R

commented in Databases Dec 23, 2021

15.2k views

2 answers

25

Made Easy test series
SR conflict in LR(0) and SLR(1) will always be equal for some context free grammar?

asked in Compiler Design Dec 22, 2021

731 views

1 answer

26

#Made easy
Let N stations share 40kbps of pure aloha channel. Frame size is 512 bits which are send at every 40 seconds. The maximum value of N is ____

asked in Computer Networks Dec 10, 2021

268 views

1 answer

27

GATE2018 CH: GA-10
In a detailed study of annual crow births in India, it was found that there was relatively no growth during the period $2002$ to $2004$ and a sudden spike from $2004$ to $2005$. In another unrelated study, it was found that the revenue from ... rate. If cracker sale declines, crow birth will decline. Increased birth rate of crows will cause an increase in the sale of crackers.

commented in Quantitative Aptitude Dec 8, 2021

2.0k views

2 answers

28

GATE CSE 2021 Set 2 | GA Question: 3
If $\theta$ is the angle, in degrees, between the longest diagonal of the cube and any one of the edges of the cube, then, $\cos \theta =$ $\frac{1}{2} \\$ $\frac{1}{\sqrt{3}} \\$ $\frac{1}{\sqrt{2}} \\$ $\frac{\sqrt{3}}{2}$

commented in Quantitative Aptitude Dec 5, 2021

5.5k views

6 answers

29

GATE IT 2008 | Question: 64
A $1\;\text{Mbps}$ satellite link connects two ground stations. The altitude of the satellite is $36,504\;\text{km}$ and speed of the signal is $3 \times 10^{8}\;\text{m/s}.$ What should be the packet size for a channel utilization of $25\%$ for ... there are no errors during communication. $120\;\text{bytes}$ $60\;\text{bytes}$ $240\;\text{bytes}$ $90\;\text{bytes}$

answered in Computer Networks Dec 4, 2021

19.6k views

8 answers

30

GATE CSE 2014 Set 2 | Question: GA-10
At what time between $6$ a. m. and $7$ a. m. will the minute hand and hour hand of a clock make an angle closest to $60^{\circ}$? $6: 22$ a.m. $6: 27$ a.m. $6: 38$ a.m. $6: 45$ a.m.

commented in Quantitative Aptitude Nov 28, 2021

8.2k views