Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by SameekshaGupta
3
votes
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
+
–
1
votes
2
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.6k
views
answered
Jan 15, 2019
Databases
gate1994
databases
b-tree
normal
descriptive
+
–
13
votes
3
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...
10.1k
views
answered
Jan 2, 2019
Linear Algebra
gatecse-2006
linear-algebra
normal
matrix
+
–
22
votes
4
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 $...
14.1k
views
answered
Jan 1, 2019
Linear Algebra
gatecse-2017-set1
linear-algebra
normal
vector-space
+
–
0
votes
5
Explain why n>43 ??? #Algo
344
views
answered
Dec 18, 2018
Algorithms
algorithms
merge-sort
numerical-answers
test-series
+
–
7
votes
6
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...
24.1k
views
answered
Nov 26, 2018
Operating System
gateit-2005
operating-system
process-synchronization
normal
+
–
52
votes
7
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 = ...
27.1k
views
answered
Nov 25, 2018
Operating System
gatecse-2001
operating-system
process-synchronization
normal
+
–
42
votes
8
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.4k
views
answered
Nov 22, 2018
Digital Logic
gatecse-2016-set2
digital-logic
adder
normal
numerical-answers
+
–
0
votes
9
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.1k
views
answered
Nov 21, 2018
Algorithms
tifr2016
algorithms
asymptotic-notation
+
–
3
votes
10
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.6k
views
answered
Nov 15, 2018
Compiler Design
compiler-design
parsing
lr-parser
+
–
6
votes
11
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
+
–
1
votes
12
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...
447
views
answered
Nov 7, 2018
0
votes
13
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
+
–
0
votes
14
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
639
views
answered
Feb 17, 2018
DS
binary-tree
+
–
0
votes
15
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.5k
views
answered
Feb 17, 2018
Programming in C
programming-in-c
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register