Recent activity

+10 votes

3 answers

1

GATE1987-1-xix
Study the following program written in a block-structured language: Var x, y:interger; procedure P(n:interger); begin x:=(n+2)/(n-3); end; procedure Q Var x, y:interger; begin x:=3; y:=4; P(y); Write(x) __(1) end; begin x:=7; y:=8; Q; Write ... by the write statements marked (1) and (2) in the program if the variables are statically scoped? $3, 6$ $6, 7$ $3, 7$ None of the above.

answer selected 1 minute ago in Compiler Design by Arjun Veteran (348k points) | 862 views

+14 votes

1 answer

2

GATE2005-IT-10
A two-way switch has three terminals a, b and c. In ON position (logic value 1), a is connected to b, and in OFF position, a is connected to c. Two of these two-way switches S1 and S2 are connected to a bulb as shown below. Which of the following ... true, will always result in the lighting of the bulb ? $S1.\overline{S2}$ $S1 + S2$ $\overline {S1\oplus S2}$ $S1 \oplus S2$

answer edited 2 minutes ago in Digital Logic by Milicevic3306 Boss (14.4k points) | 1.1k views

+26 votes

6 answers

3

GATE2006-36
Given two three bit numbers $a_{2}a_{1}a_{0}$ and $b_{2}b_{1}b_{0}$ and $c$ the carry in, the function that represents the carry generate function when these two numbers are added is: $a_{2}b_{2}+a_{2}a_{1}b_{1}+a_{2}a_{1}a_{0}b_{0}+a_{2}a_{0}b_{1}b_{0}+a_{1}b_{2}b_{1 ... {b_{1}}b_{0}+a_{1}\overline{b_{2}}b_{1}+\overline{a_{1}}a_{0}\overline{b_{2}}b_{0}+a_{0}\overline{b_{2}b_{1}}b_{0}$

answer edited 3 minutes ago in Digital Logic by Milicevic3306 Boss (14.4k points) | 2.7k views

+23 votes

2 answers

4

GATE2007-35
In a look-ahead carry generator, the carry generate function $G_i$ and the carry propagate function $P_i$ for inputs $A_i$ and $B_i$ are given by: $$P_i = A_i \oplus B_i \text{ and }G_i = A_iB_i$$ The expressions for the sum bit $S_i$ and the carry bit $C_{i+1}$ of the look ... a 4-bit adder with $S_3, S_2, S_1, S_0$ and $C_4$ as its outputs are respectively: 6, 3 10, 4 6, 4 10, 5

answer edited 3 minutes ago in Digital Logic by Milicevic3306 Boss (14.4k points) | 2.2k views

+13 votes

2 answers

5

TIFR2015-B-9
A Boolean expression is an expression made out of propositional letters (such as $p, q, r$) and operators $\wedge$, $\vee$ and $\neg$; e.g. $p\wedge \neg (q \vee \neg r)$. An expression is said to be in sum of product ... . Every Boolean expression is equivalent to an expression without $\wedge$ operator. Every Boolean expression is equivalent to an expression without $\neg$ operator.

answer edited 7 minutes ago in Digital Logic by Milicevic3306 Boss (14.4k points) | 399 views

+1 vote

0 answers

6

Heap DS
A min heap having 1024 distinct elements with keys ranging from 0 to 1023 is stored in array of 1024 indices. The maximum difference between element 512 present at maximum level and minimum level is ________. [Assume root is ... taking maximum level 11 and minimum level 2 __________________________________________________________________________ why minimum level 2, and why it is not 1?

commented 7 minutes ago in Programming by Shubhgupta Junior (639 points) | 24 views

+22 votes

6 answers

7

GATE2015-3-44
Given the function $F = P' +QR$, where $F$ is a function in three Boolean variables $P, Q$ and $R$ and $P'=!P$, consider the following statements. $(S1) F = \sum(4, 5, 6)$ $(S2) F = \sum(0, 1, 2, 3, 7)$ $(S3) F = \Pi (4, 5, 6)$ $(S4) F = \Pi (0, 1, 2, ... )-True, (S2)-False, (S3)-False, (S4)-True (S1)-False, (S2)-False, (S3)-True, (S4)-True (S1)-True, (S2)-True, (S3)-False, (S4)-False

answer edited 8 minutes ago in Digital Logic by Milicevic3306 Boss (14.4k points) | 1.7k views

+20 votes

7 answers

8

GATE2015-3-43
The total number of prime implicants of the function $f(w, x, y, z) = \sum (0, 2, 4, 5, 6, 10)$ is __________

answer edited 9 minutes ago in Digital Logic by Milicevic3306 Boss (14.4k points) | 2.5k views

+18 votes

3 answers

9

GATE2008-8
Given $f_1$, $f_3$ and $f$ in canonical sum of products form (in decimal) for the circuit $f_1 = \Sigma m(4, 5, 6, 7, 8)$ $f_3 = \Sigma m(1, 6, 15)$ $f = \Sigma m(1, 6, 8, 15)$ then $f_2$ is $\Sigma m(4, 6)$ $\Sigma m(4, 8)$ $\Sigma m(6, 8)$ $\Sigma m(4, 6, 8)$

answer edited 11 minutes ago in Digital Logic by Milicevic3306 Boss (14.4k points) | 1.9k views

+20 votes

3 answers

10

GATE2008-IT-42
The two numbers given below are multiplied using the Booth's algorithm. Multiplicand : $0101$ $1010$ $1110$ $1110$ Multiplier: $0111$ $0111$ $1011$ $1101$ How many additions/Subtractions are required for the multiplication of the above two numbers? $6$ $8$ $10$ $12$

answer edited 12 minutes ago in Digital Logic by Milicevic3306 Boss (14.4k points) | 3k views

+13 votes

3 answers

11

GATE2005-IT-8
Using Booth's Algorithm for multiplication, the multiplier -57 will be recoded as $0$ -$1$ $0$$0$ $1$ $0$ $0$ -$1$ $1$ $1$ $0$ $0$ $0$ $1$ $1$ $1$ $0$ -$1$ $0$ $0$ $1$$0$ $0$ $0$ $0$ $1$ $0$ $0$ -$1$ $0$ $0$ $1$

answer edited 15 minutes ago in Digital Logic by Milicevic3306 Boss (14.4k points) | 1.6k views

+22 votes

3 answers

12

GATE2000-2.12
The following arrangement of master-slave flip flops has the initial state of P, Q as 0, 1 (respectively). After a clock cycle the output state P, Q is (respectively), 1, 0 1, 1 0, 0 0, 1

commented 16 minutes ago in Digital Logic by Abhishek Gupta 1 (9 points) | 2.1k views

0 votes

1 answer

13

GATE 2015 qn no 61
Is this solution correct ?

commented 18 minutes ago in Numerical Ability by Kirandas R (67 points) | 20 views

+11 votes

4 answers

14

GATE1999-1.20
Booth's coding in $8$ bits for the decimal number $-57$ is: $0-100+1000$ $0-100+100-1$ $0-1+100-10+1$ $00-10+100-1$

edited 21 minutes ago in Digital Logic by Milicevic3306 Boss (14.4k points) | 2.5k views

+24 votes

2 answers

15

GATE2009-54
A sub-sequence of a given sequence is just the given sequence with some elements (possibly none or all) left out. We are given two sequences $X[m]$ and $Y[n]$ of lengths $m$ and $n$, respectively with indexes of $X$ and $Y$ starting from $0$. We wish to find the length of the ... order of $L[M, N]$. $L[p, q]$ needs to be computed before $L[r, s]$ if either $p<r$ or $q < s$.

edited 22 minutes ago in Algorithms by Shikha Mallick Active (1k points) | 2.1k views

0 votes

0 answers

16

Testbook Test Series
Consider the following statements: $A.$ In a weighted undirected graph $G = (V, E, w)$, breadth-first search from a vertex s finds single-source shortest paths from s (via parent pointers) in $O(V + E)$ time. $B.$ In a weighted undirected tree $G ... ), then the breadth-first search order of vertices is a valid order in which to tackle the tasks. Which of the above is TRUE?

comment edited 27 minutes ago in Algorithms by Abhinavg (283 points) | 36 views

+15 votes

3 answers

17

GATE1996-1.8
Which two of the following four regular expressions are equivalent? ($\varepsilon$ is the empty string). $(00)^ * (\varepsilon +0)$ $(00)^*$ $0^*$ $0(00)^*$ (i) and (ii) (ii) and (iii) (i) and (iii) (iii) and (iv)

commented 34 minutes ago in Theory of Computation by Divyanshum29 (119 points) | 1.1k views

0 votes

0 answers

18

Combinatorics-Kenneth Rosen(Ex 5.3 31)
The english alphabet contains 21 consonants and five vowels.How many strings of six lowercase letters of the English alphabet contain (b)Exactly two vowels (d)At least two vowels For (b) part I solved it like choose 2 vowels from 5 in $\binom{5}{2}$ ways ... }*6!))$ and both of my answers don't match with the key in Rosen. Please let me know where I am wrong.

commented 36 minutes ago in Combinatory by srestha Veteran (86.8k points) | 20 views

+19 votes

2 answers

19

GATE2006-59
Consider the following translation scheme. $ S\rightarrow ER$ $ R\rightarrow ^{*}E\left \{ print('*'); \right \} R\mid \varepsilon $ $ E\rightarrow F+E\left \{ print('+'); \right \}\mid F $ $ F\rightarrow (S)\mid id \left \{ print(id.value); \right \} $ Here id is a token that ... an input '$2 * 3 + 4$', this translation scheme prints $2 * 3 + 4$ $2 * +3 \ 4$ $2 \ 3 * 4 +$ $2 \ 3 \ 4+*$

answer edited 36 minutes ago in Compiler Design by Krithiga2101 (277 points) | 1.7k views

+11 votes

4 answers

20

GATE2006-85
The grammar $S\rightarrow AC\mid CB$ $C\rightarrow aCb\mid \varepsilon$ $A\rightarrow aA\mid a$ $B\rightarrow Bb\mid b$ generates the language $ L=\left \{ a^{i}b^{j}\mid i\neq j \right \}$. In that grammar what is the length of the derivation (number of steps starting from $S$) to generate the string $a^{l}b^{m}$ with $l\neq m$ $max (l,m) + 2$ $l + m + 2$ $l + m + 3$ $max (l,m) + 3$

answer selected 50 minutes ago in Compiler Design by Arjun Veteran (348k points) | 544 views

+24 votes

6 answers

21

GATE2011-29
We are given a set of $n$ distinct elements and an unlabeled binary tree with $n$ nodes. In how many ways can we populate the tree with the given set so that it becomes a binary search tree? $0$ $1$ $n!$ $\frac{1} {n+1} .^{2n}C_n$

answer edited 54 minutes ago in Algorithms by Shikha Mallick Active (1k points) | 4.1k views

0 votes

1 answer

22

Combinatorics-Kenneth Rosen(Ex 5.3-41)
How many ways are there for a horse race with three horses to finish if ties are possible.(Two or three horses may tie).

answered 56 minutes ago in Combinatory by Anu007 Boss (17k points) | 7 views

+9 votes

2 answers

23

GATE1990-1-vii
Fill in the blanks: Semaphore operations are atomic because they are implemented within the OS _________.

commented 57 minutes ago in Operating System by Pratik Gawali (37 points) | 533 views

0 votes

0 answers

24

self made
I know it is weird to ask but we know that we can convert NFA TO DFA but is it any procedure to convert DFA to NFA.

asked 1 hour ago in Theory of Computation by Divyanshum29 (119 points) | 4 views

+7 votes

2 answers

25

GATE1989-3-viii
In which of the following case(s) is it possible to obtain different results for call-by-reference and call-by-name parameter passing? Passing an expression as a parameter Passing an array as a parameter Passing a pointer as a parameter Passing as array element as a parameter

