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 Na462
0
answers
1
State Diagram of Sequential circuit
1.2k
views
commented
Mar 16, 2019
Digital Logic
digital-logic
sequential-circuit
+
–
0
answers
2
Minimum number of NAND Gates
Minimum number of NAND Gates for the functions F = AC’ + ACE + ACE’ + A’CD’ + A’D’E’ F = (B’ + D’)(A’+C’+D)(A+B’+C’+D)(A’+B+C’+D’)
Minimum number of NAND Gates for the functionsF = AC’ + ACE + ACE’ + A’CD’ + A’D’E’ F = (B’ + D’)(A’+C’+D)(A+B’+C’+D)(A’+B+C’+D’)
3.0k
views
commented
Mar 7, 2019
Digital Logic
digital-logic
nand
+
–
0
answers
3
Discrete random variable
489
views
commented
Feb 20, 2019
Probability
probability
random-variable
engineering-mathematics
+
–
0
answers
4
Central limit theorem
(Central Limit Theorem) Let X1, X2, . . . , X81 be i.i.d., each with expected value µ = E(Xi) = 5, and variance σ2 = Var(Xi) = 4. Approximate P(X1 + X2 +· · · X81 > 369), using the central limit theorem.
(Central Limit Theorem)Let X1, X2, . . . , X81 be i.i.d., each with expected value µ = E(Xi) = 5, and variance σ2 = Var(Xi) = 4.Approximate P(X1 + X2 +· · · X81 369...
696
views
asked
Feb 19, 2019
Probability
probability
+
–
0
answers
5
Probability mass function
Suppose that the cdf of X is given by: F(a) ={ 0 for a < 0 1/5 for 0 ≤ a < 2 2/5 for 2 ≤ a < 4 1 for a ≥ 4. } Determine the pmf of X.
Suppose that the cdf of X is given by:F(a) ={0 for a < 01/5 for 0 ≤ a < 22/5 for 2 ≤ a < 41 for a ≥ 4.}Determine the pmf of X.
479
views
asked
Feb 19, 2019
Probability
engineering-mathematics
random-variable
+
–
1
answer
6
Conditional Probability
A multiple choice exam has 4 choices for each question. A student has studied enough so that the probability they will know the answer to a question is 0.5, the probability that they will be able to eliminate one choice is 0.25, otherwise ... the test to measure what the student knows. If the student answers a question correctly what's the probability they knew the answer?
A multiple choice exam has 4 choices for each question. A student has studied enough so that the probability they will know the answer to a question is 0.5, the probabili...
4.6k
views
commented
Feb 19, 2019
Probability
conditional-probability
probability
+
–
0
answers
7
Probability density function
Let R be the rate at which customers are served in a queue. Suppose that R is exponential with pdf f(r) = 2e^(−2r) on [0, ∞). Find the pdf of the waiting time per customer T = 1/R.
Let R be the rate at which customers are served in a queue. Suppose that R isexponential with pdf f(r) = 2e^(−2r) on [0, ∞).Find the pdf of the waiting time per custo...
604
views
asked
Feb 19, 2019
Probability
engineering-mathematics
probability
+
–
0
answers
8
Expectation
Suppose 100 people all toss a hat into a box and then proceed to randomly pick out a hat. What is the expected number of people to get their own hat back. Hint: express the number of people who get their own hat as a sum of random variables whose expected value is easy to compute.
Suppose 100 people all toss a hat into a box and then proceed to randomly pick out a hat. What is the expected number of people to get their own hat back.Hint: express th...
1.1k
views
commented
Feb 19, 2019
Probability
probabilityexpectation
probability
+
–
9
answers
9
GATE CSE 2019 | Question: 10
Let $G$ be an arbitrary group. Consider the following relations on $G$: $R_1: \forall a , b \in G, \: a R_1 b \text{ if and only if } \exists g \in G \text{ such that } a = g^{-1}bg$ ... $R_1$ and $R_2$ $R_1$ only $R_2$ only Neither $R_1$ nor $R_2$
Let $G$ be an arbitrary group. Consider the following relations on $G$:$R_1: \forall a , b \in G, \: a R_1 b \text{ if and only if } \exists g \in G \text{ such that } a ...
17.4k
views
commented
Feb 8, 2019
Set Theory & Algebra
gatecse-2019
engineering-mathematics
discrete-mathematics
set-theory&algebra
group-theory
1-mark
+
–
3
answers
10
B+ Tree Records
2.1k
views
commented
Feb 2, 2019
Databases
databases
b-tree
bplustrees
+
–
1
answer
11
Ace Subject Test : Computer Networks - Fragmentation
719
views
commented
Feb 2, 2019
Computer Networks
computer-networks
ace-test-series
+
–
1
answer
12
Ace Test Series: Operating System - Fork()
2.3k
views
asked
Feb 2, 2019
Operating System
operating-system
fork-system-call
ace-test-series
+
–
1
answer
13
Ace Test Series: Probability - Uniform Distribution
948
views
asked
Feb 2, 2019
Probability
random-variable
probability
expectation
uniform-distribution
ace-test-series
+
–
1
answer
14
Indexing
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...
5.4k
views
commented
Jan 29, 2019
Databases
indexing
databases
+
–
1
answer
15
Ace Test Series: DBMS - File Indexing
1.9k
views
commented
Jan 28, 2019
Databases
indexing
databases
ace-test-series
+
–
1
answer
16
MadeEasy Test Series: Set Thoery & Algebra - Partial Order
Let Q denote the set of rational numbers and S = {x | x belongs N ; N; x>=10} Consider the Following POSETs I. (Q ∩ [0, 1], ≤) II. (S, ≤) Which of the above POSETs are well ordered?
Let Q denote the set of rational numbers and S = {x | x belongs N ; N; x>=10}Consider the Following POSETsI. (Q ∩ [0, 1], ≤)II. (S, ≤)Which of the above POSETs are ...
1.1k
views
comment edited
Jan 27, 2019
Set Theory & Algebra
set-theory&algebra
partial-order
made-easy-test-series
+
–
2
answers
17
made easy
Consider the following C program: Which of the following represents output of above C program? A)1, 0 B)2, 0 C)1, 1 D)2, 1
Consider the following C program: Which of the following represents output of above C program?A)1, 0B)2, 0C)1, 1D)2, 1
290
views
answered
Jan 26, 2019
1
answer
18
Ace Test Series: Compilers - Parsers
1.4k
views
commented
Jan 26, 2019
Compiler Design
compiler-design
lr-parser
ace-test-series
+
–
1
answer
19
Ace Test Series: Compilers - Parser
392
views
asked
Jan 26, 2019
Compiler Design
compiler-design
lr-parser
ace-test-series
+
–
0
answers
20
Ace Test Series: Compiler - Parser Conflicts
Consider the following CFG. S → aSa|bSb|a|b Number of conflicts in LR(0) State Diagram? 2 8 10 4
Consider the following CFG.S → aSa|bSb|a|bNumber of conflicts in LR(0) State Diagram?28104
1.0k
views
commented
Jan 23, 2019
Compiler Design
compiler-design
lr-parser
ace-test-series
+
–
2
answers
21
Ace Test Series: Operating System - TLB Effective Access Time
1.1k
views
commented
Jan 23, 2019
Operating System
effective-memory-access
operating-system
co-and-architecture
ace-test-series
+
–
0
answers
22
Ace Test Series: CO & Architecture - Cache Misses Type
922
views
commented
Jan 22, 2019
CO and Architecture
cache-memory
co-and-architecture
misses
ace-test-series
+
–
1
answer
23
Ace Test Series: CO & Architecture - Cache Memory
735
views
commented
Jan 21, 2019
CO and Architecture
co-and-architecture
cache-memory
ace-test-series
associative-memory
+
–
0
answers
24
Ace Test Series: DBMS - Functional Dependency
905
views
commented
Jan 21, 2019
Databases
database-normalization
databases
ace-test-series
+
–
1
answer
25
MadeEasy Subject Test 2019: Compiler Design - Syntax Directed Translation
Consider the following Translation rules for the Grammar G : What will be the output for input string abebebe for bottom up parser ? CBBPBPBP CBBBPPBB CBPBPBPB CBPBBPPB
Consider the following Translation rules for the Grammar G :What will be the output for input string abebebe for bottom up parser ?CBBPBPBPCBBBPPBBCBPBPBPBCBPBBPPB
1.3k
views
commented
Jan 21, 2019
Compiler Design
compiler-design
syntax-directed-translation
made-easy-test-series
+
–
1
answer
26
Ace Test Series: Operating System - Deadlock
701
views
commented
Jan 21, 2019
Operating System
operating-system
process-synchronization
deadlock-prevention-avoidance-detection
ace-test-series
+
–
4
answers
27
Ace Test Series: Operating System - Reader Writer Problem
1.9k
views
commented
Jan 21, 2019
Operating System
operating-system
process-synchronization
semaphore
binary-semaphore
ace-test-series
+
–
0
answers
28
Reducible language ( Decidability)
756
views
commented
Jan 21, 2019
Theory of Computation
theory-of-computation
decidability
+
–
3
answers
29
Ace Test Series: CO & Architecture - Instruction Execution
CPU can leave current instruction execution, without completing it for : Service of interrupt DMA Both Neither
CPU can leave current instruction execution, without completing it for :Service of interruptDMABothNeither
695
views
asked
Jan 21, 2019
CO and Architecture
co-and-architecture
dma
ace-test-series
instruction-execution
+
–
0
answers
30
Ace Test Series: Graph Theory - Cut Edges
If G is a connected simple graph with 10 vertices in which degree of every vertex is 2 then number of cut edges in G is ?
If G is a connected simple graph with 10 vertices in which degree of every vertex is 2 then number of cut edges in G is ?
603
views
comment edited
Jan 19, 2019
Graph Theory
graph-theory
ace-test-series
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register