CS62: 'C' programming and Data Structure
Year: 2003 TEE: june Time 2 Full Marks 60
Note: There are 6 questions in this paper. Question 1 is compulsory. Answer any three questions from the rest. All algorithms should be written nearer to ?c? language.
Q.2(c): List atleast 4 different between Arrays and Pointers in 'C' language.
| Q.3(a): Write the postfix form of the following expressions:
(i) (C x D) ¸(a-b) (ii) C x D¸ a-b: [2] Q.3(b): Write an algorithm for the addition of two matrices. The second matrix will be a sparse matrix. The first matrix is not a sparse matrix.: [2] Q.3(c): What is an AVL Tree? How does it differ from a Binary Tree?: [3]
home || << Previous || Next >> |