answer selected 1 hour ago in Compiler Design by Arjun Veteran (348k points) | 836 views

0 votes

1 answer

26

TIFR2018-A-3
Which of the following statements is TRUE for all sufficiently large integers n ? $2^{2^{\sqrt{log log n}}} <2^{\sqrt{log n}} < n$ $2^{\sqrt{log n}}<n<2^{2^{\sqrt{log log n}}}$ $n<2^{\sqrt{log n}}<2^{2^{\sqrt{log log n}}}$ $n<2^{2^{\sqrt{log log n}}} <2^{\sqrt{log n}}$ $2^{\sqrt{log n}}<2^{2^{\sqrt{log log n}}} < n$

answer edited 1 hour ago in Algorithms by Shikha Mallick Active (1k points) | 153 views

+23 votes

9 answers

27

GATE2017-1-04
Consider the following functions from positive integers to real numbers: $10$, $\sqrt{n}$, $n$, $\log_{2}n$, $\frac{100}{n}$. The CORRECT arrangement of the above functions in increasing order of asymptotic complexity is: $\log_{2}n$, $\frac{100}{n}$, $10$, $\sqrt{n}$, $n$ $\frac{100}{n ... frac{100}{n}$, $\sqrt{n}$, $\log_{2}n$, $n$ $\frac{100}{n}$, $\log_{2}n$, $10$, $\sqrt{n}$, $n$

answer edited 1 hour ago in Algorithms by Shikha Mallick Active (1k points) | 2.8k views

+15 votes

3 answers

28

TIFR2011-B-27
Let $n$ be a large integer. Which of the following statements is TRUE? $n^{1 / \sqrt{\log_2 n}} < \sqrt{\log_2 n} < n^{1/100}$ $n^{1/100} < n^{1 / \sqrt{\log_2 n}} < \sqrt{\log_2 n}$ $n^{1 / \sqrt{\log_2 n}} < n^{1/100} < \sqrt{\log_2 n}$ $\sqrt{\log_2 n} < n^{1 / \sqrt{\log_2 n}} < n^{1/100}$ $\sqrt{\log_2 n} < n^{1/100} < n^{1 / \sqrt{\log_2 n}}$

answer edited 1 hour ago in Algorithms by Shikha Mallick Active (1k points) | 533 views

+14 votes

5 answers

29

GATE2004-2,ISRO2017-54
Consider the following function void swap(int a, int b) { int temp; temp = a; a = b; b = temp; } In order to exchange the values of two variables $x$ and $y$. call $swap(x, y)$ call $swap(\&x, \&y)$ $swap (x, y)$ cannot be used as it does not return any value $swap (x, y)$ cannot be used as the parameters are passed by value

answer edited 1 hour ago in Compiler Design by Arjun Veteran (348k points) | 2.9k views

+11 votes

2 answers

30

TIFR2012-B-6
Let $n$ be a large integer. Which of the following statements is TRUE? $2^{\sqrt{2\log n}}< \frac{n}{\log n}< n^{1/3}$ $\frac{n}{\log n}< n^{1/3}< 2^{\sqrt{2\log n}}$ $2\sqrt{^{2\log n}}< n^{1/3}< \frac{n}{\log n}$ $n^{1/3}< 2\sqrt{^{2\log n}}<\frac{n}{\log n}$ $\frac{n}{\log n}< 2\sqrt{^{2\log n}}<n^{1/3}$

answer edited 1 hour ago in Algorithms by Shikha Mallick Active (1k points) | 397 views

+13 votes

3 answers

31

TIFR2014-B-8
Which of these functions grows fastest with $n$? $e^{n}/n$. $e^{n-0.9 \log n}$. $2^{n}$. $\left(\log n\right)^{n-1}$. None of the above.

answer edited 1 hour ago in Algorithms by Shikha Mallick Active (1k points) | 598 views

+19 votes

4 answers

32

TIFR2016-B-7
Let $n = m!$. Which of the following is TRUE? $m = \Theta (\log n / \log \log n)$ $m = \Omega (\log n / \log \log n)$ but not $m = O(\log n / \log \log n)$ $m = \Theta (\log^2 n)$ $m = \Omega (\log^2 n)$ but not $m = Ο( (\log^2 n)$ $m = \Theta (\log^{1.5} n)$

answer edited 1 hour ago in Algorithms by Shikha Mallick Active (1k points) | 905 views

+21 votes

2 answers

33

GATE2007-IT-14
Consider a $TCP$ connection in a state where there are no outstanding $ACK$s. The sender sends two segments back to back. The sequence numbers of the first and second segments are $230$ and $290$ respectively. The first segment was lost, but the second segment was received ... . The values of $X$ and $Y$ (in that order) are $60$ and $290$ $230$ and $291$ $60$ and $231$ $60$ and $230$

commented 1 hour ago in Computer Networks by mehul vaidya Junior (973 points) | 1.4k views

+30 votes

5 answers

34

GATE2015-3-42
Let $f(n) = n$ and $g(n) = n^{(1 + sin \: n)}$, where $n$ is a positive integer. Which of the following statements is/are correct? $f(n) = O(g(n))$ $f(n) = \Omega(g(n))$ Only I Only II Both I and II Neither I nor II

answer edited 1 hour ago in Algorithms by Shikha Mallick Active (1k points) | 2.9k views

+23 votes

3 answers

35

GATE2003-76
Which of the following is NOT an advantage of using shared, dynamically linked libraries as opposed to using statistically linked libraries? Smaller sizes of executable files Lesser overall page fault rate in the system Faster program startup Existing programs need not be re-linked to take advantage of newer versions of libraries

commented 1 hour ago in Compiler Design by Arjun Veteran (348k points) | 2.8k views

+25 votes

3 answers

36

GATE2015-3-4
Consider the equality $\sum_{(i=0)}^n i^3 = X$ and the following choices for $X$: $\Theta(n^4)$ $\Theta(n^5)$ $O(n^5)$ $\Omega(n^3)$ The equality above remains correct if $X$ is replaced by Only I Only II I or III or IV but not II II or III or IV but not I

answer edited 1 hour ago in Algorithms by Shikha Mallick Active (1k points) | 2.2k views

0 votes

0 answers

37

Number of Max Heap
How many max-heaps can be formed with the following elements? $\{1,1,1,2,2,2,3,3,3,4,4,4\}$

edited 1 hour ago in DS by Anu007 Boss (17k points) | 108 views

+28 votes

4 answers

38

GATE2008-51
Match the following: E. Checking that identifiers are declared before their use P. $L \: = \: \left\{a^nb^mc^nd^m \mid n\: \geq1, m \geq 1\right\}$ F. Number of formal parameters in the declaration of a function agrees with the number of actual parameters in a use of that function Q. $X\: \rightarrow XbX \ ... -R, F-P, G-S, H-Q}$ $\text{E-R, F-P, G-Q, H-S}$ $\text{E-P, F-R, G-S, H-Q}$

commented 1 hour ago in Theory of Computation by Abhishek Rai 2 (19 points) | 2.3k views

+18 votes

4 answers

39

GATE2012-18
Let $W(n) $ and $A(n)$ denote respectively, the worst case and average case running time of an algorithm executed on an input of size $n$. Which of the following is ALWAYS TRUE? $A(n) = \Omega (W(n))$ $A(n) = \Theta (W(n))$ $A(n) = \text{O} (W(n))$ $A(n) = \text{o} (W(n))$

answer edited 1 hour ago in Algorithms by Shikha Mallick Active (1k points) | 1.9k views

+16 votes

3 answers

40

GATE2005-37
Suppose $T(n) =2T (\frac{n}{2}) + n$, $T(0) = T(1) =1$ Which one of the following is FALSE? $T(n)=O(n^2)$ $T(n)=\Theta(n \log n)$ $T(n)=\Omega(n^2)$ $T(n)=O(n \log n)$

answer edited 2 hours ago in Algorithms by Shikha Mallick Active (1k points) | 1.4k views

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

Recent activity

Recent Posts

Recent Blog Comments