Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
SameekshaGupta
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by SameekshaGupta
3
answers
1
Programming Stack (ACE)
Runtime stack doesnot contain (A) Local variables (B) Static Variables (C) Parameter Passed (D) Return Address
Runtime stack doesnot contain(A) Local variables(B) Static Variables(C) Parameter Passed(D) Return Address
1.6k
views
answered
Mar 8, 2019
Programming in C
stack
+
–
3
answers
2
GATE Overflow | Compiler Design | Test 1 | Parsing | Question: 5
Which of the following statements regarding $LR(0)$ parser is FALSE? A $LR(0)$ configurating set cannot have multiple reduce items A $LR(0)$ configurating set cannot have both shift as well as reduce items If a reduce item is ... a $LR(0)$ configurating set it cannot have any other item A $LR(0)$ parser can parse any regular grammar
Which of the following statements regarding $LR(0)$ parser is FALSE?A $LR(0)$ configurating set cannot have multiple reduce itemsA $LR(0)$ configurating set cannot have ...
3.1k
views
commented
Jan 27, 2019
Compiler Design
go-cd-1
parsing
lr-parser
+
–
2
answers
3
Test by Bikram | Databases | Test 1 | Question: 14
Let there is a Table named Stud_records with $3000$ records of fixed length, each record size is $50$ Bytes and records are stored in a block of size $512$ Bytes, If secondary index is built on the key field of size $10$ Bytes and a block pointer of size $5$ Bytes , then the number of first level index blocks are ______
Let there is a Table named Stud_records with $3000$ records of fixed length, each record size is $50$ Bytes and records are stored in a block of size $512$ Bytes, If sec...
856
views
commented
Jan 25, 2019
Databases
tbb-dbms-1
numerical-answers
+
–
5
answers
4
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(\_)$.
For a $B^+$ - tree of order $d$ with $n$ leaf nodes, the number of nodes accessed during a search is $O(\_)$.
3.4k
views
answered
Jan 15, 2019
Databases
gate1994
databases
b-tree
normal
descriptive
+
–
1
answer
5
Virtual Gate Test Series: Algorithms - Graphs
473
views
commented
Jan 13, 2019
Algorithms
algorithms
shortest-path
virtual-gate-test-series
+
–
5
answers
6
GATE CSE 2006 | Question: 23
$F$ is an $n\times n$ real matrix. $b$ is an $n\times 1$ real vector. Suppose there are two $n\times 1$ vectors, $u$ and $v$ such that, $u ≠ v$ and $Fu = b, Fv = b$. Which one of the following statements is false? Determinant of $F$ is zero. There are an infinite number of solutions to $Fx = b$ There is an $x≠0$ such that $Fx = 0$ $F$ must have two identical rows
$F$ is an $n\times n$ real matrix. $b$ is an $n\times 1$ real vector. Suppose there are two $n\times 1$ vectors, $u$ and $v$ such that, $u ≠ v$ and $Fu = b, Fv = b$. Wh...
9.9k
views
answered
Jan 2, 2019
Linear Algebra
gatecse-2006
linear-algebra
normal
matrix
+
–
5
answers
7
GATE CSE 2017 Set 1 | Question: 30
Let $u$ and $v$ be two vectors in $\mathbf{R}^{2}$ whose Euclidean norms satisfy $\left \| u \right \| = 2\left \| v \right \|$. What is the value of $\alpha$ such that $w = u + \alpha v$ bisects the angle between $u$ and $v$? $2$ $\frac{1}{2}$ $1$ $\frac{ -1}{2}$
Let $u$ and $v$ be two vectors in $\mathbf{R}^{2}$ whose Euclidean norms satisfy $\left \| u \right \| = 2\left \| v \right \|$. What is the value of $\alpha$ such that $...
13.9k
views
answered
Jan 1, 2019
Linear Algebra
gatecse-2017-set1
linear-algebra
normal
vector-space
+
–
1
answer
8
Explain why n>43 ??? #Algo
339
views
answered
Dec 18, 2018
Algorithms
algorithms
merge-sort
numerical-answers
test-series
+
–
4
answers
9
GATE CSE 1997 | Question: 75
An operating system handles requests to resources as follows. A process (which asks for some resources, uses them for some time and then exits the system) is assigned a unique timestamp are when it starts. The timestamps are monotonically increasing with time. Let us denote ... , show how. If not prove it. Can a process P ever starve? If yes, show how. If not prove it.
An operating system handles requests to resources as follows.A process (which asks for some resources, uses them for some time and then exits the system) is assigned a un...
7.5k
views
commented
Dec 7, 2018
Operating System
gate1997
operating-system
resource-allocation
normal
descriptive
+
–
11
answers
10
GATE IT 2005 | Question: 41
Given below is a program which when executed spawns two concurrent processes : semaphore $X : = 0 ;$ /* Process now forks into concurrent processes $P1$ & $P2$ ... (II) are true. (I) is true but (II) is false. (II) is true but (I) is false Both (I) and (II) are false
Given below is a program which when executed spawns two concurrent processes :semaphore $X : = 0 ;$/* Process now forks into concurrent processes $P1$ & $P2$ */$\begin{ar...
23.7k
views
answered
Nov 26, 2018
Operating System
gateit-2005
operating-system
process-synchronization
normal
+
–
5
answers
11
GATE CSE 2001 | Question: 2.22
Consider Peterson's algorithm for mutual exclusion between two concurrent processes i and j. The program executed by process is shown below. repeat flag[i] = true; turn = j; while (P) do no-op; Enter critical section, perform actions, then exit critical section Flag[i] = ... i flag[j] = true and turn = j flag[i] = true and turn = j flag[i] = true and turn = i
Consider Peterson's algorithm for mutual exclusion between two concurrent processes i and j. The program executed by process is shown below.repeat flag[i] = true; turn = ...
26.5k
views
answered
Nov 25, 2018
Operating System
gatecse-2001
operating-system
process-synchronization
normal
+
–
7
answers
12
GATE CSE 2016 Set 2 | Question: 07
Consider an eight-bit ripple-carry adder for computing the sum of $A$ and $B$, where $A$ and $B$ are integers represented in $2$'s complement form. If the decimal value of $A$ is one, the decimal value of $B$ that leads to the longest latency for the sum to stabilize is ___________
Consider an eight-bit ripple-carry adder for computing the sum of $A$ and $B$, where $A$ and $B$ are integers represented in $2$'s complement form. If the decimal value o...
19.1k
views
answered
Nov 22, 2018
Digital Logic
gatecse-2016-set2
digital-logic
adder
normal
numerical-answers
+
–
6
answers
13
TIFR CSE 2016 | Part B | Question: 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)$
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...
6.0k
views
commented
Nov 21, 2018
Algorithms
tifr2016
algorithms
asymptotic-notation
+
–
6
answers
14
Why is left recursion not a problem for bottom up parsers?
I know the parsing logic of bottom up parsers, that they start from the terminal and reduce it to the start symbol. But what really confuses me is the construction of LR(0)/LR(1) sets : Eg : S->Sa|a Then in LR(0) set : ... is in front of S , so shouldn't the S production be generated again and again and make it go to an inf. loop?
I know the parsing logic of bottom up parsers, that they start from the terminal and reduce it to the start symbol. But what really confuses me is the construction of LR(...
10.3k
views
answered
Nov 15, 2018
Compiler Design
compiler-design
parsing
lr-parser
+
–
1
answer
15
Please Explain also..
. Assume an array A[1….n] has n-elements, and every element of an array is less than or equal to n. An element is said to be majority element, if it occurred in more than n/2 positions of an array. What is the best time complexity to check whether the majority of elements exist or not? (a) O (log n) (b) O (n) (c) O (n log n) (d) O (n2)
. Assume an array A[1….n] has n-elements, and every element of an array is less than or equal to n. An element is said to be majority element, if it occurred in more th...
1.7k
views
answered
Nov 8, 2018
Algorithms
algorithms
sorting
time-complexity
+
–
0
answers
16
Karumanchi
f(n)=$2^n$ g(n)=n! h(n)=$n^{logn}$ which one is true? A) f(n)=O(g(n)) and g(n)=O(h(n)) B) f(n)=$\Omega(g(n)))$ and g(n)=O(h(n)) C) g(n)=O(f(n)) and h(n)=O(f(n)) D) h(n)=O(f(n)) and g(n)=$\Omega(f(n))$
f(n)=$2^n$g(n)=n!h(n)=$n^{logn}$ which one is true?A) f(n)=O(g(n)) and g(n)=O(h(n))B) f(n)=$\Omega(g(n)))$ and g(n)=O(h(n))C) g(n)=O(f(n)) and h(n)=O(f(n))D) h(n)=O(f(n))...
330
views
commented
Nov 7, 2018
Algorithms
algorithms
time-complexity
+
–
1
answer
17
regular expressions
are these equal? R1=(bc*a)*bc*d R2=b(c+ab)*d are r1 and r2 equal? Also can we obtain different regular expressions from a finite automata? if yes, how do we check if they're equal or not?
are these equal?R1=(bc*a)*bc*dR2=b(c+ab)*dare r1 and r2 equal? Also can we obtain different regular expressions from a finite automata? if yes, how do we check if they're...
413
views
answered
Nov 7, 2018
6
answers
18
CMI2010-B-04b
Indicate whether the following statement is true or false, providing a short explanation to substantiate your answers. A DFA that has $n$ states and accepts an infinite language must accept at least one string $x$ such that $2n < |x| < 3n$, where $|x|$ denotes the length of $x$.
Indicate whether the following statement is true or false, providing a short explanation to substantiate your answers.A DFA that has $n$ states and accepts an infinite la...
3.9k
views
commented
Apr 10, 2018
Theory of Computation
descriptive
cmi2010
finite-automata
+
–
4
answers
19
GATE CSE 1994 | Question: 19
Given a set: $S = \left\{x \mid \text{ there is an x-block of 5's in the decimal expansion of } \pi\right\}$ (Note: $x$-$block$ is a maximal block of $x$ successive $5$'s) Which of the following statements is true with ... that a language $L_1$ is regular and that the language $L_1 \cup L_2$ is regular, is the language $L_2$ always regular? Prove your answer.
Given a set:$$S = \left\{x \mid \text{ there is an x-block of 5's in the decimal expansion of } \pi\right\}$$(Note: $x$-$block$ is a maximal block of $x$ successive $5$'s...
5.3k
views
commented
Mar 27, 2018
Theory of Computation
gate1994
theory-of-computation
identify-class-language
normal
descriptive
+
–
4
answers
20
trees
Given a preorder, postorder and inorder traversal of a tree, is it always possible to obtain a tree that satisfies each of the three conditions? Or is it possible to not obtain a tree at all?
Given a preorder, postorder and inorder traversal of a tree, is it always possible to obtain a tree that satisfies each of the three conditions? Or is it possible to not ...
1.2k
views
answered
Feb 25, 2018
DS
binary-tree
algorithms
spanning-tree
binary-search-tree
+
–
2
answers
21
the gate book
The no. of binary trees with 3 nodes which when traversed by post-order gives the sequence A, B, C is: (a) 3 (b) 9 (c) 7 (d) 5
The no. of binary trees with 3 nodes which when traversed by post-order gives the sequenceA, B, C is:(a) 3 (b) 9(c) 7 (d) 5
620
views
answered
Feb 17, 2018
DS
binary-tree
+
–
2
answers
22
C practice Qustion
Why not Output is showing 90? #include <stdio.h> int main() { extern int p; printf("%d ", p); { int p = 90; printf("%d ", p); } }
Why not Output is showing 90? #include <stdio.h int main() { extern int p; printf("%d ", p); { int p = 90; printf("%d ", p); } }
2.4k
views
answered
Feb 17, 2018
Programming in C
programming-in-c
+
–
12
answers
23
GATE CSE 2009 | Question: 44
The following key values are inserted into a $B+$ - tree in which order of the internal nodes is $3$, and that of the leaf nodes is $2$, in the sequence given below. The order of internal nodes is the maximum number of tree pointers in each node, and the ... $1$ The maximum number of times leaf nodes would get split up as a result of these insertions is $2$ $3$ $4$ $5$
The following key values are inserted into a $B+$ - tree in which order of the internal nodes is $3$, and that of the leaf nodes is $2$, in the sequence given below. The ...
36.8k
views
commented
Oct 22, 2017
Databases
gatecse-2009
databases
b-tree
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register