Register
Filter

Questions by Rackson

0 votes
1 answer
1
Permutation and Combination
The total number of ways in which 5 balls of different color can be distributed among 3 persons so that each person gets at least one ball is:
The total number of ways in which 5 balls of different color can be distributed among 3 persons so that each person gets at least one ball is:
1 votes
1 answer
3
Time complexity
0 votes
1 answer
4
Algorithms Time complexity
0 votes
2 answers
5
Digital logic
plz tell how it take common B’ and B
plz tell how it take common B’ and B
0 votes
2 answers
6
DBMS transaction
Which of the following is used to get back all the transactions back after rollback? a)Rollback b)Commit c)undo d)Redo
Which of the following is used to get back all the transactions back after rollback?a)Rollbackb)Commitc)undo d)Redo
0 votes
0 answers
7
uppcl AE
0 votes
0 answers
8
Digital Logic
In this Question, two option is same ..how can decide which true or false
In this Question, two option is same ..how can decide which true or false
0 votes
1 answer
9
Discreate Math logic
0 votes
1 answer
10
Digital Karnaugh Map
0 votes
1 answer
11
Aptitude and Ratio
Please Explain it
Please Explain it
1 votes
3 answers
13
#addressing
Consider a hypothetical CPU which supports 16 bit instruction, 64 registers and 1 KB memory space. If there exist 12 2-address instruction which uses register reference and 12 1-address memory reference instructions how many O-address instructions are possible?
Consider a hypothetical CPU which supports 16 bit instruction, 64 registers and 1 KB memory space. If there exist 12 2-address instruction which uses register reference a...
0 votes
1 answer
14
Theory of computation
Which of the following CFG’s can’t be simulated by an FSM ? a. S->Sa/b b. S->aSb/ab c. S->abX, X->cY, Y->d/aX d. None of these
Which of the following CFG’s can’t be simulated by an FSM ?a.S->Sa/bb.S->aSb/abc.S->abX, X->cY, Y->d/aXd.None of these
0 votes
1 answer
15
#os memory
Assume memory access time is 10 us and reading a page from disk takes 10 ms. If page fault occur in 0.5% of the memory references en what is the average memory access time (in usec)?
Assume memory access time is 10 us and reading a page from disk takes 10 ms. If page fault occur in 0.5% of the memory references en what is the average memory access tim...
1 votes
2 answers
17
test series
How big is a 8-way set associative cache (in KB), made up of 32 bit words, 4 words per line and having 2048 sets?
How big is a 8-way set associative cache (in KB), made up of 32 bit words, 4 words per lineand having 2048 sets?
0 votes
1 answer
19
Huffman coding question
Question:What is the time complexity of Huffman algorithms when the input is already sorted
Question:What is the time complexity of Huffman algorithms when the input is already sorted