Dark Mode

Recent activity

6 votes

5 answers

1

ISRO2020-41
Minimum number of states required in DFA accepting binary strings not ending in $”101”$ is $3$ $4$ $5$ $6$

Vishnu__ commented in Theory of Computation 1 hour ago

4.6k views

1 vote

1 answer

2

made easy test series
How is the max possible value of n is 12? We will have to store T(0) and T(1) in stack too, so we can call f(11) at max which will require T(10) and T(9) and then we will store f(11) in stack. But if we call f(12) we wont be able to store it as overflow will occur.

afroze answer edited in Algorithms 3 hours ago

by afroze

56 views

42 votes

5 answers

3

GATE CSE 2017 Set 1 | Question: 19
Let $X$ be a Gaussian random variable with mean 0 and variance $\sigma ^{2}$. Let $Y$ = $\max\left ( X,0 \right )$ where $\max\left ( a,b \right )$ is the maximum of $a$ and $b$. The median of $Y$ is ______________ .

JAINchiNMay commented in Probability 3 hours ago

16.0k views

113 votes

12 answers

4

GATE CSE 2016 Set 1 | Question: 41
Let $Q$ denote a queue containing sixteen numbers and $S$ be an empty stack. $Head(Q)$ returns the element at the head of the queue $Q$ without removing it from $Q$. Similarly $Top(S)$ returns the element at the top of $S$ without removing ... = Pop(S); Enqueue (Q, x); end end The maximum possible number of iterations of the while loop in the algorithm is _______.

princeit07 commented in DS 3 hours ago

23.5k views

54 votes

7 answers

5

GATE IT 2005 | Question: 50
In a binary tree, for every node the difference between the number of nodes in the left and right subtrees is at most $2$. If the height of the tree is $h > 0$, then the minimum number of nodes in the tree is $2^{h-1}$ $2^{h-1} + 1$ $2^h - 1$ $2^h$

cherrycharan commented in DS 6 hours ago

by cherrycharan

15.6k views

71 votes

14 answers

6

GATE CSE 2014 Set 1 | Question: 39
The minimum number of comparisons required to find the minimum and the maximum of $100$ numbers is ________

swami_9 answered in Algorithms 7 hours ago

43.1k views

38 votes

6 answers

7

GATE CSE 2017 Set 2 | Question: 31
For any discrete random variable $X$, with probability mass function $P(X=j)=p_j, p_j \geq 0, j \in \{0, \dots , N \}$, and $\Sigma_{j=0}^N \: p_j =1$, define the polynomial function $g_x(z) = \Sigma_{j=0}^N \: p_j \: z^j$. For a certain ... . The expectation of $Y$ is $N \beta(1-\beta)$ $N \beta$ $N (1-\beta)$ Not expressible in terms of $N$ and $\beta$ alone

Shakir Ahmad answered in Probability 15 hours ago

by Shakir Ahmad

12.0k views

0 votes

0 answers

8

doubt.
What is the difference between frame & fragmented packet?

Nisha Bharti asked in Computer Networks 17 hours ago

by Nisha Bharti

15 views

57 votes

9 answers

9

GATE IT 2005 | Question: 52
Let $G$ be a weighted undirected graph and e be an edge with maximum weight in $G$. Suppose there is a minimum weight spanning tree in $G$ containing the edge $e$. Which of the following statements is always TRUE? There exists a cutset in $G$ having ... $e$ cannot be contained in a cycle. All edges in $G$ have the same weight.

Pranavpurkar commented in Algorithms 18 hours ago

by Pranavpurkar

13.5k views

32 votes

6 answers

10

GATE IT 2007 | Question: 81
Let $P_1, P_2,\dots , P_n $be $n$ points in the $xy$-plane such that no three of them are collinear. For every pair of points $P_i$ and $P_j$, let $L_{ij}$ be the line passing through them. Let $L_{ab}$ ... $\Theta\left(n\right)$ $\Theta\left(n\log n\right)$ $\Theta\left(n\log^2 n\right)$ $\Theta\left(n^2\right)$

Pranavpurkar commented in Algorithms 20 hours ago

by Pranavpurkar

4.3k views

4 votes

2 answers

11

