CSED, MNNIT Allahabad

BTech III (CS & IT), I Mid-sem Exam, August 2006

Data Structure
Time One Hour M.M. 20
NOTE: Questions carry equal weight. Feel free to assume any missing data but
categorically mention it under the heading Assumptions for this question
1. Write a C program to create singly linked list for polynomial 3x+1.
2. State true or false. Justify your answer i.e. give reason if your answer is true, give a
counter example if your answer is false. if f(n) is O(g(n)) then logf(n) is O(log(g(n))).
Assume that f(n) 1 and log(g(n)) > 0 for all n.
3. How one decides whether given matrix is a sparse matrix? Give suitable representation for
a sparse matrix and use this representation to demonstrate row order preserving matrix
transpose.
4. How linked lists provide more exibility compared to arrays? Give algorithms along with
suitable examples for insertion and deletion of element from a singly linked circular list
with a header node.
5. What are ordered lists? Give two examples. Does enumeration constant of C pro-
gramming language has any semantic relationship with ordered lists. Enumerate various
operations associated with the ordered lists.
Declaration
I value Examination Ethics and practice it.
Signature Name and Registration No.