Register
Filter

Recent activity by bharti

2 answers
5
test series
Identify the language : L1={ a^p b^q c^r / p<=q} L2 = {a^p b^q c^r / p>q } L3 = {a^p b^q c^r / q = r } where p ,q,r >= 0 then { L1 U L2 U L3 } is A. regular B.CFl but not Dcfl C. Cfl
Identify the language :L1={ a^p b^q c^r / p<=q}L2 = {a^p b^q c^r / p>q }L3 = {a^p b^q c^r / q = r } where p ,q,r >= 0then { L1 U L2 U L3 } is A. regular B.CFl bu...
2 answers
7
#DBMS What will be the Minimum Number of Tuples?
Say we have two relations R (a,b,c) and S (b,d,e). Now, R has 200 tuples and S has 300 tuples. What will be Minimum number of tuples when we do R ⋈ S ( ⋈ = Natural Join)?
Say we have two relations R (a,b,c) and S (b,d,e).Now, R has 200 tuples and S has 300 tuples. What will be Minimum number of tuples when we do R ⋈ S ( ⋈ = Natural Joi...
1 answer
9
Binary tree
What is maximum possible height of BFS tree,if BSF is run on complete bipartisan graph Km,n where m>=1,n>=1 and starting vertex is S
What is maximum possible height of BFS tree,if BSF is run on complete bipartisan graph Km,n where m>=1,n>=1 and starting vertex is S
1 answer
13
data base 2
1 answer
18
Number of WAR
Number of WAR dependencies possible R1 <- R3 + R2 R3 <- R3 + R5 R3 <- R2 + R3 Is it 2 or 3?
Number of WAR dependencies possibleR1 <- R3 + R2R3 <- R3 + R5R3 <- R2 + R3Is it 2 or 3?
1 answer
19
compiler
S->SAS | a A->AA | b is the grammar a) LR(0) b)SLR(1) c)LALR(1) d)none
S->SAS | aA->AA | bis the grammara) LR(0)b)SLR(1)c)LALR(1)d)none
1 answer
20
Multilevel Pagetable
Ques. On a System with 32 bit address and 4KB pages how many levels are required in multilevel page table(assuming page table entry is of 4 bytes of storage)? (A). 2 (B). 3 (C). 1 (D) None plz explain the solution
Ques. On a System with 32 bit address and 4KB pages how many levels are required in multilevel page table(assuming page table entry is of 4 bytes of storage)?(A). 2(B). 3...
2 answers
22
Block Nested Loop Join
Consider a relation R with 2000 records and relation S with 500 records. Size of each record is 5 Byte and block size is 100 Byte, then minimum number of block access that are needed block nested loop join. I think its answer should be 2525.
Consider a relation R with 2000 records and relation S with 500 records. Size of each record is 5 Byte and block size is 100 Byte, then minimum number of block access tha...
5 answers
25
GATE CSE 2005 | Question: 23
Packets of the same session may be routed through different paths in: TCP, but not UDP TCP and UDP UDP, but not TCP Neither TCP nor UDP
Packets of the same session may be routed through different paths in:TCP, but not UDPTCP and UDPUDP, but not TCPNeither TCP nor UDP
4 answers
26
GATE CSE 2002 | Question: 2.20
Dynamic linking can cause security concerns because Security is dynamic The path for searching dynamic libraries is not known till runtime Linking is insecure Cryptographic procedures are not available for dynamic linking
Dynamic linking can cause security concerns becauseSecurity is dynamicThe path for searching dynamic libraries is not known till runtimeLinking is insecureCryptographic p...