Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by utk0203
1
answer
1
Total number of states in NFA
How many NFA with exactly four states can be constructed over the alphabet S= {a, b} with designated initial state?
How many NFA with exactly four states can be constructed over the alphabet S= {a, b} withdesignated initial state?
2.4k
views
commented
Jan 31, 2019
Theory of Computation
theory-of-computation
+
–
1
answer
2
made easy
consider the speed of propagation of a signal along a cable is 2*10^8m/s and metwork has 10Mbps CSMA/CD network interconnecting 10 computers shown in below image.each computer is connected to the hub with a cable of different length .Computer H1 is ... 2.5 microseconds.what is the shortest packet length Lmin of this network in order to ensure that the CSMA/CD functions properly?
consider the speed of propagation of a signal along a cable is 2*10^8m/s and metwork has 10Mbps CSMA/CD network interconnecting 10 computers shown in below image.each com...
1.6k
views
commented
Jan 10, 2019
1
answer
3
Lossless join
1.0k
views
commented
Dec 25, 2018
Databases
databases
decomposition
lossless-join
+
–
0
answers
4
Madeeasy DBMS- 2PL-2019- what is to be checked to ensure allowance under 2PL?
What exactly is to be checked for test for 2PL? is a schedule being SERIALIZABLE sufficent to declare its allowed under 2PL?
What exactly is to be checked for test for 2PL?is a schedule being SERIALIZABLE sufficent to declare its allowed under 2PL?
306
views
commented
Dec 25, 2018
0
answers
5
Continous Probability
Find the value of $\lambda$ such that function f(x) is valid probability density function $f(x)=\lambda (x-1)(2-x)$ for $1 \leq x \leq 2$ $=0$ otherwise My $\lambda$ is coming to be $- \frac{6}{5}$ Am I correct?
Find the value of $\lambda$ such that function f(x) is valid probability density function$f(x)=\lambda (x-1)(2-x)$ for $1 \leq x \leq 2$$=0$ otherwise My $\lambda$ is com...
1.4k
views
commented
Nov 15, 2018
Probability
probability
random-variable
+
–
1
answer
6
How to find total no of integer solutions to the below equation ?
In X+y+z<=12 , X,y,z>=1 How to find total no of integral solutions ?If you are introducing any dummy variable for solving , please do explain the logic behind this .
In X+y+z<=12 , X,y,z>=1 How to find total no of integral solutions ?If you are introducing any dummy variable for solving , please do explain the logic behind this .
1.8k
views
commented
Nov 11, 2018
Combinatory
combinatory
+
–
2
answers
7
ER Diagrams - Minimum Number of Tables required
How many minimum number of tables needed for this Quaternary Relationship?
How many minimum number of tables needed for this Quaternary Relationship?
2.3k
views
commented
Nov 4, 2018
Databases
databases
er-diagram
er-to-relational
relational
+
–
0
answers
8
Super keys
806
views
commented
Nov 4, 2018
2
answers
9
Ace test series
Guys, I am not getting C as the ans..Can someone help.
Guys, I am not getting C as the ans..Can someone help.
592
views
commented
Nov 3, 2018
1
answer
10
madeeasy work book
which of the following is decidable? 1)for some input if an arbitrary TM makes 5 moves. 2) whether an arbitary TM halts within 5 steps 3) whether an arbitary TM prints some non blank character 4)the set of codes for TM that never make a left move. 5)an arbitrary TM halts after 100 steps 6)a TM prints a specific letter 7) a turing machine computes the product of two numbers thanku
which of the following is decidable?1)for some input if an arbitrary TM makes 5 moves.2) whether an arbitary TM halts within 5 steps3) whether an arbitary TM prints some ...
517
views
commented
Nov 2, 2018
Theory of Computation
theory-of-computation
+
–
0
answers
11
tst series
498
views
commented
Oct 30, 2018
1
answer
12
Permutation with distinct words
How many distinct words of any (nonzero) length can be formed using the letters of $KEPLER$ at most once each? (Clarification: such a word can have two Es, but can't have duplicates of any other letter.)
How many distinct words of any (nonzero) length can be formed using the letters of $KEPLER$ at most once each?(Clarification: such a word can have two Es, but can't have ...
822
views
commented
Oct 30, 2018
Combinatory
discrete-mathematics
combinatory
+
–
0
answers
13
#ME Test series
464
views
commented
Oct 30, 2018
Programming in C
test-series
+
–
0
answers
14
dfa and nfa
Let M1 be a NFA with “k1” states and the corresponding DFA of M1 have “k2”states. Then which of the following option is necessarily false in every case. 1.k2 = k1 2.k2 ≤2k1 3.k2<k1 4. None of the above
Let M1 be a NFA with “k1” states and the corresponding DFA of M1 have “k2”states. Then which of the following option is necessarily false in every case.1.k2 = k12...
287
views
commented
Oct 13, 2018
Theory of Computation
theory-of-computation
+
–
6
answers
15
GATE CSE 2000 | Question: 5
A multiset is an unordered collection of elements where elements may repeat any number of times. The size of a multiset is the number of elements in it, counting repetitions. What is the number of multisets of size $4$ that can be ... n distinct elements so that at least one element occurs exactly twice? How many multisets can be constructed from n distinct elements?
A multiset is an unordered collection of elements where elements may repeat any number of times. The size of a multiset is the number of elements in it, counting repetiti...
8.0k
views
commented
Oct 10, 2018
Combinatory
gatecse-2000
combinatory
normal
descriptive
+
–
1
answer
16
Ace academy test series question
Suppose that a bus has 16 data lines and requires 4 cycles of 250 nsecs each to transfer data. The bandwidth of this bus would be 2 Megabytes/sec. If the cycle time of the bus was reduced to 125 nsecs and the number of cycles required for transfer ... what would the bandwidth of the bus? A. 1 Megabyte/sec B. 4 Megabytes/sec C. 8 Megabytes/sec D. 2 Megabytes/sec
Suppose that a bus has 16 data lines and requires 4 cycles of 250 nsecs each to transfer data. The bandwidth of this bus would be 2 Megabytes/sec. If the cycle time of th...
5.9k
views
commented
Jan 28, 2018
5
answers
17
GATE CSE 1996 | Question: 1.3
Suppose $X$ and $Y$ are sets and $|X| \text{ and } |Y|$ are their respective cardinality. It is given that there are exactly $97$ functions from $X$ to $Y$. From this one can conclude that $|X| =1, |Y| =97$ $|X| =97, |Y| =1$ $|X| =97, |Y| =97$ None of the above
Suppose $X$ and $Y$ are sets and $|X| \text{ and } |Y|$ are their respective cardinality. It is given that there are exactly $97$ functions from $X$ to $Y$. From this one...
8.7k
views
commented
Jan 27, 2018
Set Theory & Algebra
gate1996
set-theory&algebra
functions
normal
+
–
1
answer
18
MadeEasy Test Series 2018: Probability - Conditional Probability
An article manufactured by a company consists of two independent parts A and B. In the process of manufacture of part A, 9 out of 100 are likely to be defective. Similarly in the process of manufacture of part ... likely to be defective. The probability that the assembled article will be defective is ________. (Upto 3 decimal places)
An article manufactured by a company consists of two independent parts A and B. In the process of manufacture of part A, 9 out of 100 are likely to be defective. Similarl...
872
views
commented
Jan 26, 2018
Probability
probability
conditional-probability
engineering-mathematics
made-easy-test-series
+
–
0
answers
19
Probability
Is my solution right? Kindly help.. thanks
Is my solution right? Kindly help.. thanks
551
views
commented
Jan 26, 2018
Probability
probability
+
–
0
answers
20
Test series
A DMA module is transferring characters to memory using cycle stealing, from a device transmitting at 12800 bits per second.The processor is fetching instructions at the rate of 2MIPS. By how much the processor be slowed down due to DMA activity?
A DMA module is transferring characters to memory using cycle stealing, from a device transmitting at 12800 bits per second.The processor is fetching instructions at the ...
512
views
commented
Jan 20, 2018
0
answers
21
Stack
Isn't this que incomplete because no order is defined in which elements have to be pushed ..
Isn't this que incomplete because no order is defined in which elements have to be pushed ..
229
views
commented
Jan 13, 2018
Programming in C
stack
+
–
0
answers
22
Memory levels
Suppose we have a 3 level memory hierarchy with following specs, level1 - 4 words per block, 4 blocks, the access time of 10ns/word. level2 - 16 words per block, 8 blocks, the access time of 20 ns/word. level3 - 32 words per block, 16 blocks, the access time ... when miss in l2 , it goes to l3, then a word will be read from level1. What is average access time for the above transfer?
Suppose we have a 3 level memory hierarchy with following specs,level1 - 4 words per block, 4 blocks, the access time of 10ns/word.level2 - 16 words per block, 8 blocks, ...
481
views
commented
Jan 10, 2018
CO and Architecture
co-and-architecture
cache-memory
+
–
0
answers
23
[Madeasy] the minimum number of states in DFA for given language
L = (0*1 + 1+ 0) I got minimal DFA with 5 state only, but in their answer, they have mentioned with minimum 6 states.
L = (0*1 + 1+ 0)I got minimal DFA with 5 state only, but in their answer, they have mentioned with minimum 6 states.
605
views
commented
Dec 20, 2017
Theory of Computation
minimal-state-automata
+
–
2
answers
24
ISRO-DEC2017-54
A strictly binary tree with $10$ leaves cannot have more than $19$ nodes has exactly $19$ nodes has exactly $17$ nodes has exactly $20$ nodes
A strictly binary tree with $10$ leavescannot have more than $19$ nodeshas exactly $19$ nodeshas exactly $17$ nodeshas exactly $20$ nodes
1.3k
views
answered
Dec 20, 2017
DS
isrodec2017
+
–
0
answers
25
techtud
Let G is a graph with n vertices and m edges. Consider following statements : i. In DFS traversal, number of tree edges produced is independent of selection of starting vertex. ii. In BFS traversal, number of tree edges produced is independent of selection of starting vertex. iii. ... B) Only statements (ii) and (iii) are correct (C) Statements (ii) and (iv) both are wrong (D) None of these
Let G is a graph with n vertices and m edges. Consider following statements : i. In DFS traversal, number of tree edges produced is independent of selection of starting v...
643
views
commented
Nov 7, 2017
Computer Networks
computer-networks
depth-first-search
breadth-first-search
+
–
3
answers
26
Digital Circuits - Given that the present state of a flip-flop is q and the next state is Q, answer the following.
1.0k
views
answered
Oct 31, 2017
Digital Logic
flip-flop
digital-circuits
digital-logic
+
–
1
answer
27
indexing
778
views
commented
Oct 29, 2017
Databases
indexing
databases
+
–
0
answers
28
Doubt!!
Anyone please tell me How maximum children would be 2B-1 For B=5 it would be maximum of 6 children not 8 children right??
Anyone please tell me How maximum children would be 2B-1For B=5 it would be maximum of 6 children not 8 children right??
122
views
asked
Oct 29, 2017
1
answer
29
Ace test series
if the relation contains candidate key A and B then which of the following is incorrect? (a) A is a primary key (b) B is a candidate key (c){A,B } is a candidate key (d) {A,B } is a super key
if the relation contains candidate key A and B then which of the following is incorrect?(a) A is a primary key(b) B is a candidate key(c){A,B } is a candidate key(d) {A,B...
404
views
commented
Oct 29, 2017
Databases
databases
+
–
2
answers
30
GATE CSE 1999 | Question: 21
Consider a B-tree with degree $m$, that is, the number of children, $c$, of any internal node (except the root) is such that $m \leq c \leq 2m-1$. Derive the maximum and minimum number of records in the leaf nodes for such a B-tree with height $h, h \geq 1. ($Assume that the root of a tree is at height $0).$
Consider a B-tree with degree $m$, that is, the number of children, $c$, of any internal node (except the root) is such that $m \leq c \leq 2m-1$. Derive the maximum and ...
8.0k
views
comment edited
Oct 28, 2017
Databases
gate1999
databases
b-tree
normal
descriptive
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register