Register
Filter

Recent activity by kman30

0 answers
1
query
I am filling BARC application but my application is not going past qualification details since 2-3 days . Can anyone help me with this ?
I am filling BARC application but my application is not going past qualification details since 2-3 days .Can anyone help me with this ?
0 answers
2
Self doubt Checkpoint
If in a database checkpoint log based recovery we know that if we see (<tn,start>,<tn,commit>) or (<tn ,commit>) we put it in redo list ? But where to put the log if we see (<tn,start><tn,abort>) in redo list or undo list ?
If in a database checkpoint log based recovery we know that if we see (<tn,start>,<tn,commit>) or (<tn ,commit>) we put it in redo list ? But where to put the log if we s...
6 answers
3
GATE CSE 2016 Set 2 | Question: 51
Consider the following database schedule with two transactions $T_{1}$ and $T_{2}$ ... is TRUE? $S$ is non-recoverable. $S$ is recoverable, but has a cascading abort. $S$ does not have a cascading abort. $S$ is strict.
Consider the following database schedule with two transactions $T_{1}$ and $T_{2}$.$S= r_{2}\left(X\right); r_{1}\left(X\right); r_{2} \left(Y\right); w_{1} \left(X\right...
2 answers
4
made easy test series
Consider the following language:? L= {w | w $\epsilon$ {0,1}* , w has equal number of occurrences of ‘001’ and ‘010’} Is L regular? If so, please provide a DFA for L.
Consider the following language:?L= {w | w $\epsilon$ {0,1}* , w has equal number of occurrences of ‘001’ and ‘010’}Is L regular? If so, please provide a DFA for ...
1 answer
6
GATE CSE 2011 | Question: 46
Database table by name $\text{Loan_Records}$ ... Bank_Manager FROM Loan_Records) AS S NATURAL JOIN (SELECT Bank_Manager, Loan_Amount FROM Loan_Records) AS T ); $3$ $9$ $5$ $6$
Database table by name $\text{Loan_Records}$ is given below.$$\begin{array}{|c|c|c|} \hline \textbf {Borrower} & \textbf {Bank_Manager} &\textbf {Loan_Amount} \\\hline \...
0 answers
7
Ace Test Series: Compiler - Parser Conflicts
Consider the following CFG. S → aSa|bSb|a|b Number of conflicts in LR(0) State Diagram? 2 8 10 4
Consider the following CFG.S → aSa|bSb|a|bNumber of conflicts in LR(0) State Diagram?28104
3 answers
10
compiler phase error
int main(){ int a = 10; fun(a); } void fun(int a){ printf(“%d”,a); } Which phase of the compiler will raise an error? Lexical syntax semantics none of the above
int main(){int a = 10;fun(a);}void fun(int a){printf(“%d”,a);}Which phase of the compiler will raise an error?Lexical syntaxsemanticsnone of the above
3 answers
11
Self doubt
How many tokens in this a>>=1; and a! , Will >>= and a! be treated as a single token ?
How many tokens in thisa>>=1;and a! , Will >>= and a! be treated as a single token ?
1 answer
13
Parsing LALR
If LALR(1) parser have shift reduce conflict then CLR(1) parser must have shift reduce conflict, why?
If LALR(1) parser have shift reduce conflict then CLR(1) parser must have shift reduce conflict, why?
0 answers
14
MadeEasy Test Series 2019 Query
Is anyone giving made easy test series for 2019 gate i would like to discuss some questions. because i feel like there are many questions in the test series which are wrong and they don’t respond.
Is anyone giving made easy test series for 2019 gatei would like to discuss some questions.because i feel like there are many questions in the test series which are wrong...
3 answers
15
Self doubt
Virtual memory increases context switching overhead ? Why why not ?
Virtual memory increases context switching overhead ? Why why not ?
1 answer
17
Number of Topological Order
Find the number of Topological order(sort) in the given graph? $(1)$ $(2)$
Find the number of Topological order(sort) in the given graph?$(1)$$(2)$
8 answers
18
GATE IT 2005 | Question: 23, ISRO2017-67
A B-Tree used as an index for a large database table has four levels including the root node. If a new key is inserted in this index, then the maximum number of nodes that could be newly created in the process are $5$ $4$ $3$ $2$
A B-Tree used as an index for a large database table has four levels including the root node. If a new key is inserted in this index, then the maximum number of nodes tha...
0 answers
19
Why 1Kbps bandwidth is 1000 bits per sec and not 1024 bits per sec?
While solving numerical problems of computer networks, I saw bandwidth of 1Kbps was taken as 1000bps. I was getting wrong answers as I was calculating using 1024bps. What is reason for taking K as 1000 and not 1024 in bandwidth?
While solving numerical problems of computer networks, I saw bandwidth of 1Kbps was taken as 1000bps. I was getting wrong answers as I was calculating using 1024bps. What...
1 answer
20
grade up
Assuming that a pointer take 4 bytes and the size of an integer is 2 bytes. What is the size of the *a in declaration: int (*a) [10][2] ? 4 80 20 40
Assuming that a pointer take 4 bytes and the size of an integer is 2 bytes. What is the size of the *a in declaration: int (*a) [10] ? 4802040
0 answers
24
made easy 2018
The number of positive number which divides either 2700 or 9000 are _________? i am getting 20
The number of positive number which divides either 2700 or 9000 are _________? i am getting 20
11 answers
27
GATE IT 2007 | Question: 28
Consider a hash function that distributes keys uniformly. The hash table size is $20$. After hashing of how many keys will the probability that any new key hashed collides with an existing one exceed $0.5$. $5$ $6$ $7$ $10$
Consider a hash function that distributes keys uniformly. The hash table size is $20$. After hashing of how many keys will the probability that any new key hashed collide...
8 answers
28
GATE CSE 1998 | Question: 1.1
A die is rolled three times. The probability that exactly one odd number turns up among the three outcomes is $\dfrac{1}{6}$ $\dfrac{3}{8}$ $\dfrac{1}{8}$ $\dfrac{1}{2}$
A die is rolled three times. The probability that exactly one odd number turns up among the three outcomes is$\dfrac{1}{6}$ $\dfrac{3}{8}$ $\dfrac{1}{8}$ $\dfrac{1}{2}...
0 answers
29
Doubt -OS process scheduling
If arrival time of a process is same as the end time of quantum slice for a process in round robin schedule then in what order we must place the processes in ready queue?
If arrival time of a process is same as the end time of quantum slice for a process in round robin schedule then in what order we must place the processes in ready queue?...