Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Kaluti
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by Kaluti
1
votes
0
answers
41
computer networks
Consider the following statements with respect to digital signatures: S1: Digital signature ensures authenticity of the sender but not integrity of the message. S2: A single secret key can be used by the sender to sign multiple documents for multiple receiver. S3 ... . S4: Both RSA cryptosystem and RSA digital signature scheme uses same set of keys. Which of the following is true?
Consider the following statements with respect to digital signatures:S1: Digital signature ensures authenticity of the sender but not integrity of the message.S2: A singl...
389
views
asked
Jan 23, 2018
1
votes
0
answers
42
computer network
212
views
asked
Jan 23, 2018
1
votes
0
answers
43
COMPUTER NETWORK
Consider the following statements : S1 : An absence of DHCP server can create trouble while using IPv6 protocol. S2 : IPv6 does not support broadcasting. S3 : By the use of handshake frames (RTS and CTS), the hidden station problem of IEEE802.11 can be eliminated. The number of correct statements are _______.
Consider the following statements :S1 : An absence of DHCP server can create trouble while using IPv6 protocol.S2 : IPv6 does not support broadcasting.S3 : By the use of ...
520
views
asked
Jan 23, 2018
3
votes
1
answer
44
theory of computation
The minimum number of states needed for DFA of langauge L is ________.
The minimum number of states needed for DFA of langauge L is ________.
929
views
asked
Jan 23, 2018
1
votes
0
answers
45
theory of computation
explain why L1 and L3 are not cfl
explain why L1 and L3 are not cfl
233
views
asked
Jan 22, 2018
1
votes
0
answers
46
theory of computation
Consider the following CFG : s->0s0|1s1|0|1|epsilon For the above CFG, the total number of strings generated whose length is less than or equal to 7 [exclude the empty string] is ____________.
Consider the following CFG : s->0s0|1s1|0|1|epsilon For the above CFG, the total number of strings generated whose length is less than or equal to 7 [exclude the empty st...
221
views
asked
Jan 22, 2018
1
votes
0
answers
47
theory of computation
second one is regular how first one is regular
second one is regular how first one is regular
220
views
asked
Jan 22, 2018
1
votes
0
answers
48
programming & DS
456
views
asked
Jan 22, 2018
1
votes
0
answers
49
theory of computation
Consider the following statements: S1: For any two sets A and B, if A is uncountably infinite and B is countably infinite, then A ∩ B is countably infinite. S2: For any two languages A and B, if A ⊆ B, then A is reducible to B. The number of incorrect statements are _____.
Consider the following statements:S1: For any two sets A and B, if A is uncountably infinite and B is countably infinite, then A ∩ B iscountably infinite.S2: For any tw...
263
views
asked
Jan 21, 2018
3
votes
0
answers
50
algorithms
Consider you start in city s' and need to drive to city t ' and you will follow the road via cities (in sequence) a1,a2, a3,..., an. Given all the distances between consecutive cities and prices of gas at each station in the above table: If car ... Your goal to make the trip spending as little as possible on gas. The optimal cost for tour is __________. (Assume initially tank is full)
Consider you start in city ‘s’ and need to drive to city ‘t ’ and you will follow the road via cities (in sequence) a1,a2, a3,..., an. Given all the distances bet...
473
views
asked
Jan 21, 2018
2
votes
1
answer
51
algorithms
349
views
asked
Jan 21, 2018
Algorithms
algorithms
time-complexity
test-series
+
–
1
votes
0
answers
52
algorithms
Merge sort using a linked list is efficient compared to array in terms of space complexity.plz explain
Merge sort using a linked list is efficient compared to array in terms of space complexity.plz explain
163
views
asked
Jan 20, 2018
1
votes
0
answers
53
algorithms
Consider a sorted array of integers, we have to implement the function Max( ) with input ‘x’, which find the maximum element present in array which is smaller than or equal to ‘x’. If “x” is smallest element then Max( ) will return “0”. What is the time complexity taken by Max( )?
Consider a sorted array of integers, we have to implement the function Max( ) with input ‘x’, which find the maximum element present in array which is smaller than or...
299
views
asked
Jan 20, 2018
0
votes
0
answers
54
algorithms
You are given a set of n nuts and another set of n bolts such that they form n distinct pairs of matching nuts and bolts, i.e., each of the bolts go into one nut only. What will the number of comparisons to matching operation conducted in an effective manner ... is trying to fit a bolt into a nut and thereby concluding whether they are of equal size, or find out which is greater in size)
You are given a set of n nuts and another set of n bolts such that they form n distinct pairs of matching nuts and bolts, i.e., each of the bolts go into one nut only. Wh...
310
views
asked
Jan 17, 2018
1
votes
0
answers
55
programming & DS
How many enqueue and dequeue operations are required to perform a pop operation if Q1 contains n elements initially?
How many enqueue and dequeue operations are required to perform a pop operation if Q1 contains n elements initially?
244
views
asked
Jan 17, 2018
1
votes
0
answers
56
programming & DS
Consider the following statements: S1 : Implementation of stack using queue, deletion of second element from top of stack time complexity Ο(n), when insertion take Ο(1) time. S2 : In implementation of queue using stack, deletion of second element from front take Ο(1) time, when insertion take Ο(n) time. Which of the following is correct ? A Only S1 B Only S2 C Both S1 and S2
Consider the following statements:S1 : Implementation of stack using queue, deletion of second element from top of stack time complexity Ο(n), when insertion take Ο(1) ...
179
views
asked
Jan 15, 2018
1
votes
0
answers
57
programming & DS
C the number of additions performed by above code? A 8000 B 4000 C 4020 D 28420
Cthe number of additions performed by above code?A 8000B 4000C 4020D 28420
154
views
asked
Jan 15, 2018
2
votes
0
answers
58
programming & DS
Which of the following is true? A When stack is implemented using two queues, then insertion will take O(1) time while deletion will take O(n) time. B When stack is implemented using linked list, then insertion and deletion will take O(1) time C Stack is used to implement breadth first search D Both (a) and (b)
Which of the following is true?AWhen stack is implemented using two queues, then insertion will take O(1) time while deletion will take O(n) time.BWhen stack is implement...
239
views
asked
Jan 15, 2018
1
votes
1
answer
59
programming &DS
252
views
asked
Jan 15, 2018
2
votes
1
answer
60
programming and data structures
A 4-ary i.e., either has 0 children or has 4 children tree has 20 leaf nodes. Then the total number of nodes in the tree are ________.
A 4-ary i.e., either has 0 children or has 4 children tree has 20 leaf nodes. Then the total number of nodes in the tree are ________.
331
views
asked
Jan 14, 2018
Page:
« prev
1
2
3
4
5
6
7
8
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register