Thapar University 2007 M.B.A Data Structures - Question Paper
Friday, 19 April 2013 12:55Web
Page 1 of 2
Thapar University, Patiala
Computer Science & Engineering Department
MBA(IT)(Bridge)Course first Semester
first Mid Semester Test
Thapar University, Patiala Computer Science & Engineering Department MBA(IT)(Bridge course) lil Semester 1st Mid Semester Test Course Code :SB-141 2007
Course Name : Data structures Time Allowed :1 Hr
Instructor :Anil Vashisht Max. Marks :15
|
Note : Attempt all questions. |
|
Qi |
i) What is ADT?
ii) Big Oh notation consider the upper boundary while calculating the complexity of an algorithm. Explain the meaning of statement.
iii) What is the drawback of Big Oh notation for finding the complexity of an algorithm?
iv) What is the principle of stack?
v) What is the drawback of binary search algorithm?
vi) Give an example of sorting algorithm whose time complexity is 0(n2) and O(nlogn) |
6 |
|
Q2 |
Wntc a well documented program in 4C to implement binary search algorithm. |
5 |
|
|
|
|
|
Q3 |
Write program/function in C* to implement push and pop operation on stack. Also check for underflow and overflow condition of stack. |
4 |
|
|
|
|
|
Add comment
| Earning: Approval pending. |
|
|
