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
Answers by manisha11
1
votes
1
Doubt [Graph Theory]
Is it possible that a disconnected graph be an Euler graph ?
Is it possible that a disconnected graph be an Euler graph ?
2.0k
views
answered
Sep 17, 2020
Graph Theory
graph-theory
euler-graph
+
–
2
votes
2
Gate19
914
views
answered
Feb 4, 2019
Databases
solution
+
–
6
votes
3
GATE CSE 2019 | Question: 29
Suppose that in an IP-over-Ethernet network, a machine X wishes to find the MAC address of another machine Y in its subnet. Which one of the following techniques can be used for this? X sends an ARP request packet to the local gateway' ... packet with broadcast MAC address in its local subnet X sends an ARP request packet with broadcast IP address in its local subnet
Suppose that in an IP-over-Ethernet network, a machine X wishes to find the MAC address of another machine Y in its subnet. Which one of the following techniques can be ...
19.5k
views
answered
Feb 4, 2019
Computer Networks
gatecse-2019
computer-networks
network-protocols
2-marks
+
–
2
votes
4
nielit scientists b
how many Dfa's exists with two states over input alphabet {0,1}? a) 16 b) 26 c) 32 d) 64
how many Dfa's exists with two states over input alphabet {0,1}? a) 16b) 26c) 32d) 64
661
views
answered
Nov 23, 2018
Theory of Computation
theory-of-computation
finite-automata
+
–
1
votes
5
recursion
#include<stdio.h> void print(int n) { if (n > 4000) return; printf("%d ", n); print(2*n); printf("%d ", n); } int main() { print(10); getchar(); return 0; } PLEASE EXPLAIN THE OUTPUT
#include<stdio.h void print(int n) { if (n 4000) return; printf("%d ", n); print(2*n); printf("%d ", n); } int main() { print(10); getcha...
1.4k
views
answered
Oct 2, 2018
1
votes
6
Regular language
How to check whether the language is regular or not ? { wxw | w,x belongs to (a+b)raise to +}
How to check whether the language is regular or not ? { wxw | w,x belongs to (a+b)raise to +}
747
views
answered
Sep 27, 2018
3
votes
7
GATE APTITUDE
Options are A) 1:3^(1/3) B) 3^(1/3):1 C) 3:1 D) 3^(2/3):1
Options areA) 1:3^(1/3) B) 3^(1/3):1 C) 3:1 D) 3^(2/3):1
405
views
answered
Sep 15, 2018
Verbal Aptitude
quantitative-aptitude
+
–
0
votes
8
FIRST Set
S->Aa A->BD B->b | ɛ D->d | ɛ what is FIRST(S)?
S->AaA->BDB->b | ɛD->d | ɛwhat is FIRST(S)?
486
views
answered
Sep 14, 2018
Compiler Design
compiler-design
grammar
parsing
first-and-follow
+
–
1
votes
9
Finite Automata
After minimzing, only 4 states left then why 6 ?
After minimzing, only 4 states left then why 6 ?
493
views
answered
Sep 14, 2018
1
votes
10
ISI2016-MMA-4
The $a, b, c$ and $d$ ... $(a+d)(b+c)$ equals $-4$ $0$ $16$ $-16$
The $a, b, c$ and $d$ satisfy the equations$$\begin{matrix} a & + & 7b & + & 3c & + & 5d & = &16 \\ 8a & + & 4b & + & 6c & + & 2d & = &-16 \\ 2a & + & 6b & + & 4c & + & 8...
434
views
answered
Sep 13, 2018
Linear Algebra
isi2016-mmamma
linear-algebra
matrix
system-of-equations
+
–
4
votes
11
Analysis of the algorithms
T(n) = 3T( n/3 ) + n/2 The answer to the above question says that case 2 of masters theorem is applied here. How is it so?
T(n) = 3T( n/3 ) + n/2The answer to the above question says that case 2 of masters theorem is applied here. How is it so?
315
views
answered
Sep 11, 2018
Algorithms
algorithms
recurrence-relation
master-theorem
+
–
2
votes
12
Arrangement problem
The number of distinct bracelets of five beads made up of red, blue, and green beads (two bracelets are indistinguishable if the rotation of one yield another) is, a. 243 b. 81 c. 51 d. 47
The number of distinct bracelets of five beads made up of red, blue, and green beads (two bracelets are indistinguishable if the rotation of one yield another) is,a. 243b...
495
views
answered
Sep 6, 2018
0
votes
13
nptel assignment
1.1k
views
answered
Sep 2, 2018
Databases
sql
+
–
0
votes
14
nptel assignment sql
760
views
answered
Sep 2, 2018
3
votes
15
MadeEasy Test Series: Programming & DS - Stack
My doubt : What should we consider ^ operator as Bitwise XOR ? or Exponentiation
My doubt : What should we consider ^ operator as Bitwise XOR ? or Exponentiation
1.3k
views
answered
Aug 22, 2018
DS
made-easy-test-series
data-structures
stack
infix-prefix
+
–
3
votes
16
Calculating array address
Consider array A[1..100,1..100],in which elements are stored in Z representation. An example of 5x5 such array is shown below: Base address of array = 1000,size of each element is 1 Byte,and stored in row major, then address of A[100][50] ?
Consider array A[1..100,1..100],in which elements are stored in Z representation. An example of 5x5 such array is shown below: Base address of array = 1000,size of each e...
2.9k
views
answered
Aug 22, 2018
DS
data-structures
array
+
–
2
votes
17
TOC Self doubt
Consider the following language L = {w ∈ (a+b)* | w has atleast as many occurrences of (bba)’s as (abb)’s}. Which of the following statements is/are true? S1: Language L is regular. S2: Complement of L is CFL. S3: Complement of L is CSL. S4: Reversal of L is CFL. (a) Only S1 (b) Only S2 and S4 (c) Only S1 and S3 (d) All of these which is the answer and why..???
Consider the following language L = {w ∈ (a+b)* | w has atleast as many occurrences of (bba)’s as (abb)’s}. Which of the following statements is/are true? S1: Langu...
182
views
answered
Aug 22, 2018
0
votes
18
random...
596
views
answered
Aug 21, 2018
Operating System
process-scheduling
+
–
2
votes
19
random...
596
views
answered
Aug 21, 2018
Operating System
process-scheduling
+
–
3
votes
20
RE Ques
Describe in simple English the language represented by the regular expression r=(1+10)*
Describe in simple English the language represented by the regular expression r=(1+10)*
2.2k
views
answered
Aug 16, 2018
Theory of Computation
regular-expression
theory-of-computation
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register