Scribd
Upload
24 views

Data StructuresII

The document contains an assessment for a Data Structures with C course. It lists 7 questions over two parts (Part A and Part B) related to sparse matrices, linked lists, stacks, and doubly linked lists. Students are instructed to answer any two questions from each part. The questions cover topics like reading and searching a sparse matrix represented as triples, defining structures and sparse matrices, counting nodes in a singly linked list, reversing a linked list without an additional list, implementing a stack with a linked list, and inserting/deleting nodes from a doubly linked list.

Uploaded by

CAUVERY INSTITUTE OF TECHNOLOGY MANDYA
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
24 views

Data StructuresII

The document contains an assessment for a Data Structures with C course. It lists 7 questions over two parts (Part A and Part B) related to sparse matrices, linked lists, stacks, and doubly linked lists. Students are instructed to answer any two questions from each part. The questions cover topics like reading and searching a sparse matrix represented as triples, defining structures and sparse matrices, counting nodes in a singly linked list, reversing a linked list without an additional list, implementing a stack with a linked list, and inserting/deleting nodes from a doubly linked list.

Uploaded by

CAUVERY INSTITUTE OF TECHNOLOGY MANDYA
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

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.

You might also like