Awesome q2a theme
Ask us anything
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Blogs
Previous Year
Exams
Answers by zxy123
User zxy123
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User zxy123
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
votes
TIFRGS2021 Question
A box contains 5 red marbles, 8 green marbles, 11 blue marbles, and 15 yellow marbles. We draw marbles uniformly at random without replacement from the box. What is the minimum number of marbles to be drawn to ensure that out of the marbles drawn, at least 7 are of the same colour? (A) 7 (B) 8 (C) 23 (D) 24 (E) 39
answered
Mar 24
in
Combinatory

10
views
tifr2021
0
votes
Kenneth H Rosen
Let p and q be propositions p: I bought a lottery ticket this week q: I won the milliondollar jackpot Express each of these propositions as English sentences (i) ~p (ii) p$\vee$q (iii) p$\rightarrow$q (iv) p$\wedge$q (v) p$\Leftrightarrow$q (vi) ~p$\rightarrow$~q (vii) ~p$\wedge$~q (viii) ~p$\vee$(p$\wedge$q)
answered
Mar 22
in
Mathematical Logic

16
views
kennethrosen
discretemaths
+1
vote
Kenneth H Rosen
Show that $p<>q$ and ~p <>~q are logically equivalent.
answered
Mar 22
in
Mathematical Logic

17
views
kennethrosen
discretemaths
0
votes
#Toc #Applied
For this type of question, how did you attempt to make the DFA?
answered
Mar 22
in
Theory of Computation

19
views
computation
theory
+2
votes
Self Doubt on Theory of Computation
What is the intersection of recursive and recursively enumerable language?
answered
Mar 4
in
Theory of Computation

24
views
turingmachine
toclanguages
selfdoubt
+2
votes
Unambiguous Grammar
I am no able to prove if the following grammar is ambiguous. G=({S,A,B},{A,B},P,S} P: S>aABbBA A>bSa B>aSb Can some one help me prove it?
answered
Mar 2
in
Theory of Computation

31
views
selfdoubt
+1
vote
Aptitude question self doubt
The greatest number that divides 215,167 and 135 so as to leave the same remainder in each case What is the approach to solve such questions #gate2022
answered
Mar 1
in
Numerical Ability

28
views
selfdoubt
+1
vote
Made easy workbook, Data interpretation
The GDP in Rupees grew at 7% during 201213.For international comparison, the GDP is compared in US Dollars after conversion based on the market exchange rate. During the period 201213 the ₹ 50aUSD to ₹ 60USD. India's GDP in USD during the period 201213 a increased by 5% b decreased by 13% c decreased by 20% d decreased by 11%
answered
Feb 14
in
Numerical Ability

17
views
workbook
0
votes
quest is from compiler design subject BSCS topic errors
answered
Feb 10
in
Compiler Design

30
views
compilerdesign
+1
vote
Selection sort
Can anybody explain me why the number of swaps in selection sort algorithm is (n1) in worst case ? Let's say the array is {6,5,4,3,2,1} then the number of swaps should be 5. But I think the no of swaps should be 3. Please explain.
answered
Feb 8
in
Algorithms

36
views
algorithms
sorting
+1
vote
Made Easy Workbook
How can we minimize this function? Ans(d)
answered
Feb 2
in
Digital Logic

37
views
digitallogic
+3
votes
Peter Linz Ex7.3 Q6 CFL
L=$a^nb^{2n}  n\geq 0$ is a DCFL. Show that L* is DCFL
answered
Jan 23
in
Theory of Computation

35
views
peterlinz
dcfl
0
votes
Probablity engineering mathematics
A box contains 10 apples out of which 4 are rotten. Two apples are taken out together if one of them is good what is the probablity that the other one is also good. Note: Please don’t use ‘C’ combination terms in your answer rather try to make it as clear as possible.
answered
Jan 23
in
Mathematical Logic

31
views
probability
+1
vote
selfdoubt madeeasy test series
Consider the basic block given below. u=u+v v=v+w x=vw y=vx z=u+v Find the sum of the minimum no of edges and nodes present in the DAG representation of the basic block given above.
answered
Jan 22
in
Compiler Design

13
views
compilerdesign
+1
vote
Made easy test series
Can anyone draw the DFA’s for the question mentioned?
answered
Jan 22
in
Theory of Computation

33
views
finiteautomata
+1
vote
Made Easy Workbook
What will be the number of components?
answered
Jan 14
in
Graph Theory

46
views
workbook
+1
vote
Made Easy Workbook Algorithms Chapter2 Q2
Solve the following with Substitution method only. $T(n) = 8T(n/2) + n^{2}logn$) n>0 T(1)=1 Note: The original question doesn’t say to solve with substitution only but i don’t like Master’s method.
answered
Jan 14
in
Algorithms

27
views
algorithms
+1
vote
TEST series :TESTBOOK
answered
Jan 14
in
Programming

34
views
test
+1
vote
#gate2000#cse#graph
Why b option is incorrect Let G be an undirected graph. Consider a depthfirst traversal of G, and let T be the resulting depthfirst search tree. Let u be a vertex in G and let v be the first new (unvisited) vertex visited after visiting u in the traversal. Which of the following ... u is a leaf in T (D) If {u,v} is not an edge in G then u and v must have the same parent in T
answered
Jan 14
in
DS

