Questions by Nandkishor3939

0 votes

0 answers

1

Ford-Fulkersons method:

asked in Algorithms Apr 28, 2019

449 views

0 votes

1 answer

2

Wifi : Syllabus
What are the important topics in WIFI : It would be very helpful if some one answered this thank you:)

asked in Computer Networks Mar 7, 2019

816 views

0 votes

3 answers

3

GATE 2019
What was the Expectancy in the full binary tree question asked in the exam ? I got 3

asked in GATE Feb 4, 2019

1.3k views

0 votes

1 answer

4

GATE 2019
There was one question of OS : TLB based : what is its answer : 256 x 2^10 ??

asked in Operating System Feb 4, 2019

836 views

0 votes

0 answers

5

GATE 2019
What will be the answer to this question ? Will it go in infinite loop ?

asked in Digital Logic Feb 4, 2019

1.3k views

1 vote

1 answer

6

When will be the exam forms of IITH-PG,ISRO and BITS-HD be out ?
If any one knows plz let me know … on websites I am not getting any fixed info.

asked in IIITH-PGEE Feb 4, 2019

830 views

0 votes

0 answers

7

Abelian group
A quick question Is every multiplication modulo function a Abelian group....Or is it the case that the function should have prime number as modulo

asked in Graph Theory Feb 2, 2019

235 views

0 votes

0 answers

8

LR(1) doubt
In exam if they are mentioning LR(1) parser Then which parser to consider: SLR(1) / LALR(1) / CLR(1)

asked in Compiler Design Jan 31, 2019

291 views

0 votes

1 answer

9

10Base5 cable
I think its answers should be 500 m , is any one having idea of this:

asked in Computer Networks Jan 26, 2019

607 views

0 votes

0 answers

10

MadeEasy Subject Test 2019: Digital Logic - Number Systems
Even after seeing the solution I was unable to understand this question: Can any one tell whats happening here:

asked in Digital Logic Jan 25, 2019

497 views

0 votes

1 answer

11

DH algorithm
How to calculate such a value: Please, someone explain because this is not possible on cal….!

asked in Computer Networks Jan 25, 2019

459 views

2 votes

1 answer

12

max weighted MST possible
Let G be a complete undirected graph on 5 vertices 10 edges, with weights being 1, 2, 3, 4, 5, 6, 7, 8, 9, 10. Let X be the value of the maximum possible weight a MST of G can have. Then the value of x will be_____ the answer to this question is given as 11 but there is no procedure given . Please ,can anyone help me out in understanding the procedure

asked in Graph Theory Jan 25, 2019

726 views

0 votes

1 answer

13

Cache Organization
Can any one help me out with this question : This was asked in MadeEasy CBT held on 23rd jan

asked in CO and Architecture Jan 25, 2019

1.0k views

1 vote

0 answers

14

Binary Tree
I think its answer is 8 .Please ,can any one make it sure for me :)

asked in DS Jan 25, 2019

656 views

1 vote

1 answer

15

Random Doubt in f(n)=O(n^2)
Can any one please help me out in understanding how to read : f(n)=O(n^2) I am confused in : 1] f(n) is the upper bound of n^2 2]f(n)’s upper bound is n^2 Or is their any another way of reading it out…! THANK YOU

asked in Algorithms Jan 25, 2019

260 views

0 votes

0 answers

16

Number of sub graphs possible
Number of labelled subgraphs possible for the graph given below______________

asked in DS Jan 25, 2019

461 views

0 votes

1 answer

17

Recursive Descent Parser
Does RDP require back tracking ? I am asking this because I have read that if RDP doesn't require back tracking then it is a predictive parser(LL(1))!! A predictive parser is a recursive descent parser that does not require backtracking. ... the class of LL(k) grammars ( https://en.wikipedia.org/wiki/Recursive_descent_parser ) Does it mean that the RDP requires BT

asked in Compiler Design Jan 24, 2019

1.2k views

4 votes

2 answers

18

Nullity of matrix
Nullity of a matrix = Total number columns – Rank of that matrix But how to calculate value of x when nullity is already given(1 in this case)

asked in Linear Algebra Jan 24, 2019

3.3k views

0 votes

1 answer

19

Dynamic programming
My answer came out to be 13: because when we will compute T(13) { as we are using Dynamic programming , it will have to compute value of T(12),T(11),…...T(2) only once(as it will store it and reuse it) so the stack size will be 1 (for T(13))+11 (for T(12),T(11),…...T(2)) = 12…...(48/4) } will any one help me out

asked in Algorithms Jan 22, 2019

721 views

0 votes

0 answers

20

RL and DCFL
the answer is given that the statement 2 is correct? But how… even if we create a DCFL by final state condition like : q(b,z0| z0)-→ final state ,q(null,a|z0) ----→ final state [Thats what was mentioned in the video solution] it will accept the string aab

asked in Theory of Computation Jan 22, 2019

482 views

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

Questions by Nandkishor3939

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

Subjects

Questions by Nandkishor3939

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

Recent Posts

Subjects

Recent Blog Comments