Register
Filter

Answers by Kaushik.P.E

1 votes
1
IIT Madras MS Interview Call Letter
Did anyone received Call Letter for Written Test for IIT Madras MS ( for AIR > 800 - General Category) Program in Computer Science ?
Did anyone received Call Letter for Written Test for IIT Madras MS ( for AIR 800 - General Category) Program in Computer Science ?
2 votes
3
Choose the correct statement about HEAP
I. A heap is always nearly complete tree. II. Worst case complexity of heapify operation is O( log n) III. Worst case complexity of build heap operation is O( n log n) a. I only b. I and II only c. II and III only d. I, II and III
I. A heap is always nearly complete tree.II. Worst case complexity of heapify operation is O( log n)III. Worst case complexity of build heap operation is O( n log n)a. I ...
0 votes
4
gate ec
How C Iam getting D
How C Iam getting D
0 votes
5
gate ece
3 votes
8
C program
What is the error in the following code . Please do correct them #include <stdio.h> int main () { char *x[5] = {"raju","ramu","tinu","ben","ali"}; printf("%s\n",(x[2][0]) ); return 0; }
What is the error in the following code . Please do correct them#include <stdio.h int main () { char *x[5] = {"raju","ramu","tinu","ben","ali"}; printf("%s\n",(x [0]) ); ...
0 votes
9
risc vs cisc
State True/False: "CISC architectures may perform better than RISC architectures in network centric applications."
State True/False: "CISC architectures may perform better than RISC architectures in network centric applications."
1 votes
10
Choose the regular langauge
L1:{wwR∣w,x∈{a,b}∗ and |w|>0},wR is the reverse of string w L2:{wxwR∣w,x∈{a,b}∗ and |w|,|x|>0},wR is the reverse of string w L1 is regular but not L2 L2 is regular but not L1 Both L1 and L2 are regular Neither L1 nor L2 is regular
L1:{wwR∣w,x∈{a,b}∗ and |w|>0},wR is the reverse of string wL2:{wxwR∣w,x∈{a,b}∗ and |w|,|x|>0},wR is the reverse of string wL1 is regular but not L2L2 is regul...
1 votes
13
Compiler design
G : Grammar S1 : Every LALR(1) G is LR(1). S2 : Every LR(1) G is LALR(1). S3: Some LL(1) is Regular. A. TFF B.TFT C. TTF D. FTT E. NONE
G : GrammarS1 : Every LALR(1) G is LR(1).S2 : Every LR(1) G is LALR(1).S3: Some LL(1) is Regular.A. TFF B.TFT C. TTF D. FTT E. NONE
1 votes
14
DBMS normalization concept problem
R(ABCDEF) FD set{ AB->CDE. CD->E, E->C } False statement? A. 2 NF decomposition possible B.3 NF decomposition possible C.BCNF decomposition possible D. ALL
R(ABCDEF)FD set{AB->CDE. CD->E, E->C}False statement?A. 2 NF decomposition possibleB.3 NF decomposition possibleC.BCNF decomposition possibleD. ALL
0 votes
15
Programming problem : Test Series
0 votes
16
TOC Test Series
L1 and L2 Are Decidable. then L1 union L2 is (a)______ and L1 - L2 is(b) _________. a. Regular, cfl ,csl, rel. rec b. decidable, undecidable
L1 and L2 Are Decidable. then L1 union L2 is (a)______and L1 - L2 is(b) _________.a. Regular, cfl ,csl, rel. recb. decidable, undecidable
1 votes
21
BFS traversal
here S1 ans S2 seems confusing for me can someone help me to varify this answer i think given 3 are true in some case??
here S1 ans S2 seems confusing for me can someone help me to varify this answer i think given 3 are true in some case??
6 votes
23
Determine the highest possible normal form of the given relation?
Consider the relation R(Name,courseNO,rolNO,grade) name,courseno ->grade rollno,courseno->grade name->rollno rollno->name Given answer as it is 3NF . But Im getting 1NF. is it correct ?
Consider the relation R(Name,courseNO,rolNO,grade)name,courseno ->graderollno,courseno->gradename->rollnorollno->name Given answer as it is 3NF . But Im getting 1NF. is ...
0 votes
27
ER Diagram to RDMS Model
while converting one to one relationship from ER diagram to RDMS, without total participation on either side, we can represent the relationship using primary- foreign key contraint without making a new table?? Am i right??
while converting one to one relationship from ER diagram to RDMS, without total participation on either side, we can represent the relationship using primary- foreign key...
1 votes
28
concurrency control
IS CONSERVATIVE 2PL ALSO RIGOROUS?? WHEN WE SAY THAT A TRANSACTION FOLLOWS CONSERVATIVE TWO PHASE LOCKING, DOES IT AUTOMATICALLY ALSO IMPLY RIGOROUS 2PL??
IS CONSERVATIVE 2PL ALSO RIGOROUS?? WHEN WE SAY THAT A TRANSACTION FOLLOWS CONSERVATIVE TWO PHASE LOCKING, DOES IT AUTOMATICALLY ALSO IMPLY RIGOROUS 2PL??
Page: