Algorithms

@arjunsuresh:disqus While giving exam, I face serious issue sometimes about Predicting complexity of New Aglorithm. Sometime they ask some random time compexity question without giving entire context ! (Like ex -> Find time complexity of finding max and second max of unsorted array.)
I’m not able to do on the spot do the analysis of new question they have thrown at us. How to tackle that !
Also I make mistakes sometime in Tracing of simple program, like simple addition Mistakes, Happened in GATE 2015.. ( I did silly addition mistakes in C program & got 0 ) how to solve that !

For few difficult programs I’m not able to even trace them out.. How to trace program in Exams without wasting too much time ? Questions like this -> http://gateoverflow.in/394/gate2008_84-85 , There are too many things to do, in very less time.. Guide.

Attaching list of difficult questions I’m facing issue with ->

Too Hard To Do (Hit in morning) ->

http://gateoverflow.in/394/gate2008_84-85

http://gateoverflow.in/523/gate1991_03-viii

http://gateoverflow.in/784/gate2005_39

http://gateoverflow.in/925/gate2003_35

http://gateoverflow.in/949/gate2003_61-62

http://gateoverflow.in/954/gate2003_67

http://gateoverflow.in/957/gate2003_70

http://gateoverflow.in/971/gate2003_88

http://gateoverflow.in/27308/tifr2014-b-11
=> From Combinatorics

http://gateoverflow.in/2269/gate1997_9
Spanning Tree, Difficult Question

http://gateoverflow.in/3533/gate2007-it_81
Gradiance

i need discussion on algorithm i have few queries to shoot