Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
screddy1313
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by screddy1313
1
answer
1
Applied course
Calculate total time to transmit a 1500 KB file over a link.Assume one way delay in either direction is 40ms .Bandwidth is 1Mbps and packet size including header is 1 KB where header length is 40 Bytes ?
Calculate total time to transmit a 1500 KB file over a link.Assume one way delay in either direction is 40ms .Bandwidth is 1Mbpsand packet size including header is 1 KB ...
465
views
commented
Jan 27, 2019
Computer Networks
numerical-answers
computer-networks
transmission-media
+
–
0
answers
2
applied course
How to convert above E-R diagram to Relations? Sorry for adding image instead of typing..
How to convert above E-R diagram to Relations?Sorry for adding image instead of typing..
569
views
asked
Jan 27, 2019
Databases
databases
er-diagram
+
–
1
answer
3
crypt arithmetic
If 356 + 123 = 512 .Then what is the value of 653 + 321? 1.215 2.974 3.1004 4.1304 How to solve these type questions?
If 356 + 123 = 512 .Then what is the value of 653 + 321?1.2152.9743.10044.1304How to solve these type questions?
893
views
asked
Jan 27, 2019
Quantitative Aptitude
numerical
cryptography
+
–
1
answer
4
#tree
formule for 1.number of binary tree 2.number of binary search tree 3.number labeled binary tree 4.number of unlabeled binary tree
formule for1.number of binary tree2.number of binary search tree3.number labeled binary tree4.number of unlabeled binary tree
176
views
answered
Jan 27, 2019
1
answer
5
Operating system concept by Avi Sliberschatz
Consider a process with three threads A, B, and C. The default thread of the process receives multiple requests, and places them in a request queue that is accessible by all the three threads A, B, and ... proposed solution guarantees mutual exclusion but fails to prevent deadlock C.The proposed solution guarantees mutual exclusion and prevents deadlock
Consider a process with three threads A, B, and C. The default thread of the process receives multiple requests, and places them in a request queue that is accessible by ...
356
views
commented
Jan 27, 2019
1
answer
6
c programming ,data types
what is the output???? and how it internally converted to int when we are printing with %d format specifier?? when i run in my ide i got 50 as output and i donn’t know how it came? can anyone explain how 50 came #include <stdio.h> int main() { char a = '12'; printf("%d", a); return 0; }
what is the output???? andhow it internally converted to int when we are printing with %d format specifier??when i run in my ide i got 50 as output and i donn’t know ho...
356
views
answered
Jan 26, 2019
Programming in C
programming
programming-in-c
+
–
0
answers
7
MadeEasy Full Length Test 2019: Digital Logic - Logic Gates
449
views
commented
Jan 26, 2019
Digital Logic
digital-logic
digital-circuits
made-easy-test-series
+
–
2
answers
8
made easy
can anyone explain how dijkstras will behave as BFS whwn a graph is unweighted?
can anyone explain how dijkstras will behave as BFS whwn a graph is unweighted?
673
views
commented
Jan 26, 2019
Algorithms
graph-algorithm
dijkstras-algorithm
programming-in-c
made-easy-test-series
+
–
1
answer
9
made easy
let $l,m,n$ be the 3 regular expressions. consider the following identities. $1.( l^*m^*n^*)^* = (lm^*+mn^*+nl^*)^*$ $2.(mn+m)^*m = m(nm + m)^*$ $3.(l^*m^*n^*)^* = (l^* + m^*n + n^*)^*$ $4.(l^*m)^* = (l+m)^*$ how many of the above identities are correct?
let $l,m,n$ be the 3 regular expressions. consider the following identities.$1.( l^*m^*n^*)^* = (lm^*+mn^*+nl^*)^*$$2.(mn+m)^*m = m(nm + m)^*$$3.(l^*m^*n^*)^* = (l^* + m^...
672
views
commented
Jan 26, 2019
Theory of Computation
theory-of-computation
regular-expression
+
–
1
answer
10
Gate 2014 ec
A fair coin is tossed repeatedly till both head and appear atleast once. The average number of tosses required is?
A fair coin is tossed repeatedly till both head and appear atleast once. The average number of tosses required is?
406
views
commented
Jan 26, 2019
9
answers
11
Common Careless Mistakes
What are the most common mistakes you have made in tests? A good list will help aspirants reduce their mistakes in GATE. Just listing out some common ones. Missing the NOT in question - our eyes have a tendency to focus on important words and ... many calculation mistakes. In any formula you do, you must get the correct unit for the result Please add more as answers.
What are the most common mistakes you have made in tests? A good list will help aspirants reduce their mistakes in GATE. Just listing out some common ones.Missing the “...
4.0k
views
answered
Jan 26, 2019
Revision
mistakes
preparation
+
–
2
answers
12
GATE Overflow | Compiler Design | Test 1 | Parsing | Question: 2
Suppose we have a rightmost derivation which proceeds as follows: $\begin{array}{ccc}S &\rightarrow & Aabw \\ & \rightarrow &ABw \end{array}$ ... $\begin{array}{ccc} B &\rightarrow & ab \end{array}$
Suppose we have a rightmost derivation which proceeds as follows:$\begin{array}{ccc}S &\rightarrow & Aabw \\ & \rightarrow &ABw \end{array}$Which of the following is a po...
835
views
answered
Jan 26, 2019
Compiler Design
go-cd-1
lr-parser
+
–
2
answers
13
GATE Overflow | Compiler Design | Test 1 | Parsing | Question: 1
If we merge states in LR(1) parser to form a LALR(1) parser, we may introduce shift-reduce conflict reduce-reduce conflict no extra conflict both shift-reduce as well as reduce-reduce
If we merge states in LR(1) parser to form a LALR(1) parser, we may introduceshift-reduce conflictreduce-reduce conflictno extra conflictboth shift-reduce as well as redu...
1.7k
views
answered
Jan 26, 2019
Compiler Design
go-cd-1
compiler-design
parsing
+
–
0
answers
14
Counting
421
views
commented
Jan 25, 2019
Graph Theory
discrete-mathematics
graph-theory
engineering-mathematics
chromatic-numbers
counting
+
–
4
answers
15
GATE Overflow | Mock GATE | Test 1 | Question: 34
Let $G$ be a graph of order $n$ in which every vertex has degree equal to $d$. How large must $d$ be in order to guarantee that $G$ is connected? $\frac{n}{2}$ $\lceil (n-1)/2 \rceil$ $\lfloor (n+1)/2 \rfloor$ $(n-1)/2$
Let $G$ be a graph of order $n$ in which every vertex has degree equal to $d$. How large must $d$ be in order to guarantee that $G$ is connected?$\frac{n}{2}$$\lceil (n-1...
2.1k
views
commented
Jan 25, 2019
Graph Theory
go-mockgate-1
discrete-mathematics
graph-theory
graph-connectivity
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register