## RTU Previous Exam Papers BE CS 3rd Sem Data Structure and Algorithms January 2013

RTU Previous Exam Papers BE CS 3rd Semester Data Structure and Algorithms January 2013 UNIT – I 1.(a) Explain time and space complexity of an algorithm and also explain big 0, omega and theta notation with graph. Define array as data structure and its operation. Write an algorithm to read a M x N matrix … Read more RTU Previous Exam Papers BE CS 3rd Sem Data Structure and Algorithms January 2013