[Graphs]IIT-k Written test

rahul sharma 5 asked Mar 18, 2018

362 views

See all

Please log in or register to answer this question.

Related questions

0 votes

0 answers

rahul sharma 5 asked Mar 18, 2018

643 views

[TOC]IIT-k Written test
Consider a grammar $G$ with productions $P$. Let $INIT(G)$ be the grammar with production $P'$ such that $P' = P \cup ( A\rightarrow B \mid \text{such that } A->BC \text{ belongs to } P ) \cup ( A\rightarrow \epsilon \mid \text{such that} A\rightarrow b \text{ belongs to} P )$ prove that: a) Prefix(G) is subset of INIT(G) b) INIT(G) is subset of Prefix(G)

Consider a grammar $G$ with productions $P$. Let $INIT(G)$ be the grammar with production $P'$ such that $P' = P \cup ( A\rightarrow B \mid \text{such that } A->BC \te...

rahul sharma 5

643 views

rahul sharma 5 asked Mar 18, 2018

0 votes

0 answers

rahul sharma 5 asked Mar 18, 2018

364 views

[Graphs]IIT-k Written test
Graph Matching was explained. Let $S$ and $R$ be the matching graph, then a new graph $G=(S-R) \cup (R-S)$, will be union of vertex disjoint path and cycle. Also prove that the cycle obtained will be of even length.

Graph Matching was explained. Let $S$ and $R$ be the matching graph, then a new graph $G=(S-R) \cup (R-S)$, will be union of vertex disjoint path and cycle. Also prove th...

rahul sharma 5

364 views

rahul sharma 5 asked Mar 18, 2018

1 votes

1 answer

pC asked Jul 18, 2016

1,264 views

IIT Kanpur Interview Written Test 2016 Question 3
Implement Longest Increasing Subsequence with the help of 1-D array for dynamic programming. (Hint : MaxTill 1-D array)

Implement Longest Increasing Subsequence with the help of 1-D array for dynamic programming. (Hint : MaxTill 1-D array)

1.3k views

pC asked Jul 18, 2016

1 votes

1 answer

pC asked Jul 18, 2016

2,065 views

IIT Kanpur Interview Written Test 2016 Question 2
Ms. Dany wants to clean the house having many rooms. She moves from one room to the next which takes 1 time unit. Each room has only one exit door. After some time she is bound to reach a room which she has cleaned already. Let ... be 'k'. Print 't' and 'k'.(do not condiser time taken to clean the room) (Hint : DFS)

Ms. Dany wants to clean the house having many rooms. She moves from one room to the next which takes 1 time unit. Each room has only one exit door. After some time she is...

2.1k views

pC asked Jul 18, 2016

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

[Graphs]IIT-k Written test

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

Related questions

0 reply

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

Related questions

0