Dark Mode

Questions by dan31

1 vote

0 answers

1

JEST 2019 Descriptive Q4 (8 Marks)
Give an efficient algorithm for maximum size rectangle binary sub-matrix with all 1s . [Complexity should be O($n^c$)] (Memory based – Original question had a lot of added details)

asked in Algorithms Feb 17, 2019

313 views

0 votes

0 answers

2

JEST 2019 Descriptive Q3 (8 Marks)
Determine the number of functions f:{1,2,3…,n}→{1995,1996} satisfying the condition that f(1)+f(2)+…f(n) is odd.

asked in Set Theory & Algebra Feb 17, 2019

492 views

0 votes

0 answers

3

JEST 2019 Descriptive Q2 (8 Marks)
Given a sequence $a_1$, $a_2$ , $a_3$ ... $a_n$ of any different positive integers, exhibit an arrangement of integers between 1 and $n^2$ which has no increasing or decreasing subsequence of length n+1.

asked in Graph Theory Feb 17, 2019

323 views

1 vote

0 answers

4

JEST 2019 Descriptive Q1 (8 Marks)
Suppose that G contains a cycle C, and a path of length at least k between some two vertices of C. Show that G contains a cycle of length at least √k.

asked in Graph Theory Feb 17, 2019

310 views

1 vote

0 answers

5

ACE PreGate vs Made Easy CBT
I only want to appear for one Centre-based mock. I am in a dilemma between Ace PreGate vs Made Easy CBT2. Could anyone please help me decide?

asked in GATE Dec 18, 2018

1.5k views

0 votes

1 answer

6

Set Theory
If A = {1,2,3...n}, then number of equivalence relations possible on A , which are also surjection on A is ________________? How to approach this type of problems?

asked in Set Theory & Algebra Nov 9, 2018

360 views

0 votes

1 answer

7

Bijective function
Let R be set of all real numbers, and A = B = R*R A function A-> B is defined by f(a,b) = (a+b,a-b) How to prove it is a bijective function?

asked in Set Theory & Algebra Nov 9, 2018

478 views

0 votes

1 answer

8

Set Theory
A relation R on a set of positive integers is defined by (a,b) belongs to R iff a and b are relatively prime. Which of the following is true about R? a. Symmetric and Reflexive b. Symmetric and irreflexive c.Symmetric and transitive d. Symmetric and not transitive The Ans is given as (d) but I think (b) is true. Any thoughts?

asked in Set Theory & Algebra Nov 8, 2018

583 views

0 votes

0 answers

9

Regular graph coloring
If G is a connected k-regular graph with chromatic number k+1, then find the number of edges in G?

asked in Graph Theory Nov 6, 2018

965 views

2 votes

2 answers

10

Graph Connectivity
Consider the given statements S1: In a simple graph G with 6 vertices, if degree of each vertex is 2, then Euler circuit exists in G. S2:In a simple graph G, if degree of each vertex is 3 then the graph G is connected. Which of the following is/are true?

asked in Graph Theory Nov 6, 2018

1.7k views

0 votes

0 answers

11

Regular Graph
If a 2-regular graph G has a perfect matching then which of the following is/are true? S1: G is a cycle of even length S2: Chromatic number of G is 2 S3: G is connected S4: Every component of G is an even cycle Options- A) S1,S2 B)S2,S4 C)S3,S4 D)S1,S4

asked in Graph Theory Nov 6, 2018

632 views

1 vote

0 answers

12

Graph connectivity
Let G be a connected graph with 7 connected components and each component is a tree. If G has 26 edge then number of vertices in G is?

asked in Graph Theory Nov 6, 2018

1.1k views

1 vote

0 answers

13

Dynamic Programming Preparation for Gate
How to prepare for Dynamic Programming topic in DAA for GATE exam?

asked in Algorithms Sep 9, 2018

896 views

0 votes

1 answer

14

Finite State Automata
Every DFA is NFA but not vice versa Can you please explain how this statement is true? Reference:- https://www.geeksforgeeks.org/toc-finite-automata-introduction/

asked in Theory of Computation Aug 28, 2018

2.6k views

2 votes

0 answers

15

Johnson Counter Doubt
I have found this statement about Johnson Counter : A Johnson counter requires decoding gates whereas a ring counter doesn't. As with the binary counter, one logic gate (AND gate) is required to decode each state, but with the Johnson counter, each ... to implement it? The reference link is here: https://www.doc.ic.ac.uk/~nd/surprise_96/journal/vol4/cwl3/report.html#johnson

asked in Digital Logic Jul 27, 2018

563 views

1 vote

1 answer

16

First And Follow
First and Follow set of the below grammar: S-> Aa / d A-> Bd / epsilon B-> Sc / epsilon

asked in Compiler Design May 6, 2018

1.4k views