Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
rajoramanoj
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by rajoramanoj
0
votes
0
answers
1
turing machine
which of the following turing recognizable..????? L1 = {⟨M⟩∣ TM M accepts more than 2 distinct inputs} L2 = {⟨M⟩∣ TM M accepts at most 2 distinct inputs}
which of the following turing recognizable..?????L1 = {⟨M⟩∣ TM M accepts more than 2 distinct inputs}L2 = {⟨M⟩∣ TM M accepts at most 2 distinct inputs}
304
views
asked
Feb 1, 2018
Theory of Computation
turing-machine
+
–
2
votes
1
answer
2
self doubt
If packet with TTL value = 0 received at destination, then destination discard that packet or accept that packet.
If packet with TTL value = 0 received at destination, then destination discard that packet or accept that packet.
1.2k
views
asked
Jan 28, 2018
2
votes
1
answer
3
computer-networks csma-cd
Consider CSMA/CD LAN with bandwidth 10 Mbps and propagation delay of 5 μsec. Repeaters are not allowed in this system. Data frames are 512 bits long, including 32 bits of header, checksum and other overhead. The first bit slot after a successful ... . The effective data rate of the network is ________ (in Mbps). (Excluding overhead, assuming that there are no collisions)
Consider CSMA/CD LAN with bandwidth 10 Mbps and propagation delay of 5 μsec. Repeaters are not allowed in this system. Data frames are 512 bits long, including 32 bits o...
1.1k
views
asked
Jan 17, 2018
Computer Networks
computer-networks
csma-cd
+
–
1
votes
0
answers
4
combination
The number of seven digit integers possible with sum of the digits equal to 11 and formed by using the digits 1, 2 and 3 only are
The number of seven digit integers possible with sum of the digits equal to 11 and formed by using the digits 1, 2 and 3 only are
266
views
asked
Jan 17, 2018
Mathematical Logic
combinatory
+
–
2
votes
0
answers
5
max heap
The number of distinct max heap are possible with keys 1, 2, 3, 4, 5 are
The number of distinct max heap are possible with keys 1, 2, 3, 4, 5 are
789
views
asked
Jan 17, 2018
5
votes
0
answers
6
hashing
Consider a hash table with 10 slots. Collisions are resolved using linear probing. The probability that if first 3 slots are unfilled and 4th insertions leads to a collisions
Consider a hash table with 10 slots. Collisions are resolved using linear probing. The probability that if first 3 slots are unfilled and 4th insertions leads to a collis...
706
views
asked
Jan 17, 2018
DS
hashing
probability
+
–
2
votes
0
answers
7
ccombination
An entrepreneur needs to assign 5 different tasks to three of his employees. If every employee is assigned atleast 1 task, how many ways can the entrepreneur assign those tasks to his employees? explain in detail....
An entrepreneur needs to assign 5 different tasks to three of his employees. If every employee is assigned atleast 1 task, how many ways can the entrepreneur assign those...
384
views
asked
Jan 14, 2018
Mathematical Logic
discrete-mathematics
combinatory
+
–
3
votes
0
answers
8
chaining
318
views
asked
Jan 11, 2018
4
votes
0
answers
9
round robin
462
views
asked
Jan 11, 2018
2
votes
2
answers
10
probability
The probability of a man hitting a target in one fire is 1/4 The number of times at least he must fire at the target in order that his chance of hitting the target at least once will exceed 2/3 will be _______.
The probability of a man hitting a target in one fire is 1/4 The number of times at least he must fire at the target in order that his chance of hitting the target at le...
631
views
asked
Jan 7, 2018
1
votes
1
answer
11
conflict serializable schedules
How many concurrent schedules are conflict serializable of given transactions T1 and T2 :
How many concurrent schedules are conflict serializable of given transactions T1 and T2:
508
views
asked
Jan 7, 2018
4
votes
0
answers
12
DAG representation
Consider the basic block given below: u=u+v v=u-v w=u+x x=w/v The minimum number of nodes and edges present in the DAG representation of the above basic block respectively are:
Consider the basic block given below:u=u+vv=u-vw=u+xx=w/vThe minimum number of nodes and edges present in the DAG representation of the above basic block respectively are...
712
views
asked
Jan 5, 2018
1
votes
0
answers
13
B+ tree
Database file consist 50000 records with record size 100 bytes, block size 512 bytes. If sparse B+ tree index build over given database file with search key size 20 bytes both block pointer and record pointer sizes 12 bytes each. How many maximum index blocks required if node order P is defined as between ⎡P/2⎤ to P pointers per node?
Database file consist 50000 records with record size 100 bytes, block size 512 bytes. If sparse B+ tree index build over given database file with search key size 20 bytes...
426
views
asked
Jan 2, 2018
1
votes
0
answers
14
B/B+ TREE
Which of the following statement true about B tree and B+ tree index? Assume order of B tree node same as order of B+ tree node. (A) B tree index has more levels than B+ tree index for large number of keys. (B) B+ tree index has more levels than B tree index ... C) Both B tree B+ tree best for sequential access of records. (D) B tree index nodes more than B+ tree for large number of keys.
Which of the following statement true about B tree and B+ tree index? Assume order of B tree node same as order of B+ tree node.(A) B tree index has more levels than B+ t...
541
views
asked
Jan 2, 2018
Databases
b-tree
+
–
1
votes
1
answer
15
no. of functions
The number of function from set {1, 2, 3, 4, 5, 6, 7, 8} to set {0, 1} such that assign 1 to exactly one of given number less than 8 are .......................
The number of function from set {1, 2, 3, 4, 5, 6, 7, 8} to set {0, 1} such that assign 1 to exactly one of given number less than 8 are .......................
312
views
asked
Dec 22, 2017
1
votes
1
answer
16
TIME COMPLEXITY
973
views
asked
Nov 6, 2017
Algorithms
algorithms
time-complexity
made-easy-test-series
+
–
0
votes
0
answers
17
SELF DOUBT
588
views
asked
Nov 6, 2017
1
votes
2
answers
18
NO. OF BST POSSIBLE
835
views
asked
Nov 6, 2017
DS
data-structures
binary-search-tree
numerical-answers
+
–
1
votes
0
answers
19
self-doubt i think greedy is correct
438
views
asked
Nov 1, 2017
1
votes
0
answers
20
test-series-tree
430
views
asked
Oct 19, 2017
DS
test-series
+
–
Page:
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register