GATE CSE 2022 | Question: 36
Which of the following is/are undecidable? Given two Turing machines $\textit{M}_{1}$ and $\textit{M}_{2},$ decide if $\textit{L(M}_{1}) = \textit{L(M}_{2}).$ Given a Turing machine $\textit{M},$ decide if $\textit{L(M)}$ is ... $\textit{M},$ decide if $\textit{M}$ takes more than $1073$ steps on every string.

princeit07 commented in Theory of Computation 20 hours ago

1.4k views

51 votes

3 answers

12

GATE CSE 2000 | Question: 2.25
Given relations r(w, x) and s(y, z) the result of select distinct w, x from r, s is guaranteed to be same as r, provided. r has no duplicates and s is non-empty r and s have no duplicates s has no duplicates and r is non-empty r and s have the same number of tuples

Deepak Poonia commented in Databases 21 hours ago

by Deepak Poonia

12.5k views

28 votes

5 answers

13

GATE CSE 2008 | Question: 75
Consider the following C functions: int f1 (int n) { if(n == 0 || n == 1) return n; else return (2 * f1(n-1) + 3 * f1(n-2)); } int f2(int n) { int i; int X[N], Y[N], Z[N]; X[0] = Y[0] = Z[0] = 0; X[1] = 1; Y[1] = 2; Z[1] = 3; for(i ... ] = 3 * X[i]; } return X[n]; } $f1(8)$ and $f2(8)$ return the values $1661$ and $1640$ $59$ and $59$ $1640$ and $1640$ $1640$ and $1661$

Pranavpurkar commented in Algorithms 23 hours ago

by Pranavpurkar

7.0k views

68 votes

7 answers

14

GATE CSE 2008 | Question: 40
The minimum number of comparisons required to determine if an integer appears more than $\frac{n}{2}$ times in a sorted array of $n$ integers is $\Theta(n)$ $\Theta(\log n)$ $\Theta(\log^*n)$ $\Theta(1)$

Pranavpurkar commented in Algorithms 23 hours ago

by Pranavpurkar

23.7k views

44 votes

8 answers

15

GATE CSE 2007 | Question: 45
What is the $\text{time complexity}$ of the following recursive function? int DoSomething (int n) { if (n <= 2) return 1; else return (DoSomething (floor (sqrt(n))) + n); } $\Theta(n^2)$ $\Theta(n \log_2n)$ $\Theta(\log_2n)$ $\Theta(\log_2\log_2n)$

Pranavpurkar comment edited in Algorithms 23 hours ago

by Pranavpurkar

21.8k views

87 votes

8 answers

16

GATE CSE 2003 | Question: 66
The cube root of a natural number $n$ is defined as the largest natural number $m$ such that $(m^3 \leq n)$ . The complexity of computing the cube root of $n$ ($n$ is represented by binary notation) is $O(n)$ but not $O(n^{0.5})$ $O(n^{0.5})$ ... constant $m>0$ $O( (\log \log n)^k )$ for some constant $k > 0.5$, but not $O( (\log \log n)^{0.5} )$

Pranavpurkar comment edited in Algorithms 1 day ago

by Pranavpurkar

17.5k views

0 votes

1 answer

17

DMA
The below question is from Made Easy Test series The diagram shows single bus detached DMA configuration for a system. How many times system bus is used for single data transfer using DMA(Consider only data transfer, not command or status transfer) 1 2 3 0 Here answer ... My Doubt: In DMA their is direct data transfer from i/o to memory so system bus is accessed only once. Is this correct?

Shubham Sharma 2 answer edited in CO and Architecture 1 day ago

by Shubham Sharma 2

92 views

0 votes

1 answer

18

made easy test series
supernet mask of class c is given 255.255.224.0 .the number of networks that can be joined are 16 32 64 none

Pranavpurkar commented in Computer Networks 1 day ago

by Pranavpurkar

99 views

13 votes

6 answers

19

Simplified Boolean expression for A'BC+AB'C'+A'B'C'+AB'C+ABC
Simplified Boolean expression for A'BC+AB'C'+A'B'C'+AB'C+ABC A . AB B . B'C C . AB+(A'+AB')C D . AB'+BC+B'C'

D Trump answered in Digital Logic 1 day ago

55.2k views

69 votes

5 answers

20

GATE CSE 2003 | Question: 79
A processor uses $\text{2-level}$ page tables for virtual to physical address translation. Page tables for both levels are stored in the main memory. Virtual and physical addresses are both $32$ bits wide. The memory is byte addressable. For virtual to physical address translation, ... tables of this process is $\text{8 KB}$ $\text{12 KB}$ $\text{16 KB}$ $\text{20 KB}$

Mohitdas comment edited in Operating System 1 day ago

17.7k views

1 vote

1 answer

21

Doubt.
How pipelining process occurs in SR protocol? will it minimize the Tt time?

lalitver10 answered in Computer Networks 1 day ago

38 views

0 votes

1 answer

22

igate test series
The instruction pipeline of RISC processor has 200 instruction in which 100 are performing addition, 25 performing division and 75 are performing multiplication, where Execution state for addition take 1 clock, multiplication take 3 clock cycles and division take 5 clock cycles. Assume pipeline ... wrong. approch totel 200 in which (100 add having 1 cc) +(25*5-1) +(75*(3-1))=354

lalitver10 answered in CO and Architecture 1 day ago

42 views

0 votes

1 answer

23

igate test series
If a Boolean function is having cyclic prime implicants K-map, then the number of minimal forms for function is________

makhdoom ghaya retagged in Digital Logic 1 day ago

by makhdoom ghaya

34 views

0 votes

4 answers

24

Subnetting/Supernetting
In class $B$ if subnet mask is $255.192.0.0$ then the total number of networks that can be joined is: $32$ $64$ $16$ None of the Above

gatecse edited in Computer Networks 2 days ago

105 views

7 votes

1 answer

25

GATE Overflow | Mock GATE | Test 1 | Question: 40
You are working on a laptop connected to a $100 \text{Mbps}$ Ethernet LAN. You need a $2 \text{GB}$ file that is on the server in the same LAN. The entire file is also on your pen drive but you have left ... and bring the pen drive, before the transfer on the LAN completes. Assume continuous data transmission on the LAN(no packetization required)).

akashmaji945 answered in Computer Networks 2 days ago

by akashmaji945

967 views

3 votes

5 answers

26

GATE CSE 1994 | Question: 14b
For a $B^+$ - tree of order $d$ with $n$ leaf nodes, the number of nodes accessed during a search is $O(\_)$.

Pranavpurkar comment edited in Databases 2 days ago

by Pranavpurkar

1.4k views

1 vote

1 answer

27

ISI2014-PCB-CS-6b
In a LAN, $n^2$ routers are connected in an $n \times n$ mesh such that $R(i, j)$ represents a router in the $i$-th row and $j$-th column of the mesh. Find how many distinct shortest paths exist between two routers $R(i_1, j_1)$ ... how many of these distinct shortest paths will be node disjoint, i.e., with no common node except the source and the destination? Justify your answer.

HM answered in Computer Networks 2 days ago

by HM

522 views

39 votes

6 answers

28

GATE CSE 2014 Set 1 | Question: 14
Let $P$ be quicksort program to sort numbers in ascending order using the first element as the pivot. Let $t_1$ and $t_2$ be the number of comparisons made by P for the inputs $[1 \ 2 \ 3 \ 4 \ 5]$ and $[4 \ 1 \ 5 \ 3 \ 2]$ respectively. Which one of the following holds? $t_1 = 5$ $t_1 < t_2$ $t_1>t_2$ $t_1 = t_2$

Pranavpurkar comment edited in Algorithms 2 days ago

by Pranavpurkar

15.6k views

52 votes

11 answers

29

GATE CSE 2012 | Question: 39
A list of $n$ strings, each of length $n$, is sorted into lexicographic order using the merge-sort algorithm. The worst case running time of this computation is $O (n \log n) $ $ O(n^{2} \log n) $ $ O(n^{2} + \log n) $ $ O(n^{2}) $

Pranavpurkar answered in Algorithms 2 days ago

by Pranavpurkar

23.0k views

3 votes

2 answers

30

GATE2013 CE: GA-4
Friendship, no matter how _________ it is, has its limitations. cordial intimate secret pleasant

Pranavpurkar answered in Verbal Aptitude 2 days ago

by Pranavpurkar

2.3k views

To see more, click for the full list of questions or popular tags.

Recent activity