Search results for iit-kanpur

0 votes
1 answer
1
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
4 votes
1 answer
2
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
3 votes
0 answers
3
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...
0 votes
0 answers
4
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?
0 votes
1 answer
6
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?
0 votes
1 answer
7
IIT Kanpur vs IIT MadrasWhich one should I choose? Please give me some advice
0 votes
0 answers
8
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...
0 votes
0 answers
9
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.
0 votes
1 answer
11
2 votes
0 answers
12
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...
0 votes
0 answers
15
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...
2 votes
0 answers
18
if degree of vertices < 3, then prove that the graph will be union of vertex disjoint path and cycle
0 votes
0 answers
19
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...
1 votes
0 answers
20
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