Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Search results for iit-kanpur
0
votes
1
answer
1
Data Structure | Set | IIT Kanpur Interview question
There are Insert and Retrieve_Max operations on a set {}. for n such operations what is the time complexity of the efficient algorithm possible? $n^{2}$ nlogn n logn
There are Insert and Retrieve_Max operations on a set {}. for n such operations what is the time complexity of the efficient algorithm possible?$n^{2}$nlogn n logn
Souvik33
435
views
Souvik33
asked
Apr 2, 2023
DS
iit-kanpur
interview
data-structures
+
–
4
votes
1
answer
2
IIT Kanpur Programming Test 2017
C Program to find addition factors of a number in lexicographic order for n < 15. For example if n = 4 then output will be : 1 1 1 1 1 1 2 2 2 1 3
C Program to find addition factors of a number in lexicographic order for n < 15. For example if n = 4 then output will be :1 1 1 11 1 22 21 3
Churchill Khangar
2.6k
views
Churchill Khangar
asked
Apr 13, 2018
Programming in C
iit-kanpur
written-test
mtech
+
–
3
votes
0
answers
3
MS at IIT kanpur
How is MS in CSE at IIT kanpur. For a student who is looking for placement as main objective and doing research work is not a problem but does not want to do PhD .Is it wise to go for MS at IIT kanpur and what should be the research area?
How is MS in CSE at IIT kanpur. For a student who is looking for placement as main objective and doing research work is not a problem but does not want to do PhD .Is it...
ankit309
1.5k
views
ankit309
asked
May 19, 2018
IISc/IITs
iit-kanpur
admissions
mtech
ms
+
–
0
votes
0
answers
4
IITK Programming test
How should I prepare for programming test for MTEch at IIT Kanpur which will be held on 14th may? What sort of question I can expect and What should I actually practice?
How should I prepare for programming test for MTEch at IIT Kanpur which will be held on 14th may? What sort of question I can expect and What should I actually practice?
Ankit Sahu
1.7k
views
Ankit Sahu
asked
Apr 24, 2018
Programming in C
iit-kanpur
mtech-admission
programming-test
algorithms
written-test
+
–
0
votes
1
answer
5
IIT Kanpur admission (NEED URGENT HELP)
Today IIT Kanpur offered admission to 5 students from waitlist (4th round) under general category however this time they did not release any waitlist. I was waitlisted at number 6 in order of merit after 3rd round, which should effectively mean ... or will the seat go vacant even if I am willing to take admission? Please reply urgently! Thanks in advance!
Today IIT Kanpur offered admission to 5 students from waitlist (4th round) under general category however this time they did not release any waitlist. I was waitlisted at...
Hakuna Matata
926
views
Hakuna Matata
asked
Jul 2, 2018
IISc/IITs
gate-2018-addmission
iit-kanpur
admissions
mtech
+
–
0
votes
1
answer
6
IIT Kanpur admission
What was the last rank in the waitlist group which got admission offer from IIT Kanpur last year? Is there any chance for waitlist rank of around 20?
What was the last rank in the waitlist group which got admission offer from IIT Kanpur last year?Is there any chance for waitlist rank of around 20?
Hakuna Matata
1.2k
views
Hakuna Matata
asked
May 23, 2018
Written Exam
iit-kanpur
admissions
+
–
0
votes
1
answer
7
IIT Admission Query
IIT Kanpur vs IIT Madras Which one should I choose? Please give me some advice
IIT Kanpur vs IIT MadrasWhich one should I choose? Please give me some advice
Rajat Bhatia
995
views
Rajat Bhatia
asked
May 24, 2018
IISc/IITs
iit-kanpur
gate2018-admissions
admissions
iit-madras
+
–
0
votes
0
answers
8
Admission Query COAP
did COAP portal is only the m.tech acceptance portal or it is for both M.tech as well as M.S? *although i have got offer letter from iitk (ms), but still coap is showing no offer at all.
did COAP portal is only the m.tech acceptance portal or it is for both M.tech as well as M.S?*although i have got offer letter from iitk (ms), but still coap is showing n...
hacker16
933
views
hacker16
asked
May 25, 2018
IISc/IITs
iit-kanpur
gate2018-admissions
admissions
+
–
0
votes
0
answers
9
M.tech or m.s at iitk
I have got m.tech and m.s. both offers from iitk and now I am confused in choosing one. Help me in making a decision.
I have got m.tech and m.s. both offers from iitk and now I am confused in choosing one. Help me in making a decision.
sunil pratap
592
views
sunil pratap
asked
May 28, 2018
IISc/IITs
mtech
iit-kanpur
+
–
2
votes
2
answers
10
IIT Kanpur Test Sample Paper
(Overfed pets) The Jones family have n pet cats. The caretaker who is charged to feed these cats is very careless. Everytime he goes into the pet zone, he takes food along and feeds a random cat - he does not care whether the cat seems to be hungry ... expectation, how many more trips would he have to make before he feeds one of the unfed (n− k) cats for the first time?
(Overfed pets) The Jones family have n pet cats. The caretaker who is charged to feed these cats is very careless. Everytime he goes into the pet zone, he tak...
Churchill Khangar
849
views
Churchill Khangar
asked
Apr 29, 2018
Probability
iit-kanpur
written-test
mtech
+
–
0
votes
1
answer
11
IITK Sample written test
I Think answer should be $C$. Let , India is a stronger team than australia is $X$ and India will loose the series is $Y$ so ,$X\rightarrow Y$ can be wriiten as $Y^{'}\rightarrow X^{'}$ or $Y+X^{'}$ So answer is coming out to be $C$. Am i right?
I Think answer should be $C$.Let ,India is a stronger team than australia is $X$and India will loose the series is $Y$so ,$X\rightarrow Y$ can be wriiten as$Y^{'}\rightar...
Anand.
659
views
Anand.
asked
May 15, 2018
Mathematical Logic
written-test
iit-kanpur
mtech-admission
mathematical-logic
+
–
2
votes
0
answers
12
IITK written test for M-Tech
If you are hosting an email service on your server with some domain name with many local nodes, what service is absolutely essential? 1.DNS 2.SMTP 3.DHCP 4.IRC Multiple options can be right?
If you are hosting an email service on your server with some domain name with many local nodes, what service is absolutely essential?1.DNS2.SMTP3.DHCP4.IRCMultiple option...
MIRIYALA JEEVAN KUMA
1.6k
views
MIRIYALA JEEVAN KUMA
asked
Feb 9, 2018
Computer Networks
iit-kanpur
interview
written-test
+
–
0
votes
1
answer
13
IIT Kanpur Test Sample Paper
(Batman and Robin) The city of Gotham keeps propping up newer challenges for our dynamic duo. The criminals in the city are so organized that they have come up with a schedule to commit the crimes. a. The Mad Hatter commits maddeningly despicable ... . What is the probability of that? 4) In the above scenario, what is the probability that two criminals get defeated?
(Batman and Robin) The city of Gotham keeps propping up newer challenges for our dynamic duo. The criminals in the city are so organized that they have come up wit...
Churchill Khangar
488
views
Churchill Khangar
asked
Apr 29, 2018
Probability
iit-kanpur
written-test
mtech
+
–
0
votes
1
answer
14
IIT Kanpur Sample Test Paper
Given an undirected graph with vertices as your friends and edges between people who do not talk to each other. Your task is to invite as many guests to your party such that there are no two friends at the party who have problem talking to each ... instance of: A. Maximum vertex cover. B. Maximum cut. C. Maximum eigenvalue of adjacency matrix. D. None of the above.
Given an undirected graph with vertices as your friends and edges between people who do not talk to each other. Your task is to invite as many guests to your party su...
Churchill Khangar
791
views
Churchill Khangar
asked
Apr 17, 2018
Graph Theory
iit-kanpur
written-test
+
–
0
votes
0
answers
15
#iit kanpur #admission
Hey Guys, How to prepare for the IITK programming test. what is the level of questions?? Any sample questions from previous years?? Please guys any help wud be appreciated. Thank you.
Hey Guys,How to prepare for the IITK programming test.what is the level of questions??Any sample questions from previous years?? Please guys any help wud be appreciated.T...
ne0n
434
views
ne0n
asked
Apr 20, 2018
Written Exam
interview
iit-kanpur
written-test
mtech
+
–
0
votes
0
answers
16
IIT Kanpur
10. In the process of designing an $n$ storey building, an architect designed $k$ types of floor modules. Even though the ground floor can use any of the $k$ modules, subsequent floors need to satisfy compatibility constraints. For each module $M_{i}$, there is some subset $B_{i}$ of modules on top of which $M_{i}$ ... A. $O(k^{n})$ B. $O(n^{k})$ C. $O(nk)$ D. $O(nk^{2})$ E $O(n^{2}k)$
10. In the process of designing an $n$ storey building, an architect designed $k$ types of floor modules. Even though the ground floor can use any of the $k$ modules, sub...
Shubham Pandey 2
415
views
Shubham Pandey 2
asked
Apr 13, 2018
Written Exam
iit-kanpur
+
–
0
votes
0
answers
17
[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
645
views
rahul sharma 5
asked
Mar 18, 2018
Theory of Computation
iit-kanpur
written-test
gate2017
interview
mtech
+
–
2
votes
0
answers
18
[Graphs]IIT-k Written test
if degree of vertices < 3, then prove that the graph will be union of vertex disjoint path and cycle
if degree of vertices < 3, then prove that the graph will be union of vertex disjoint path and cycle
rahul sharma 5
364
views
rahul sharma 5
asked
Mar 18, 2018
Graph Theory
iit-kanpur
written-test
interview
mtech
gate2017
+
–
0
votes
0
answers
19
[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
365
views
rahul sharma 5
asked
Mar 18, 2018
Graph Theory
iit-kanpur
written-test
mtech
gate2017
+
–
1
votes
0
answers
20
[2016]IITK interview question
1. Prove/Disprove: a) If a graph has k-independent components, it it n-k+1 colorable b) converse of (a) c) If a graph is not n-1 colorable, it's a clique
1. Prove/Disprove:a) If a graph has k-independent components, it it n-k+1 colorableb) converse of (a)c) If a graph is not n-1 colorable, it's a clique
rahul sharma 5
459
views
rahul sharma 5
asked
Feb 26, 2018
Graph Theory
interview
written-test
iit-kanpur
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register