Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Aboveallplayer
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Aboveallplayer
0
votes
31
GATE CSE 2017 Set 1 | Question: 08
Consider the C code fragment given below. typedef struct node { int data; node* next; } node; void join(node* m, node* n) { node* p = n; while(p->next != NULL) { p = p->next; } p->next = m; } Assuming that m and n ... append list m to the end of list n. cause a null pointer dereference for all inputs. append list n to the end of list m for all inputs.
Consider the C code fragment given below.typedef struct node { int data; node* next; } node; void join(node* m, node* n) { node* p = n; while(p->next != NULL) { p = p->ne...
25.4k
views
answered
Feb 14, 2017
DS
gatecse-2017-set1
data-structures
linked-list
normal
+
–
7
votes
32
GATE CSE 2017 Set 2 | Question: 04
Let $L_1, L_2$ be any two context-free languages and $R$ be any regular language. Then which of the following is/are CORRECT? $L_1 \cup L_2$ is context-free $\overline{L_1}$ is context-free $L_1 - R$ is context-free $L_1 \cap L_2$ is context-free I, II and IV only I and III only II and IV only I only
Let $L_1, L_2$ be any two context-free languages and $R$ be any regular language. Then which of the following is/are CORRECT?$L_1 \cup L_2$ is context-free$\overline{L_1}...
11.6k
views
answered
Feb 14, 2017
Theory of Computation
gatecse-2017-set2
theory-of-computation
closure-property
+
–
0
votes
33
GATE CSE 2017 Set 1 | Question: 47
The number of integers between $1$ and $500$ (both inclusive) that are divisible by $3$ or $5$ or $7$ is ____________ .
The number of integers between $1$ and $500$ (both inclusive) that are divisible by $3$ or $5$ or $7$ is ____________ .
11.5k
views
answered
Feb 12, 2017
Set Theory & Algebra
gatecse-2017-set1
set-theory&algebra
normal
numerical-answers
set-theory
+
–
0
votes
34
ACE-MOCK-compiler
Associativity and precedence of operators is defined by grammar. So C should be right. Please help
Associativity and precedence of operators is defined by grammar. So C should be right.Please help
996
views
answered
Feb 9, 2017
Compiler Design
compiler-design
syntax-directed-translation
ace-test-series
+
–
2
votes
35
Ace Test Series: Computer Networks - Sliding Window
Pls verify that Ans. would be 45 or 46 ?
Pls verify that Ans. would be 45 or 46 ?
947
views
answered
Feb 9, 2017
Computer Networks
ace-test-series
computer-networks
sliding-window
+
–
0
votes
36
Made easy mock
Can a layer-3 firewall stop incoming packet from a specific host...???
Can a layer-3 firewall stop incoming packet from a specific host...???
670
views
answered
Feb 7, 2017
1
votes
37
gatebook mock 2
Sender window size is 2^6 . So reciever window should be the same. i. e. 2^6. Sequence no = (sender window + rexiever window) =2^7 i.e. 7 bit
Sender window size is 2^6 . So reciever window should be the same. i. e. 2^6. Sequence no = (sender window + rexiever window) =2^7 i.e. 7 bit
516
views
answered
Feb 7, 2017
2
votes
38
Memory management
(a) P3, Ps, P3, P2 (b)P2, P5, P3, 426k waits (c)P3, Ps, P2, 426k waits (d)P4, P2, P5, P3
(a) P3, Ps, P3, P2 (b)P2, P5, P3, 426k waits (c)P3, Ps, P2, 426k waits (d)P4, P2, P5, P3
631
views
answered
Feb 4, 2017
Operating System
memory-management
+
–
3
votes
39
UGC NET CSE | January 2017 | Part 2 | Question: 19
Consider a schema $R(MNPQ)$ and functional dependencies $M\rightarrow N, P\rightarrow Q$. Then the decomposition of $R$ into $R_{1} \left (MN \right )$ and $R_{2} \left (PQ \right )$ ... but not lossless join Dependency preserving and lossless join Lossless join but not dependency preserving Neither dependency preserving nor lossless join.
Consider a schema $R(MNPQ)$ and functional dependencies $M\rightarrow N, P\rightarrow Q$. Then the decomposition of $R$ into $R_{1} \left (MN \right )$ and $R_{2} \left...
2.2k
views
answered
Feb 4, 2017
Databases
ugcnetjan2017ii
databases
dependency-preserving
+
–
1
votes
40
UGC NET CSE | January 2017 | Part 2 | Question: 5
Consider a Hamiltonian Graph $G$ with no loops or parallel edges and with $\left | V\left ( G \right ) \right |= n\geq 3$. The which of the following is true? $\text{deg}\left ( v \right )\geq \frac{n}{2}$ for each vertex $v\\$ ... $v$ and $w$ are not connected by an edge All of the above
Consider a Hamiltonian Graph $G$ with no loops or parallel edges and with $\left | V\left ( G \right ) \right |= n\geq 3$. The which of the following is true?$\text{deg}\...
2.0k
views
answered
Feb 4, 2017
Graph Theory
ugcnetjan2017ii
graph-theory
graph-coloring
+
–
1
votes
41
CPU Utilization
What are the factors to improve CPU Utilization? List Them.
What are the factors to improve CPU Utilization? List Them.
442
views
answered
Feb 4, 2017
0
votes
42
Gatebook
Consider languages L1 and L2 over {0,1) alphabet. L2= {w/w contains some x as a substring and x belongs to L1} Which of the following must be true? I. If L1 is regular, L2 is also regular II. If L1 is CFL, L2 is also CFL III. If L1 is recursive, L2 is also recursive (A). I and II only (B). I, II, III only (C). I and III only (D). II and III only
Consider languages L1 and L2 over {0,1) alphabet.L2= {w/w contains some x as a substring and x belongs to L1}Which of the following must be true?I. If L1 is regular, L2 i...
1.8k
views
answered
Feb 3, 2017
Theory of Computation
gatebook-toc
theory-of-computation
regular-language
+
–
1
votes
43
MADE EASY TEST SERIES
Consider languages L1 and L2 over alphabet Σ = {a, b}. L1 is known to be a context-free language. L2 = {w|w is prefix of w' ∈ L1} Which of the following is true ? A> L2 need not be CFL B> L2 will be regular C> L2 will be CFL D> None of the above
Consider languages L1 and L2 over alphabet Σ = {a, b}. L1 is known to be a context-free language. L2 = {w|w is prefix of w' ∈ L1}Which of the following is true ?A L2 ...
659
views
answered
Feb 3, 2017
2
votes
44
Compexity of sum of complexity bounds
252
views
answered
Feb 2, 2017
Algorithms
algorithms
time-complexity
test-series
+
–
0
votes
45
Permutation and combinations
I am confused with Following formulaes of combination.. 1. n!/r! 2. n+k-1 C k 3. (P+1)*2^R where (P+R are total things and P are alike). 4. question such as number of ways of choosing 10 balls out of 15 balls in which 5 are red,8 are green,2 are black. Anybody please provide me some reference to understand these formulaes related to combination.
I am confused with Following formulaes of combination..1. n!/r!2. n+k-1 C k3. (P+1)*2^R where (P+R are total things and P are alike).4. question such as number of ways of...
344
views
answered
Jan 31, 2017
Combinatory
combinatory
+
–
0
votes
46
Virtual Gate Test Series: Digital Logic - Number Representation
How many minimum bits are required to represent $-16$ in $2's$ complement form
How many minimum bits are required to represent $-16$ in $2's$ complement form
403
views
answered
Jan 31, 2017
Digital Logic
digital-logic
number-representation
virtual-gate-test-series
+
–
1
votes
47
UGC NET CSE | January 2017 | Part 3 | Question: 49
A memory management system has 64 pages with 512 bytes page size. Physical memory consists of 32 page frames. Number of bits required in logical and physical address are respectively: 14 and 15 14 and 29 15 and 14 16 and 32
A memory management system has 64 pages with 512 bytes page size. Physical memory consists of 32 page frames. Number of bits required in logical and physical address are ...
7.6k
views
answered
Jan 31, 2017
Operating System
ugcnetcse-jan2017-paper3
operating-system
memory-management
+
–
0
votes
48
UGC NET CSE | January 2017 | Part 3 | Question: 22
Let $G= (V,T,S,P)$ be a context-free grammer such that every one of its productions is of the form $A\rightarrow v$, with $\mid v \mid=K> 1$. The derivation tree for any $W \in L(G)$ has a height $h$ ... $\log_{K}|W \mid \leq h \leq \left (\frac{ \mid W \mid - 1}{K-1} \right)$
Let $G= (V,T,S,P)$ be a context-free grammer such that every one of its productions is of the form $A\rightarrow v$, with $\mid v \mid=K 1$. The derivation tree for any ...
1.3k
views
answered
Jan 31, 2017
Theory of Computation
ugcnetcse-jan2017-paper3
context-free-grammar
theory-of-computation
+
–
1
votes
49
UGC NET CSE | January 2017 | Part 3 | Question: 10
For database relation $R(A,B,C,D)$ where the domains of $A,B,C$ and $D$ include only atomic values, only the following functional dependencies and those that can be inferred from them are: $A \rightarrow C$ $B \rightarrow D$ ... normal form Second normal form but not in third normal form. Both in second normal form as well as in third normal form.
For database relation $R(A,B,C,D)$ where the domains of $A,B,C$ and $D$ include only atomic values, only the following functional dependencies and those that can be infer...
982
views
answered
Jan 31, 2017
Databases
ugcnetcse-jan2017-paper3
databases
database-normalization
+
–
0
votes
50
UGC NET CSE | January 2017 | Part 3 | Question: 7
Consider following schedules involving two transactions: $S_{1}: \: r_{1}(X);r_{1}(Y);r_{2}(X);r_{2}(Y);w_{2}(Y);w_{1}(X)$ ... serializable and $S_2$ is not conflict serializable $S_1$ is not conflict serializable and $S_2$ is conflict serializable Both $S_1$ and $S_2$ are not conflict serializable
Consider following schedules involving two transactions:$S_{1}: \: r_{1}(X);r_{1}(Y);r_{2}(X);r_{2}(Y);w_{2}(Y);w_{1}(X)$$S_{2}: \: r_{1}(X);r_{2}(X);r_{2}(Y);w_{2}(Y);r_...
3.8k
views
answered
Jan 31, 2017
Databases
ugcnetcse-jan2017-paper3
databases
transaction-and-concurrency
+
–
2
votes
51
UGC NET CSE | January 2017 | Part 3 | Question: 4
Match the following : ... $\text{a-iv, b-ii, c-i, d-iii}$ $\text{a-iv, b-iii, c-ii, d-i}$
Match the following :$\begin{array}{clcl} & {\textbf{Addressing Mode}} & {} & {\textbf{Location of operand}} \\ \text{a.} & \text{Implied} & \text{i.} & \text{Registe...
1.6k
views
answered
Jan 31, 2017
CO and Architecture
ugcnetcse-jan2017-paper3
co-and-architecture
addressing-modes
match-the-following
+
–
1
votes
52
UGC NET CSE | January 2017 | Part 3 | Question: 2
Which of the following is incorrect for virtual memory? Large programs can be written More I/O is required More addressable memory available Faster and easy swapping of process
Which of the following is incorrect for virtual memory?Large programs can be writtenMore I/O is requiredMore addressable memory availableFaster and easy swapping of proce...
1.7k
views
answered
Jan 31, 2017
Operating System
ugcnetcse-jan2017-paper3
operating-system
virtual-memory
+
–
0
votes
53
UGC NET CSE | January 2017 | Part 3 | Question: 21
Given the following statements: A class of languages that is closed under union and complementation has to be closed under intersection A class of languages that is closed under union and intersection has to be closed under complementation Which of the following options is ... and (ii) are true (i) is true, (ii) is false (i) is false, (ii) is true
Given the following statements:A class of languages that is closed under union and complementation has to be closed under intersectionA class of languages that is closed ...
2.6k
views
answered
Jan 31, 2017
Theory of Computation
ugcnetcse-jan2017-paper3
theory-of-computation
regular-language
+
–
1
votes
54
UGC NET CSE | January 2017 | Part 3 | Question: 23
Given the following two languages: $L_1 = \{a^n b^n \mid n \geq 0, \: n \neq 100\}$ $L_2 = \{ w \in \{a, b, c\}^* \mid n_a(w) = n_b (w) = n_c(w) \}$ Which of the following options is correct ... context free language $L_1$ is context free language, $L_2$ is not context free language $L_1$ is not context free language, $L_2$ is context free language
Given the following two languages:$L_1 = \{a^n b^n \mid n \geq 0, \: n \neq 100\}$$L_2 = \{ w \in \{a, b, c\}^* \mid n_a(w) = n_b (w) = n_c(w) \}$Which of the following o...
4.1k
views
answered
Jan 31, 2017
Theory of Computation
ugcnetcse-jan2017-paper3
theory-of-computation
context-free-language
+
–
3
votes
55
UGC NET CSE | January 2017 | Part 3 | Question: 25
Suppose there are N stations in a slotted LAN. Each station attempts to transmit with a probability P in each time slot. The probability that only one station transmits in a given slot is____ $nP(1-P)^{n-1}$ $nP$ $P(1-P)^{n-1}$ $n^P (1-P)^{n-1}$
Suppose there are N stations in a slotted LAN. Each station attempts to transmit with a probability P in each time slot. The probability that only one station transmits i...
1.9k
views
answered
Jan 31, 2017
Computer Networks
ugcnetcse-jan2017-paper3
computer-networks
lan-technologies
+
–
1
votes
56
UGC NET CSE | January 2017 | Part 3 | Question: 29
In RSA public key cryptosystem suppose $n=p*q$ where $p$ and $q$ are primes. $(e,n)$ and $(d,n)$ are public and private keys respectively. Let $M$ be an integer such that $o< M< n$ and $\phi(n)=(p-1)(q-1)$. Which of the following equations ... I and II I and III II and III I and IV
In RSA public key cryptosystem suppose $n=p*q$ where $p$ and $q$ are primes. $(e,n)$ and $(d,n)$ are public and private keys respectively. Let $M$ be an integer such that...
1.1k
views
answered
Jan 31, 2017
Computer Networks
ugcnetcse-jan2017-paper3
computer-networks
rsa-security-networks
+
–
5
votes
57
UGC NET CSE | January 2017 | Part 3 | Question: 38
Given the array of integers ‘array’ shown below: 13 7 27 2 18 33 9 11 22 8 What is the output of the following JAVA statements? int[] p = new int [10]; int[] q = new int [10]; for (int k=0; k< 10; k++) p[k]=array [k]; q=p; p[4]=20; System.out.println(array[4]+":"+q[4]); 20:20 18:18 18:20 20:18
Given the array of integers ‘array’ shown below:1372721833911228What is the output of the following JAVA statements?int[] p = new int [10]; int[] q = new int [10]; fo...
2.8k
views
answered
Jan 31, 2017
Object Oriented Programming
ugcnetcse-jan2017-paper3
object-oriented-programming
java
+
–
2
votes
58
UGC NET CSE | January 2017 | Part 3 | Question: 28
In a packet switching network, if the message size is 48 bytes and each packet contains a header of 3 bytes. If 24 packets are required to transmit the message, the packet size is 2 bytes 1 byte 4 bytes 5 bytes
In a packet switching network, if the message size is 48 bytes and each packet contains a header of 3 bytes. If 24 packets are required to transmit the message, the packe...
4.7k
views
answered
Jan 31, 2017
Computer Networks
ugcnetcse-jan2017-paper3
computer-networks
network-switching
+
–
1
votes
59
Basic Doubt Chomsky Hierarchy
I know that if L1 is regular and L2 is CFL then L1 intersection L2 is always CFL. But if we go according to hierarchy then if L1 is regular then it should be CFL so L1 intersection L2 is CFL intersection CFL and is not necessarily CFL as CFL's are not closed under intersection. My question is why is there a contradiction when I use this approach?
I know that if L1 is regular and L2 is CFL then L1 intersection L2 is always CFL. But if we go according to hierarchy then if L1 is regular then it should be CFL so L1 in...
421
views
answered
Jan 30, 2017
Theory of Computation
theory-of-computation
context-free-language
+
–
7
votes
60
Test by Bikram | Mock GATE | Test 2 | Question: 11
A certain architecture supports indirect, direct, and register addressing modes for use in identifying operands for arithmetic instructions. Which of the following cannot be achieved with a single instruction? Specifying a register number in the ... memory location which in turn contains the value of an operand that will be used by the instruction.
A certain architecture supports indirect, direct, and register addressing modes for use in identifying operands for arithmetic instructions.Which of the following cannot ...
556
views
answered
Jan 30, 2017
GATE
tbb-mockgate-2
co-and-architecture
addressing-modes
+
–
Page:
« prev
1
2
3
4
5
6
7
8
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register