Cauvery Institute of Technology

Department of Computer Science and Engineering

2nd Internal Assessment
Sub: Data Structures with C sub-code: 10CS35 Date: 17-OCT-2015 Duration: 1 hour
Note: Answer any two questions from each part.
Part A
1. Write a program to read and search an element in sparse matrix. Use triples <row, column, value> to
represent an element in the sparse matrix.
2. What is a structure? How to declare a structure? What is a tagged structure? Explain with example.
3. What is a sparse matrix? How to represent sparse matrix? Write the Abstract data type(ADT) of sparse
matrix.

(Cont…)

Cauvery Institute of Technology

Department of Computer Science and Engineering
2nd Internal Assessment
Sub: Data Structures with C sub-code: 10CS35 Date: 17-OCT-2015 Duration: 1 hour
Note: Answer any two questions from each part.
Part A
1. Write a program to read and search an element in sparse matrix. Use triples <row, column, value> to
represent an element in the sparse matrix.
2. What is a structure? How to declare a structure? What is a tagged structure? Explain with example.
3. What is a sparse matrix? How to represent sparse matrix? Write the Abstract data type(ADT) of sparse
matrix.

(Cont…)

Cauvery Institute of Technology

Department of Computer Science and Engineering
2nd Internal Assessment
Sub: Data Structures with C sub-code: 10CS35 Date: 17-OCT-2015 Duration: 1 hour
Note: Answer any two questions from each part.
Part A
1. Write a program to read and search an element in sparse matrix. Use triples <row, column, value> to
represent an element in the sparse matrix.
2. What is a structure? How to declare a structure? What is a tagged structure? Explain with example.
3. What is a sparse matrix? How to represent sparse matrix? Write the Abstract data type(ADT) of sparse
matrix.
(Cont…)
Cauvery Institute of Technology
Department of Computer Science and Engineering
2nd Internal Assessment
Sub: Data Structures with C sub-code: 10CS35 Date: 17-OCT-2015 Duration: 1 hour
Note: Answer any two questions from each part.
Part A
1. Write a program to read and search an element in sparse matrix. Use triples <row, column, value> to
represent an element in the sparse matrix.
2. What is a structure? How to declare a structure? What is a tagged structure? Explain with example.
3. What is a sparse matrix? How to represent sparse matrix? Write the Abstract data type(ADT) of sparse
matrix.
 Part B
4. Define Linked List. Write a function to count the no. of nodes in the SLL.
5. Explain how to reverse a SLL without using another list. Write the function to reverse a list.
6. Write a program to implement stack data structure using singly linked list.
7. Write function to insert a node to the left of key node in doubly linked list and delete a node from front
in DLL.

Part B
4. Define Linked List. Write a function to count the no. of nodes in the SLL.
5. Explain how to reverse a SLL without using another list. Write the function to reverse a list.
6. Write a program to implement stack data structure using singly linked list.
7. Write function to insert a node to the left of key node in doubly linked list and delete a node from front
in DLL.

Part B
4. Define Linked List. Write a function to count the no. of nodes in the SLL.
5. Explain how to reverse a SLL without using another list. Write the function to reverse a list.
6. Write a program to implement stack data structure using singly linked list.
7. Write function to insert a node to the left of key node in doubly linked list and delete a node from front
in DLL.

Part B
4. Define Linked List. Write a function to count the no. of nodes in the SLL.
5. Explain how to reverse a SLL without using another list. Write the function to reverse a list.
6. Write a program to implement stack data structure using singly linked list.
7. Write function to insert a node to the left of key node in doubly linked list and delete a node from front
in DLL.