Register
Filter

Answers by stblue

4 votes
3
RSA Public key Cryptosystem
Plz tell me how to solve this .I am feeling problem o calculate -- 10 = p^5 mod 35 . How to solve this type of question quickly.
Plz tell me how to solve this .I am feeling problem o calculate 10 = p^5 mod 35 . How to solve this type of question quickly.
0 votes
4
NIELIT 2017 DEC Scientist B - Section B: 50
Let $n$ is the length of string to test for membership, then the number of table entry in CYK algorithm is $n(n+1)$ $n^2+1$ $n^2-1$ $n(n+1)/2$
Let $n$ is the length of string to test for membership, then the number of table entry in CYK algorithm is$n(n+1)$$n^2+1$$n^2-1$$n(n+1)/2$
3 votes
5
Number of Essential prime implicants
Find the number of Essential prime implicants present in the K Map of the function f=Σ(2,3,5,7,8,12,13).Here the answer is 2,can anybody explain why it is 2?
Find the number of Essential prime implicants present in the K Map of the functionf=Σ(2,3,5,7,8,12,13).Here the answer is 2,can anybody explain why it is 2?
2 votes
6
set associative
Computer has 256KB 8 way set associative cache memory.The number of tag bits in its physical address format is 6 bits then size of the physical memory is __________mega bye
Computer has 256KB 8 way set associative cache memory.The number of tag bits in its physical address format is 6 bits then size of the physical memory is __________mega b...
0 votes
7
Modified Binary Search
Suppose the first step in binary search algorithm is changed to M = (9L+R)/10, we know that the complexity of binary search is log(n). What will be the complexity of modified search? a) log(n) b) n c) n$\log 9/10(n)$ d) 2nlog(n)
Suppose the first step in binary search algorithm is changed to M = (9L+R)/10, we know that the complexity of binary search is log(n). What will be the complexity of modi...
1 votes
8
Complement
State True or False 1. -128 can be represented in 1's complement 8 bit number 2. -128 can be represented in 2's complement 8 bit number
State True or False1. -128 can be represented in 1's complement 8 bit number2. -128 can be represented in 2's complement 8 bit number
2 votes
9
made easy test series
1 votes
12
Depth first Search
What should be the answer?? Key is given as opttion B. . !! I was getting D) None
What should be the answer?? Key is given as opttion B. . !! I was getting D) None
3 votes
15
Parsing_LR(1)Items
0 votes
16
Gate 2008
1 votes
17
gate overflow
A DMA module is transferring bytes to memory using cycle stealing mode from a device transmitting at 16 KB/s. The processor is fetching instructions at the rate of 1 MB/s. The percentage by which the processor will be slowed down due to the DMA activity is ______
A DMA module is transferring bytes to memory using cycle stealing mode from a device transmitting at 16 KB/s. The processor is fetching instructions at the rate of 1 MB/s...
2 votes
19
UGC NET CSE | June 2007 | Part 2 | Question: 11
The following loop in $’C’$: int i=0; while (i++<0)i--; will terminate will go into an infinite loop will give compilation error will never be executed
The following loop in $’C’$:int i=0; while (i++<0)i ;will terminatewill go into an infinite loopwill give compilation errorwill never be executed
4 votes
20
test-series
L,L3 is which type of language ?are L3,L CFL ?????
L,L3 is which type of language ?are L3,L CFL ?????
0 votes
26
digital logic
1 votes
27
digital logic
F = w'xz + w'yz + x'yz' + wxy'z d = wyz The minimum no of nand and nor gate required to implement the above function respectively are :
F = w'xz + w'yz + x'yz' + wxy'zd = wyzThe minimum no of nand and nor gate required to implement the above function respectively are :
2 votes
28
test-series
Page: