UNIVERSITY OF KERALA - Marian Engineering College

B.Tech Comp. Sc. & Engg., University of Kerala 41
08.407 DATA STRUCTURES LAB (R F) 0 – 0 – 4
Programming exercises in C based on the course 08.405 Data Structures and Algorithms.
The exercises may include the following:-
1. Representation of sparse matrix – addition, multiplication and transpose of sparse matrices
2. Use of multidimensional arrays and structures
3. Linked list – singly linked list, circular linked list, and doubly connected linked list and
application problems
4. String manipulation applications. Representation of polynomials, arithmetic operations on
polynomials
5. Implementation of stacks using arrays and linked lists. Application problems using stacks –
Maze problem, conversion between infix, postfix and prefix, expression evaluation etc.
6. Implementation of multiple stacks
7. Implementation of Queues using linked list and array – multiple Queues, Dqueues, priority
queue and applications of queues
8. Creation and traversals of binary trees – counting nodes, finding height etc.
9. Creation of binary search tree – searching an item, insertion and deletion of nodes etc.
10. Implementation of sorting and searching algorithms
Internal Continuous Assessment (Maximum Marks-50)
20 Marks - Tests (minimum 1)
20 Marks - Up-to-date lab work, problem solving capability, keeping track of rough record and fair record,
term projects, assignment-programming exercises, etc.
10 Marks - Regularity in the class
University Examination Pattern (Maximum marks – 100)
Marks should be awarded as follows:
20 Marks - Algorithm/Design.
25 Marks - Viva voce.
30 marks - Implementing the work/Conducting the experiment.
25 Marks - Output/Results and inference.
General instructions:
- Evaluation is a serious process that is to be conducted under the equal responsibility of both the internal and
external examiners.
- The number of candidates evaluated per day should not exceed 20