RTU Previous Exam Papers BE EC 3rd Semester Data Structure and Algorithms January 2013
RTU Previous Exam Papers BE EC 3rd Semester Data Structure and Algorithms January 2013 UNIT – I 1. (a) What is complexity of algorithm ? Explain the time-complexity in detail, also give the significance of Big-oh notation in brief. OR (a) Give the difference between Array and linked – list. How we represent the linear … Read more