Register
Filter

Recent activity by sanyam53

0 answers
2
compiler-design parsing no of states
The number of states in SLR parser for G is _______. for this type of question , Do we consider augmented entry state like S'->S. ????
The number of states in SLR parser for G is _______.for this type of question , Do we consider augmented entry state like S'->S. ????
8 answers
4
GATE CSE 2015 Set 3 | Question: 7
Consider the following C program segment. # include <stdio.h> int main() { char s1[7] = "1234", *p; p = s1 + 2; *p = '0'; printf("%s", s1); } What will be printed by the program? $12$ $120400$ $1204$ $1034$
Consider the following C program segment.# include <stdio.h int main() { char s1[7] = "1234", *p; p = s1 + 2; *p = '0'; printf("%s", s1); }What will be printed by the pro...
2 answers
6
DBMS Normalisation
Consider a schema R(A, B, C, D) and functional dependencies {AB → C, C → D, D→ A}. Then the decomposition of R into R1 (CD), R2 (AC) and R3 (BC) is in a. 1NF but not 2NF b. 2NF but not 3NF c. 3NF but not BCNF d. BCNF
Consider a schema R(A, B, C, D) and functional dependencies {AB → C, C → D, D→ A}. Then the decomposition of R into R1 (CD), R2 (AC) and R3 (BC) is ina. 1NF but not...
2 answers
8
OS Semaphore
1 answer
9
Doubt OS - Round Robin- Context Switch
How many time context switch in Round Robin? ( if only one process remain in ready queue at end of scheduling does that count every time, when time slice over or only one time?)
How many time context switch in Round Robin? ( if only one process remain in ready queue at end of scheduling does that count every time, when time slice over or only one...
1 answer
11
graph theory
Assumed undirected graph G is connected. G has 6­vertices and 10 edges. Find the minimum number of edges whose deletion from graph G is always guarantee that it will become disconnected.
Assumed undirected graph G is connected. G has 6­vertices and 10 edges. Findthe minimum number of edges whose deletion from graph G is always guaranteethat ...
1 answer
12
test series counting
The number of pairs of set (X, Y) are there that satisfy the condition X, Y ⊆ {1, 2, 3, 4, 5, 6} and X ∩ Y = Φ ________.
The number of pairs of set (X, Y) are there that satisfy the condition X, Y ⊆ {1, 2, 3,4, 5, 6} and X ∩ Y = Φ ________.
1 answer
13
Test series
Can any one answer that ravula test series are good or not? , because made easy is horrible.
Can any one answer that ravula test series are good or not? , because made easy is horrible.
1 answer
14
Made easy #counting
Consider a bit­string of length 10 containing only 0 and 1. The number of string contain 3 consicutive 0’s or 3 consicutive 1’s are ________
Consider a bit­string of length 10 containing only 0 and 1. The number of stringcontain 3 consicutive 0’s or 3 consicutive 1’s are ________
4 answers
15
GATE CSE 2001 | Question: 1.14
Randomized quicksort is an extension of quicksort where the pivot is chosen randomly. What is the worst case complexity of sorting n numbers using Randomized quicksort? $O(n)$ $O(n \log n)$ $O(n^2)$ $O(n!)$
Randomized quicksort is an extension of quicksort where the pivot is chosen randomly. What is the worst case complexity of sorting n numbers using Randomized quicksort?$O...
9 answers
16
GATE IT 2004 | Question: 13
Let $P$ be a singly linked list. Let $Q$ be the pointer to an intermediate node $x$ in the list. What is the worst-case time complexity of the best-known algorithm to delete the node $x$ from the list ? $O(n)$ $O(\log^2 n)$ $O(\log n)$ $O(1)$
Let $P$ be a singly linked list. Let $Q$ be the pointer to an intermediate node $x$ in the list. What is the worst-case time complexity of the best-known algorithm to del...