Register
Filter

Questions by srestha

2 votes
2 answers
361
SQL quary
2 votes
1 answer
362
Decidability
L={R | R is a regular expression, with atleast one w belongs to L(R), i.e. 101 is substring of w} Which one true? a)L is decidable b) L is undecidable c)L is partially decidable
L={R | R is a regular expression, with atleast one w belongs to L(R), i.e. 101 is substring of w}Which one true?a)L is decidableb) L is undecidablec)L is partially decida...
1 votes
1 answer
363
Strict and Conservative 2PL
We know, Conservative 2PL is another name of Strict 2PL. But According to Navathe book Conservative 2PL is deadlock free,but Strict 2PL can have deadlock. Then how both could be same??
We know, Conservative 2PL is another name of Strict 2PL. But According to Navathe bookConservative 2PL is deadlock free,but Strict 2PL can have deadlock.Then how both cou...
1 votes
1 answer
364
Linked List
How D) could be answer here? I think for head->next=temp; will not work properly. Am I doing any mistake?
How D) could be answer here?I think for head->next=temp; will not work properly. Am I doing any mistake?
2 votes
2 answers
365
Integration
$\int_{-4}^{4}\left | x-3 \right |dx$
$\int_{-4}^{4}\left | x-3 \right |dx$
1 votes
0 answers
367
SQL....
Why Q1 not correct? Because it is fetching any red part and not every red part,right?? Why Q2 is not correct query? It takes 2 tables and comparing. Is it not fetching single red value?
Why Q1 not correct? Because it is fetching any red part and not every red part,right??Why Q2 is not correct query? It takes 2 tables and comparing. Is it not fetching si...
2 votes
1 answer
368
Conflict Serializable
It is not conflict serializable, So, why not option A) ??
It is not conflict serializable, So, why not option A) ??
1 votes
0 answers
369
Combination
equations are $\left ( \frac{1-x^{11}}{1-x} \right ).\left ( \frac{1-x^{6}}{1-x} \right )\left ( \frac{1-x^{4}}{1-x} \right )$ =(1-x11)(1-x6)(1-x4)(1-x)-3 right?
equations are $\left ( \frac{1-x^{11}}{1-x} \right ).\left ( \frac{1-x^{6}}{1-x} \right )\left ( \frac{1-x^{4}}{1-x} \right )$=(1-x11)(1-x6)(1-x4)(1-x)-3right?
2 votes
2 answers
370
No. of Tables
Plz check this Ans given 5 and I was getting 3 Which one correct??
Plz check this Ans given 5 and I was getting 3Which one correct??
2 votes
1 answer
371
Complexity
#include<stdio.h> int calculate(int n) { int count=0; while(n!=0){ n=(n&(n<<1)); count++ } return count; } output for calculate(143)
#include<stdio.h int calculate(int n) { int count=0; while(n!=0){ n=(n&(n<<1)); count++ } return count; }output for calculate(143)
1 votes
0 answers
372
I node
how 3 could be ans?
how 3 could be ans?
2 votes
0 answers
373
Compiler
$S\rightarrow AaB$ $A\rightarrow ab|a$ $B\rightarrow b$ Above grammar is a)Not LR(0) b)Not LR(0) but SLR(1),CLR(1)
$S\rightarrow AaB$$A\rightarrow ab|a$$B\rightarrow b$Above grammar isa)Not LR(0)b)Not LR(0) but SLR(1),CLR(1)
2 votes
1 answer
374
LL(1)
Which of the following is LL(1) conflict? a)FIRST/FIRST conflict b)FIRST/FOLLOW conflict c) both d)none
Which of the following is LL(1) conflict?a)FIRST/FIRST conflictb)FIRST/FOLLOW conflictc) bothd)none
1 votes
0 answers
375
Time Complexity
foo(int n, int a[]) { int i=0,j=0; for(i=0;i<=n;i++) while (j<n && A[i]<A[j]) j++; } Time complexity of foo()
foo(int n, int a[]) { int i=0,j=0; for(i=0;i<=n;i++) while (j<n && A[i]<A[j]) j++; }Time complexity of foo()
3 votes
2 answers
376
Linked List
Which of the following is worst choice to sort a linked list? a)Merge Sort b) Quick Sort c) heap sort d) Insertion sort
Which of the following is worst choice to sort a linked list?a)Merge Sortb) Quick Sortc) heap sortd) Insertion sort
1 votes
0 answers
377
Numerical
Aptitude
Aptitude
5 votes
1 answer
379
Token
How many tokens are there? 1) int a /*b 2) printf ("%
How many tokens are there?1) int a /*b2) printf ("%
2 votes
1 answer
380
Integration
$\int_{0}^{\frac{\pi }{2}}\frac{cosx}{2\sqrt{1-sinx}}dx=?$
$\int_{0}^{\frac{\pi }{2}}\frac{cosx}{2\sqrt{1-sinx}}dx=?$
Page: