Register
Filter

Recent questions without answers

2 votes
0 answers
11881
compiler sdt
consider the following schema shown below: P-->QRS Q-->Q+R {print(′*′);}R | S R--> R * R {print(′+′); } ε | S S--> Num { print (num.value) ;} | ε { print( ... 5 $' this translation schema will print: a) 2 3 * * 7 5 + $ b) 2 3 + 7 + 5 * $ c) 2 3 * 7 5 + * $
consider the following schema shown below:P >QRSQ >Q+R {print(′*′);}R | SR R * R {print(′+′); } ε | SS Num { print (num.value) ;} | ε { print($)}Here ‘num�...
User Avatar
1 votes
0 answers
11882
c programming
User Avatar
1 votes
0 answers
11883
Ace test series
User Avatar
1 votes
0 answers
11885
Leaf node of the tree always have only inherited atrribute.
Leaf node of the tree always have only inherited atrribute. State true or false.
Leaf node of the tree always have only inherited atrribute.State true or false.
User Avatar
–1 votes
0 answers
11886
Ace test series
User Avatar
2 votes
0 answers
11888
made easy test series
User Avatar
2 votes
0 answers
11889
Disks
Consider the following requests to disk: 138,144,133,95,195,70,20,223,124 Assume the head is initially at 136 and algorithm used is SSTF then the number of times head has changed its direction excluding initial movement is _____________
Consider the following requests to disk:138,144,133,95,195,70,20,223,124Assume the head is initially at 136 and algorithm used is SSTF then the number of times head has c...
User Avatar
1 votes
0 answers
11891
Congestion control
Can anyone please tell me why both network and transport layer has to perform congestion control?
Can anyone please tell me why both network and transport layer has to perform congestion control?
User Avatar
1 votes
0 answers
11892
worst case time complexity
User Avatar
1 votes
0 answers
11893
time complexity of recurrence relation
User Avatar
1 votes
0 answers
11894
merge sort comparisons
User Avatar
2 votes
0 answers
11895
Number of nodes in a parse tree
......
......
User Avatar
3 votes
0 answers
11898
Compiler
User Avatar
1 votes
0 answers
11899
made easy test series
Can anyone tell me the exact logic behind finding this out, is it just about the number of comparisons?
Can anyone tell me the exact logic behind finding this out, is it just about the number of comparisons?
User Avatar
1 votes
0 answers
11900
Network security
here e and z should be relative prime .. But is there any bound on e i.e it should be minimum.... because 43 satisfies it.. but ans is 3
here e and z should be relative prime .. But is there any bound on e i.e it should be minimum.... because 43 satisfies it.. but ans is 3
User Avatar
2 votes
0 answers
11901
cn swp
I'm getting too large values :(
I'm getting too large values :(
User Avatar
1 votes
0 answers
11902
IP header
Shouldn't ans be 40 B
Shouldn't ans be 40 B
User Avatar
1 votes
0 answers
11903
Block Accesses
User Avatar
1 votes
0 answers
11904
permutations and combinations
User Avatar
1 votes
0 answers
11907
Instructions set
A m/c has 32 bit instruction and 10 bit address. There are two types of instrucitons exists in m/c. One address instruction and two address instruction . Suppose the max number of two address instructions are x and max number of one address instructions are y . Then x+y = ?
A m/c has 32 bit instruction and 10 bit address. There are two types of instrucitons exists in m/c. One address instruction and two address instruction . Suppose the max ...
User Avatar
1 votes
0 answers
11908
Computer organisation
Please give explanation of relocatable code
Please give explanation of relocatable code
User Avatar
3 votes
0 answers
11909
Ace Test series: Algorithms - Spanning Tree
Am getting 7. The answer given is 10. A - B , A - D , D - E , E - C are the edges i have included.
Am getting 7. The answer given is 10.A - B , A - D , D - E , E - C are the edges i have included.
User Avatar
Page: