Dark Mode

Recent activity by lakshaysaini2013

5 answers

1

GATE CSE 2016 Set 2 | Question: 43
Consider the following languages: $L_{1}=\left\{a^{n}b^{m}c^{n+m}:m, n\geq 1\right\}$ $L_{2}=\left\{a^{n}b^{n}c^{2n} :n\geq 1\right\}$ Which one of the following is TRUE? Both $L_{1}$ and $L_{2}$ are context-free. $L_{1}$ is context ... $L_{2}$ is context-free while $L_{1}$ is not context-free. Neither $L_{1}$ nor $L_{2}$ is context-free.

commented in Theory of Computation Aug 14, 2019

20.9k views

3 answers

2

GATE CSE 1994 | Question: 13
Consider the following relational schema: COURSES (cno, cname) STUDENTS (rollno, sname, age, year) REGISTERED_FOR (cno, rollno) The underlined attributes indicate the primary keys for the relations. The year' attribute for the STUDENTS relation indicates the year in ... for cno $322.$ Write a SQL query to print the age and year of the youngest student in each year.

commented in Databases Aug 9, 2019

6.3k views

5 answers

3

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(\_)$.

commented in Databases Aug 8, 2019

3.5k views

3 answers

4

GATE CSE 1994 | Question: 3.13
Let $p$ and $q$ be propositions. Using only the Truth Table, decide whether $p \Longleftrightarrow q$ does not imply $p \to \lnot q$ is True or False.

commented in Mathematical Logic Aug 4, 2019

7.3k views

5 answers

5

GATE IT 2008 | Question: 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$

commented in Digital Logic Aug 4, 2019

21.6k views

7 answers

6

GATE CSE 2015 Set 1 | Question: 20
Consider a $4$-bit Johnson counter with an initial value of $0000.$ The counting sequence of this counter is $0, 1, 3, 7, 15, 14, 12, 8, 0$ $0, 1, 3, 5, 7, 9, 11, 13, 15, 0$ $0, 2, 4, 6, 8, 10, 12, 14, 0$ $0, 8, 12, 14, 15, 7, 3, 1, 0$

commented in Digital Logic Aug 3, 2019

20.7k views

11 answers

7

GATE IT 2006 | Question: 9
In a binary tree, the number of internal nodes of degree $1$ is $5$, and the number of internal nodes of degree $2$ is $10$. The number of leaf nodes in the binary tree is $10$ $11$ $12$ $15$

commented in DS Aug 2, 2019

26.0k views

3 answers

8

GATE IT 2006 | Question: 73
An array $X$ of n distinct integers is interpreted as a complete binary tree. The index of the first element of the array is $0$. If the root node is at level $0$, the level of element $X[i]$, $i \neq 0$, is $\left \lfloor \log _2 i \right \rfloor$ ... $\left \lfloor \log _2 (i+1) \right \rfloor$ $\left \lceil \log _2 i \right \rceil$

commented in DS Aug 2, 2019

9.0k views

3 answers

9

GATE IT 2006 | Question: 38
When multiplicand $Y$ is multiplied by multiplier $X = x_{n - 1}x_{n-2} \dots x_0$ ... partial products for rows $5$ and $8$ are $2Y$ and $Y$ $-2Y$ and $2Y$ $-2Y$ and $0$ $0$ and $Y$

commented in Digital Logic Aug 2, 2019

10.4k views

0 answers

10

Made easy test series

commented in DS Jan 10, 2019

273 views

3 answers

11

GATE CSE 1994 | Question: 8
A rooted tree with $12$ nodes has its nodes numbered $1$ to $12$ in pre-order. When the tree is traversed in post-order, the nodes are visited in the order $3, 5, 4, 2, 7, 8, 6, 10, 11, 12, 9, 1$. Reconstruct the original tree from this information, that is, find the parent of each node, and show the tree diagrammatically.

commented in DS Dec 30, 2018

7.2k views

1 answer

12

MadeEasy Test Series: Programming & DS - Arrays
In a lower triangular matrices (size 15 x 15) representation of compact single dimensional array, non-zero elements (i.e. elements of the lower triangle) of each row are stored one after another, starting from the first row. Assume each ... a[10] [6] is______ B. [Note: Only lower triangular elements of the matrix are stored in contiguous array]

commented in Programming in C Dec 29, 2018

2.6k views

0 answers

13

commented in Theory of Computation Dec 28, 2018

501 views

1 answer

14

Made Easy2019
The minimum size of stack required to evaluate given post fix expression is _____________ postfix :- 2 5 x 6 + 4 2 x - MY ANSWER IS 8.. CAN ANYONE TELL ME WHERE I AM WRONG…??

commented in DS Dec 27, 2018

4.2k views

4 answers

15

2Darray
Consider a 2D array with elemnts stored in the form of lower triangular matrix.The elements must be crossed to read A[4,2] from the array [-6..................+8 , -6..........+8 ] is

comment edited in Programming in C Dec 27, 2018

5.5k views

0 answers

16

Static and dynamic scoping
Can anyone please explain what is the answer to this question by static and dynamic scoping?

commented in Programming in C Dec 27, 2018

923 views

5 answers

17

TIFR CSE 2013 | Part A | Question: 20
Consider a well functioning clock where the hour, minute and the seconds needles are exactly at zero. How much time later will the minutes needle be exactly one minute ahead ($1/60$ th of the circumference) of the hours needle and the seconds needle again ... of $1/60$ th of the circumference. $144$ minutes $66$ minutes $96$ minutes $72$ minutes $132$ minutes