31
views
plzz
explain
+2
votes
Self doubt :Time Complexity Iterative
Can Someone help me understand the timecomplexity of dependent loops? for example, Q1> int i,j; for(i=1;i<n;i=i++) { for(j=1;j<=i;j=j*2) } Q2> int i,j; for(i=1;i<=n/2;i=i++) { for(j=1;j<=i;j++) }
answered
Jan 13
in
Algorithms

24
views
timecomplexity
selfdoubt
+1
vote
Gate Applied Course Test Series
There are 20 intermediate stops on a route of a transport corporation bus. The number of ways in which the bus can stop at 6 of these intermediate stops such that no 2 stops are consecutive is ?
answered
Jan 12
in
Combinatory

33
views
combinatory
+2
votes
What is total number of planer graph can be formed with 6 vertices ?
answered
Jan 12
in
Graph Theory

38
views
graphtheory
discretemaths
+2
votes
Made Easy Test Series
$A. O(n (logn)^2) $ $B. O(n^2 logn) $ $C. O(n^2) $ $D. O(n log(log(n)))$
answered
Jan 12
in
Algorithms

20
views
testseries
0
votes
# edugorilla #IT placement papers # wipro
A team of 30 men is supposed to do a work in 37 days . After 25 days , 5 more men were employed and the work was finished 1 day earlier . How many days would it have been delayed if 5 more men were not employed?
answered
Jan 12
in
Numerical Ability

24
views
plzz
solve
0
votes
Tga test series
answered
Jan 12
in
Digital Logic

18
views
selfdoubt
0
votes
Gate Academy
Q.Considerhe following program segment hypothetical CPU have three resistors r1 r2 and r3  Instruction operation Instruction size (in word) Mov r1,5000 r1< memory [5000] 2 Mov r2(r3) r2< memory [r1] 1 Add r2 r3 r2< r2+r3 1 Mov 6000 ... cycle per word Instruction fetch and decode: 2 clock cyxle per word The total number of clock cycle required to execute the program is?
answered
Jan 6
in
CO & Architecture

38
views
selfdoubt
+1
vote
Made Easy Test Series
Why 21 is not an answer?
answered
Jan 2
in
CO & Architecture

50
views
testseries
+1
vote
TGA material
For the code: int z,x=5,y=10,a=4,b=2; z=x++y*b/a; The value of z will be_______
answered
Dec 29, 2020
in
Programming

28
views
infixprefix
+3
votes
What would be the output of following program and why?
answered
Dec 29, 2020
in
Programming

33
views
programming
+1
vote
self doubt ambiguous to unambiguous
https://gateoverflow.in/141809/ambiguoustounambiguous what will be the unambiguous grammar …...
answered
Dec 29, 2020
in
Compiler Design

17
views
selfdoubt
0
votes
Number system,Gate2021, previous year Gate questions
answered
Dec 29, 2020
in
Compiler Design

30
views
selfdoubt
0
votes
self doubt(first and follow/left recursion)
(1)S>AA/ab A>Bd/null B>SB/d (2) S>AB/a A>SA/null B>AB/d doubt 1>i can’t able to remove indirect left recursion from both the questions,what is grammar after removing left recursion?? doubt 2>what is the FIRST and FOLLOW ?
answered
Dec 16, 2020
in
Compiler Design

27
views
selfdoubt
firstfollow
0
votes
#Self Doubt #DataStruct
The degree of a node is the no. of children it has. Show that in any binary tree the number of leaves is 1 more than the no. of nodes of degree 2.
answered
Dec 16, 2020
in
DS

39
views
datastructures
binarytree
+1
vote
#Self_Doubt #Turing_Machine
Let's Suppose we have L such that there exists a Turing Machine that enumerates the elements of L in proper order. If this is the case, can we say that it means L is recursive?
answered
Dec 16, 2020
in
Theory of Computation

16
views
selfdoubt
+1
vote
base conversion question.
$(142)_b + (112)_{b2}=(75)_8$, find base b How to solve these type of question fast
answered
Dec 16, 2020
in
CO & Architecture

20
views
numbersystem
0
votes
maxheap test
what is the level order traversal for an array of elements 20,15,21,31,16,18,19,40 .These elements are inserted into an empty max heap.
answered
Dec 3, 2020
in
Algorithms

69
views
selfdoubt
algorithms
testseries
+1
vote
GATE200216 https://gateoverflow.in/869/gate200216
answered
Dec 3, 2020
in
Databases

20
views
selfdoubt
0
votes
#madeeasy #serializability
consider the following schedule: S:W1(A) W2(B) W3(B) W4(B) The number of schedule which are view equal to s is _____. ans is 6 but i am getting 8 ans didn’t considers these two combinations: W2(B) W3(B) W4(B) W1(A) W3(B) W2(B) W4(B) W1(A) Is these two combinations can possible ?
answered
Dec 3, 2020
in
Databases

41
views
databases
+1
vote
Applied Course
i am getting two different ans for this ques
answered
Dec 2, 2020
in
Algorithms

58
views
huffmancode
0
votes
Probability Binomial Distribution NCERT Doubt
In a hurdle race, a player has to cross 10 hurdles. The probability that he will clear each hurdle is 5/6 . What is the probability that he will knock down fewer than 2 hurdles?
answered
Dec 2, 2020
in
Probability

28
views
probability
Page:
1
2
3
4
next »
9,200
questions
3,182
answers
14,686
comments
96,168
users