Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Raghava45
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Raghava45
0
votes
1
UGC NET CSE | June 2019 | Part 2 | Question: 5
For which values of $m$ and $n$ does the complete bipartite graph $k_{m,n}$ have a Hamiltonian circuit ? $m\neq n,\ \ m,n \geq 2$ $m\neq n,\ \ m,n \geq 3$ $m=n,\ \ m,n \geq 2$ $m= n,\ \ m,n \geq 3$
For which values of $m$ and $n$ does the complete bipartite graph $k_{m,n}$ have a Hamiltonian circuit ?$m\neq n,\ \ m,n \geq 2$$m\neq n,\ \ m,n \geq 3$$m=n,\ \ m,n \geq ...
2.1k
views
answered
Sep 17, 2019
Graph Theory
ugcnetcse-june2019-paper2
graph-theory
+
–
0
votes
2
#ACE_ACADEMY_DISCRETE_MATHS_BOOKLET.
Which of the following is not true? (a) Number of edge-disjoint Hamiltonian cycles in $K_7$ is $3$ (b) If $G$ is a simple graph with $6$ vertices and the degree of each vertex is at least $3$, then the Hamiltonian cycle exists in ... simple graph with $5$ vertices and $7$ edges, then the Hamiltonian cycle exists in $G$ Please help me understand all the options.
Which of the following is not true?(a) Number of edge-disjoint Hamiltonian cycles in $K_7$ is $3$(b) If $G$ is a simple graph with $6$ vertices and the degree of each ver...
2.6k
views
answered
Aug 1, 2019
Graph Theory
discrete-mathematics
graph-theory
ace-booklet
+
–
0
votes
3
Recurrence Relation Self-Doubt
What will be solution of recurrence relation if roots are like this: r1=-2, r2=2, r3=-2, r4=2 is this the case of repetitive roots?
What will be solution of recurrence relation if roots are like this: r1=-2, r2=2, r3=-2, r4=2is this the case of repetitive roots?
821
views
answered
May 14, 2019
Combinatory
relations
recurrence-relation
discrete-mathematics
combinational-circuit
+
–
0
votes
4
Recurrence Relation
Let $T(n) = T(n-1) + \frac{1}{n} , T(1) = 1 ;$ then $T(n) = ? $ $O(n^{2})$ $O(logn)$ $O(nlogn)$ $O(n^{2}logn)$
Let $T(n) = T(n-1) + \frac{1}{n} , T(1) = 1 ;$ then $T(n) = ? $$O(n^{2})$$O(logn)$$O(nlogn)$$O(n^{2}logn)$
1.4k
views
answered
May 14, 2019
Combinatory
discrete-mathematics
recurrence-relation
relations
+
–
0
votes
5
GATE2018 CE-1: GA-10
Each of the letters arranged as below represents a unique integer from $1$ to $9.$ The letters are positioned in the figure such that $(A \times B \times C), (B \times G \times E)$ and $(D \times E \times F)$ are equal. Which integer among the following choices cannot be represented by the letters $A, B, C, D, E, F \ or \ G?$ A D B G E C F $4$ $5$ $6$ $9$
Each of the letters arranged as below represents a unique integer from $1$ to $9.$ The letters are positioned in the figure such that $(A \times B \times C), (B \times G ...
2.5k
views
answered
Dec 12, 2018
Analytical Aptitude
gate2018-ce-1
general-aptitude
analytical-aptitude
logical-reasoning
+
–
3
votes
6
I/O-COA
I think percentage of processor time consumed should be $\frac{ \,ISR\,time}{ISR\,time+\,Data\,Transfer\,Time}=\frac{100}{100+122}$. Is it correct?
I think percentage of processor time consumed should be $\frac{ \,ISR\,time}{ISR\,time+\,Data\,Transfer\,Time}=\frac{100}{100+122}$.Is it correct?
1.2k
views
answered
Oct 30, 2018
CO and Architecture
co-and-architecture
interrupts
io-handling
numerical-answers
+
–
0
votes
7
view-serializablity
Draw the polygraph and explain whether it is view-serializable or not?
Draw the polygraph and explain whether it is view-serializable or not?
570
views
answered
Oct 10, 2018
Databases
view-serializable
databases
serializability
+
–
0
votes
8
Schedules
$1)$ Find the number of all possible conflict-equivalent and view-equivalent schedules to the following serial schedules. (a) r1(A), w1(B), r2(A), w2(B), r3(A), w3(B).
$1)$ Find the number of all possible conflict-equivalent and view-equivalent schedules to the following serial schedules. (a) r1(A), w1(B), r2(A), w2(B), r3(A), w3(B)....
4.9k
views
answered
Oct 10, 2018
Databases
transaction-and-concurrency
conflict-serializable
view-serializable
+
–
0
votes
9
Homework
T(n)=0.5T(n/2)+n^3 How to solve this using recurrence method?
T(n)=0.5T(n/2)+n^3How to solve this using recurrence method?
2.8k
views
answered
Oct 6, 2018
Algorithms
recurrence-relation
+
–
0
votes
10
Algorithms
Solve this T(n) = 0.5T(n/2)+1 ; T(1)=1
Solve thisT(n) = 0.5T(n/2)+1 ; T(1)=1
3.2k
views
answered
Oct 6, 2018
Algorithms
algorithms
time-complexity
asymptotic-notation
+
–
1
votes
11
No of states in Minimal DFA
Ques:- Let ∑= {0, 1} What will be the number of states in minimal DFA, if the Binary number string is congruent to (mod 8)? *[ Can anybody explain this as I am getting 8 states for this since remainders will be 8 (0,1,2,3,4,5,6,7). But the answer is 4].
Ques:- Let ∑= {0, 1} What will be the number of states in minimal DFA, if the Binary number string is congruent to (mod 8)?*[ Can anybody explain this as I am getting ...
3.1k
views
answered
Oct 5, 2018
Theory of Computation
theory-of-computation
minimal-state-automata
finite-automata
number-of-states
+
–
0
votes
12
Is dead state included in Minimum DFA
Here minimum no. of states 4 or 5(including dead state)
Here minimum no. of states 4 or 5(including dead state)
4.1k
views
answered
Oct 5, 2018
Theory of Computation
theory-of-computation
+
–
0
votes
13
Self doubt
Say L1 and L2 are cfl , is L1 Ex-or L2 is cfl or not?
Say L1 and L2 are cfl , is L1 Ex-or L2 is cfl or not?
263
views
answered
Oct 5, 2018
Theory of Computation
theory-of-computation
+
–
0
votes
14
Self doubt
Explain the output Main() { char *s= "%d\n"; s++; s++; printf(s-2,300); }
Explain the outputMain(){ char *s= "%d\n"; s++; s++; printf(s-2,300);}
215
views
answered
Oct 5, 2018
0
votes
15
Printf("j=%d,&,j=%x",j&j)
945
views
answered
Sep 23, 2018
Compiler Design
compiler-design
lexical-analysis
compiler-tokenization
+
–
0
votes
16
Previous Year Gate Question Doubt
From CLRS the complexity of radix sort is theta(d(n+k)) where d is # of digits , k is range and n is numbers . So how option C is right . Plz solve it on the basis of mine given complexity .
From CLRS the complexity of radix sort is theta(d(n+k)) where d is # of digits , k is range and n is numbers . So how option C is right . Plz solve it on the basis of min...
301
views
answered
Sep 23, 2018
Algorithms
algorithms
radix-sort
time-complexity
+
–
0
votes
17
Previous year gate question doubt :
Let X be the number of distinct 16-bit integers in 2′s complement representation. Let Y be the number of distinct 16-bit integers in sign magnitude representation Then X−Y is______. Here if we take 2 as number then its 2's complement and sign mangitude both will same lead to 0 answer but here it is 1 ..how? Note : : Before Closing thiz ques Give answer
Let X be the number of distinct 16-bit integers in 2′s complement representation. Let Y be the number of distinct 16-bit integers in sign magnitude representation Then ...
473
views
answered
Sep 23, 2018
0
votes
18
Hashing : Quadratic Probing
Keys $9,19,29,39,49,59,69$ are inserted into a hash Table of size $10$ $(0-9)$ using the hash function $H = k mod 10$ and Quadratic Probing is used for collision resolution. What is the index into which 59 will be inserted ? $a). 3$ $b). 6$ $c). 8$ $d). 5$
Keys $9,19,29,39,49,59,69$ are inserted into a hash Table of size $10$ $(0-9)$ using the hash function $H = k mod 10$ and Quadratic Probing is used for collision resoluti...
5.5k
views
answered
Sep 23, 2018
DS
hashing
data-structures
+
–
0
votes
19
true data dependency
1.5k
views
answered
Sep 23, 2018
0
votes
20
Data dependancies
Anti- dependency will not ALWAYS create stall because we can use register renaming to remove stall. Please confirm below statement: Anti-dependency MAY create stall (True/False)
Anti- dependency will not ALWAYS create stall because we can use register renaming to remove stall.Please confirm below statement:Anti-dependency MAY create stall (True/F...
404
views
answered
Sep 23, 2018
CO and Architecture
co-and-architecture
data-dependency
true-false
+
–
0
votes
21
UGC NET CSE | December 2012 | Part 3 | Question: 50
Which of the following definitions generates the same Language as $L$, where $L=\{ WW^R \mid W \in \{a, b\}$*$\}$? $S \rightarrow asb \mid bsa \mid \in$ $S \rightarrow asa \mid bsb \mid \in$ $S \rightarrow asa \mid bsa \mid asa \mid bsb \mid \in$ $S \rightarrow asa \mid bsa \mid asa \mid bsb \mid$
Which of the following definitions generates the same Language as $L$, where $L=\{ WW^R \mid W \in \{a, b\}$*$\}$?$S \rightarrow asb \mid bsa \mid \in$$S \rightarrow asa ...
4.1k
views
answered
Sep 21, 2018
Theory of Computation
ugcnetcse-dec2012-paper3
theory-of-computation
+
–
0
votes
22
self doubts
Consider the Minimal Finite Automata that accept all the strings of a’s & b’s where no. of a’s is congruent to 2 mod 3. The no. of states in this automata is
Consider the Minimal Finite Automata that accept all the strings of a’s & b’s where no. of a’s is congruent to 2 mod 3. The no. of states in this automata is
312
views
answered
Sep 21, 2018
0
votes
23
self doubts
what is minimum number of states of NFA which accepts language {abab^n|n>=0} U{aba^n|n>=0}
what is minimum number of states of NFA which accepts language{abab^n|n>=0} U{aba^n|n>=0}
270
views
answered
Sep 21, 2018
1
votes
24
Mod-N counter
Both the questions may be having same concepts and I need a good explanation considering both so asked simultaneously. Please consider both of them. Its confusing to approach these questions so a good explanation is appreciated.
Both the questions may be having same concepts and I need a good explanation considering both so asked simultaneously. Please consider both of them.Its confusing to appro...
1.8k
views
answered
Sep 20, 2018
0
votes
25
(571)x+(65A)x=(1120)x
268
views
answered
Sep 20, 2018
1
votes
26
self doubts
. Construct the minimal finite automata that accept all the strings of 0’s and 1’s where the integer equivalent of the binary string is congruent to 3 mod 6. What is the no. of states in the minimal finite automata?
. Construct the minimal finite automata that accept all the strings of 0’s and 1’s where the integer equivalent of the binary string is congruent to 3 mod 6. What is ...
281
views
answered
Sep 18, 2018
0
votes
27
What is dual of A+A'B=A+B
What is the dual of A+A'B=A+B
What is the dual of A+A'B=A+B
5.8k
views
answered
Sep 17, 2018
Digital Logic
digital
digital-logic
dual-function
+
–
0
votes
28
GATE CSE 2013 | Question: 1
A binary operation $\oplus$ on a set of integers is defined as $x \oplus y = x^{2}+y^{2}$. Which one of the following statements is TRUE about $\oplus$? Commutative but not associative Both commutative and associative Associative but not commutative Neither commutative nor associative
A binary operation $\oplus$ on a set of integers is defined as $x \oplus y = x^{2}+y^{2}$. Which one of the following statements is TRUE about $\oplus$?Commutative but no...
7.5k
views
answered
Sep 16, 2018
Set Theory & Algebra
gatecse-2013
set-theory&algebra
easy
binary-operation
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register