commented in Quantitative Aptitude Nov 29, 2018

1.7k views

4 answers

18

GATE CSE 1993 | Question: 27
Draw the state transition of a deterministic finite state automaton which accepts all strings from the alphabet $\{a,b\}$, such that no string has $3$ consecutive occurrences of the letter $b$.

commented in Theory of Computation Nov 21, 2018

12.8k views

2 answers

19

GATE CSE 2016 Set 2 | Question: 18
Consider the following types of languages: $L_{1}$: Regular, $L_{2}$: Context-free, $L_{3}$: Recursive, $L_{4}$: Recursively enumerable. Which of the following is/are TRUE ? $\overline{L_{3}} \cup L_{4}$ ... is context-free. I only. I and III only. I and IV only. I, II and III only.

commented in Theory of Computation Nov 20, 2018

12.1k views

7 answers

20

GATE CSE 2000 | Question: 1.21
Let $m[0]\ldots m[4]$ be mutexes (binary semaphores) and $P[0]\ldots P[4]$ be processes. Suppose each process $P[i]$ executes the following: wait (m[i]); wait (m(i+1) mod 4]); ........... release (m[i]); release (m(i+1) mod 4]); This could cause Thrashing Deadlock Starvation, but not deadlock None of the above

commented in Operating System Nov 18, 2018

21.9k views

3 answers

21

MadeEasy Workbook: Operating System - Deadlock Prevention Avoidance Detection
Assume a system with four resource types, C=(6,4,4,2), andthe maximum claim table below. The resource allocator isconsidering allocating resources according to the tablebelow. Is this state safe? Why or why not? MaximumClaim Current ... 2 1 0 1 0 1 0 1 FIND WHETHER STATE IS SAFE OR NOT a-safe b-unsafe c-deadlock

answered in Operating System Nov 14, 2018

2.8k views

5 answers

22

GATE CSE 1992 | Question: 02,x, ISRO2015-35
At a particular time of computation, the value of a counting semaphore is $7$. Then $20$ $P$ operations and $15$ $V$ operations were completed on this semaphore. The resulting value of the semaphore is : $42$ $2$ $7$ $12$

commented in Operating System Nov 14, 2018

23.6k views

4 answers

23

GATE CSE 1995 | Question: 1.8
Which of the following page replacement algorithms suffers from Belady’s anamoly? Optimal replacement LRU FIFO Both (A) and (C)

commented in Operating System Nov 13, 2018

5.1k views

2 answers

24

GATE IT 2004 | Question: 11, ISRO2011-33
What is the bit rate of a video terminal unit with $80$ characters/line, $8$ $\text{bits/character}$ and horizontal sweep time of $100$ $\text{µs}$ (including $20$ $\text{µs}$ of retrace time)? $8$ $\text{Mbps}$ $6.4$ $\text{Mbps}$ $0.8$ $\text{Mbps}$ $0.64$ $\text{Mbps}$

commented in Operating System Nov 12, 2018

7.9k views

2 answers

25

GATE CSE 2005 | Question: 6
An undirected graph $G$ has $n$ nodes. its adjacency matrix is given by an $n \times n$ square matrix whose (i) diagonal elements are 0's and (ii) non-diagonal elements are 1's. Which one of the following is TRUE? Graph $G$ has no minimum ... cost $n-1$ Graph $G$ has multiple distinct MSTs, each of cost $n-1$ Graph $G$ has multiple spanning trees of different costs

commented in Algorithms Nov 11, 2018

13.9k views

6 answers

26

GATE2013 CE: GA-10
Abhishek is elder to Savar. Savar is younger to Anshul. Which of the given conclusions is logically valid and is inferred from the above statements? Abhishek is elder to Anshul Anshul is elder to Abhishek Abhishek and Anshul are of the same age No conclusion follows

answered in Analytical Aptitude Nov 11, 2018

3.3k views

7 answers

27

GATE CSE 2002 | Question: 2.11
The running time of the following algorithm Procedure $A(n)$ If $n \leqslant 2$ return ($1$) else return $(A( \lceil \sqrt{n} \rceil))$; is best described by $O(n)$ $O(\log n)$ $O(\log \log n)$ $O(1)$

answered in Algorithms Nov 5, 2018

17.8k views

16 answers

28

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

commented in Algorithms Nov 5, 2018

53.9k views

6 answers

29

GATE CSE 2015 Set 1 | Question: 35
What is the output of the following C code? Assume that the address of $x$ is $2000$ (in decimal) and an integer requires four bytes of memory. int main () { unsigned int x [4] [3] = {{1, 2, 3}, {4, 5, 6}, {7, 8, 9}, {10, 11, 12}}; printf ("%u, %u, %u", x + 3, *(x + 3), *(x + 2) + 3); } $2036, 2036, 2036$ $2012, 4, 2204$ $2036, 10, 10$ $2012, 4, 6$

commented in Programming in C Nov 4, 2018

27.9k views

0 answers

30

LINEAR ALGEBRA
IF A=$\begin{bmatrix} 2& -0.1\\ 0 & 3 \end{bmatrix}$ AND A-1=$\begin{bmatrix} \frac{1}{2}& a\\ 0 & b \end{bmatrix}$ then a+b ? a)$\frac{7}{20}$ b)$\frac{3}{20}$ c)$\frac{19}{60}$ d)$\frac{11}{20}$

commented in Linear Algebra Oct 31, 2018

574 views