Register

Recent questions tagged 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
User Avatar
0 votes
0 answers
3
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.
User Avatar
0 votes
0 answers
4
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...
User Avatar
0 votes
1 answer
5
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
User Avatar
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?
User Avatar
3 votes
0 answers
7
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...
User Avatar
0 votes
0 answers
11
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?
User Avatar
0 votes
0 answers
12
#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...
User Avatar
4 votes
1 answer
15
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
User Avatar
0 votes
0 answers
17
[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...
User Avatar
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
User Avatar
1 votes
0 answers
19
[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
User Avatar
2 votes
0 answers
20
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...
User Avatar
0 votes
1 answer
22
IIT Kanpur Interview Question
In which segment of memory layout the information about dynamic linked libraries is stored?
In which segment of memory layout the information about dynamic linked libraries is stored?
User Avatar
2 votes
0 answers
24
Placement Query
Which companies visited IIT Kanpur for placements this academic year?
Which companies visited IIT Kanpur for placements this academic year?
User Avatar
6 votes
3 answers
25
IIT Kanpur Written Test
There are 16072016 users in Facebook. A graph is formed where an edge(u,v) is defined when a male is friend to a female and vice versa. Estimate the number of simple cycle of length 1607 formed in the graph?
There are 16072016 users in Facebook. A graph is formed where an edge(u,v) is defined when a male is friend to a female and vice versa. Estimate the number of simple cycl...
User Avatar
1 votes
1 answer
26
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)
User Avatar
1 votes
1 answer
28
IIT Kanpur Interview Written Test 2016 Question 1
Implement a^b mod m where a,b and m can be huge. (Hint : O(log n))
Implement a^b mod m where a,b and m can be huge. (Hint : O(log n))
User Avatar
To see more, click for the full list of questions or popular tags.