Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Nils
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Nils
2
answers
1
Generating Function
Find $\left [ x^{50} \right ]$ $\left ( x^{6}+x^{7}+x^{8}+.... \right )^{6}$
Find $\left [ x^{50} \right ]$$\left ( x^{6}+x^{7}+x^{8}+.... \right )^{6}$
453
views
commented
May 18, 2018
Combinatory
generating-functions
+
–
1
answer
2
Question on SWP
Please Explain.
Please Explain.
561
views
commented
Jan 29, 2018
Computer Networks
sliding-window
computer-networks
network
+
–
0
answers
3
Self doubt
182
views
asked
Jan 19, 2018
2
answers
4
True_false
Relation R which satisfy 3NF and atmost one compound candidate key is also in BCNF (pls explain give counter examples for both true and false)
Relation R which satisfy 3NF and atmost one compound candidate key is also in BCNF(pls explain give counter examples for both true and false)
1.9k
views
comment edited
Jan 16, 2018
7
answers
5
Let f(n)= Ω(n), g(n)= O(n) and h(n)= Ѳ(n).
Let $f(n)= Ω(n), g(n)= O(n)$ and $h(n)= Ѳ(n)$. Then $[f(n). g(n)] + h(n)$ is: Ω (n) O (n) Ѳ (n) None of these
Let $f(n)= Ω(n), g(n)= O(n)$ and $h(n)= Ѳ(n)$. Then $[f(n). g(n)] + h(n)$ is:Ω (n)O (n)Ѳ (n)None of these
18.5k
views
commented
Jan 16, 2018
Algorithms
asymptotic-notation
+
–
1
answer
6
Made-easy
A) Ο(logn) B) Ο(n logn) C) Ο(n)2 D) Ο(n2 logn)
A) Ο(logn)B) Ο(n logn)C) Ο(n)2D) Ο(n2 logn)
339
views
asked
Jan 16, 2018
Algorithms
algorithms
time-complexity
made-easy-test-series
+
–
1
answer
7
self-doubt
True and false Wound-Wait algorithm always start with new time stamp after killing. Wait-Die algorithm always start with new time stamp after killing . pls explain both algorithm
True and falseWound-Wait algorithm always start with new time stamp after killing.Wait-Die algorithm always start with new time stamp after killing .pls explain both a...
241
views
edited
Jan 9, 2018
0
answers
8
made_easy
203
views
asked
Jan 8, 2018
0
answers
9
self_doubt
1) language that contain epsilon can convert into CNF ? 2) language that contain epsilon can convert into GNF ?
1) language that contain epsilon can convert into CNF ?2) language that contain epsilon can convert into GNF ?
172
views
edited
Jan 6, 2018
0
answers
10
self doubt
IF any ICMP packet discacted by some router ,is icmp packet generated in response to it ? If ICMP echo request and reply is descarted by some router is icmp packet generated in response to it ?
IF any ICMP packet discacted by some router ,is icmp packet generated in response to it ?If ICMP echo request and reply is descarted by some router is icmp packet genera...
235
views
asked
Jan 2, 2018
1
answer
11
self-doubt
Where is fragmentation is done in ipv4 ?..(at source or router or ob both ) where is segmentation is done in ipv4 ?(at source or router or ob both)
Where is fragmentation is done in ipv4 ?..(at source or router or ob both )where is segmentation is done in ipv4 ?(at source or router or ob both)
196
views
edited
Jan 2, 2018
Computer Networks
computer-networks
+
–
5
answers
12
GATE CSE 2007 | Question: 72
Consider the following program segment. Here $\text{R1, R2}$ and $\text{R3}$ ... is word addressable. After the execution of this program, the content of memory location $2010$ is: $100$ $101$ $102$ $110$
Consider the following program segment. Here $\text{R1, R2}$ and $\text{R3}$ are the general purpose registers.$$\small \begin{array}{|c|l|l||c|} \hline & \text {Instruct...
9.4k
views
commented
Dec 28, 2017
CO and Architecture
gatecse-2007
co-and-architecture
machine-instruction
interrupts
normal
+
–
0
answers
13
self _doubt
246
views
commented
Dec 27, 2017
0
answers
14
self_doubt
Which of the following causes for conflict in LL(1)? A) Left recurtion b) left factoring c) both A & B D) none of the above (pls explain with example)
Which of the following causes for conflict in LL(1)?A) Left recurtion b) left factoring c) both A & BD) none of the above (pls explain with example)
144
views
asked
Dec 25, 2017
0
answers
15
self_doubt
For any two languages A and B, if A ⊆ B, then A is reducible to B. true or false pls explain
For any two languages A and B, if A ⊆ B, then A is reducible to B.true or false pls explain
196
views
asked
Dec 17, 2017
Theory of Computation
theory-of-computation
+
–
0
answers
16
Self_doubt
Is epsilon recursively enumerable ? pls explain.
Is epsilon recursively enumerable ?pls explain.
207
views
commented
Dec 17, 2017
0
answers
17
self_doubt
1) L(M) is recognized by a TM having even number of states. 2) L(M) is infinite. whether this language are follow non-trivial property ? Whether this languages are decidable ?.
1) L(M) is recognized by a TM having even number of states.2) L(M) is infinite.whether this language are follow non-trivial property ?Whether this languages are decidable...
556
views
edited
Dec 15, 2017
Theory of Computation
turing-machine
theory-of-computation
+
–
1
answer
18
Made_easy
227
views
commented
Dec 7, 2017
0
answers
19
madeeasy
133
views
asked
Dec 4, 2017
0
answers
20
self-Doudt
can null graph can be biparted graph ?
can null graph can be biparted graph ?
207
views
asked
Nov 30, 2017
0
answers
21
relational algebra
309
views
commented
Nov 14, 2017
2
answers
22
b+tree
557
views
asked
Nov 14, 2017
2
answers
23
B+ tree
pls explain
pls explain
580
views
commented
Nov 14, 2017
Databases
databases
bplustrees
indexing
+
–
2
answers
24
ER model
421
views
commented
Nov 14, 2017
Databases
er-diagram
databases
+
–
3
answers
25
Ace _testseries
I have doubt in 3rd statement second part
I have doubt in 3rd statement second part
389
views
comment edited
Nov 13, 2017
0
answers
26
ACE_test
159
views
commented
Nov 13, 2017
1
answer
27
self_doubt
Find out canonical cover and minimal cover of following FDs: { A ---->C AC ----->D E-----> AD E ----->H }
Find out canonical cover and minimal cover of following FDs:{ A >CAC ->DE - ADE ->H }
701
views
commented
Nov 13, 2017
1
answer
28
madeeasy
how deadlock and starvation possible?
how deadlock and starvation possible?
305
views
asked
Nov 4, 2017
1
answer
29
self doudt
#include<stdio.h> void foo(int*); int main() { int x=30,*a=&x; foo(a++); } void foo(int* a) { printf("%d\n",*a); } this program gives output=30; _____ #include<stdio.h> void foo(int*); int main() { int x=30; foo((&x)++); } void foo(int* a) { printf("%d\n",*a); } But this is giving compiler error Why?
#include<stdio.h>void foo(int*);int main(){ int x=30,*a=&x; foo(a++);}void foo(int* a){ printf("%d\n",*a);} this program gives output=30;_____#include<stdio.h>vo...
200
views
asked
Oct 28, 2017
8
answers
30
GATE CSE 2015 Set 1 | Question: 39
Consider the operations $\textit{f (X, Y, Z) = X'YZ + XY' + Y'Z'}$ and $\textit{g (X, Y, Z) = X'YZ + X'YZ' + XY}$ Which one of the following is correct? Both $\left\{\textit{f} \right\}$ and ... $\left\{ \textit{f}\right\}$ nor $\left\{\textit{g}\right\}$ is functionally complete
Consider the operations$\textit{f (X, Y, Z) = X'YZ + XY' + Y'Z'}$ and $\textit{g (X, Y, Z) = X'YZ + X'YZ' + XY}$Which one of the following is correct?Both $\left\{\textit...
26.9k
views
comment edited
Oct 25, 2017
Digital Logic
gatecse-2015-set1
boolean-algebra
difficult
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register