Scribd
Upload
716 views1 page

DSA Lab Syllabus

The document outlines the syllabus for the Data Structures and Algorithms Lab course for second year computer science engineering students. It includes 10 contents covering topics like array storage concepts, simulating stacks, queues, linked lists using arrays and pointers, binary trees, sorting algorithms, and graph traversals using adjacency matrices and lists. Students will implement basic operations on these data structures and analyze their time complexities. The course aims to help students understand various abstract data types and analyze the efficiency of different algorithms.

Uploaded by

ravi sharma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
716 views1 page

DSA Lab Syllabus

The document outlines the syllabus for the Data Structures and Algorithms Lab course for second year computer science engineering students. It includes 10 contents covering topics like array storage concepts, simulating stacks, queues, linked lists using arrays and pointers, binary trees, sorting algorithms, and graph traversals using adjacency matrices and lists. Students will implement basic operations on these data structures and analyze their time complexities. The course aims to help students understand various abstract data types and analyze the efficiency of different algorithms.

Uploaded by

ravi sharma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

RAJASTHAN TECHNICAL UNIVERSITY, KOTA

Syllabus
II Year-III Semester: B.Tech. Computer Science and Engineering

3CS4-21: Data Structures and Algorithms Lab


Credit-1.5 Max. Marks :100 (IA:60, ETE:40)
0L+0T+3P

SN CONTENTS
Write a simple C program on a 32 bit compiler to understand the concept of
array storage, size of a word. The program shall be written illustrating the
1 concept of row major and column major storage. Find the address of element
and verify it with the theoretical value. Program may be written for arrays up to
4-dimensions.
Simulate a stack, queue, circular queue and dequeue using a one dimensional
2 array as storage element. The program should implement the basic addition,
deletion and traversal operations.
Represent a 2-variable polynomial using array. Use this representation to
3 implement addition of polynomials

Represent a sparse matrix using array. Implement addition and transposition


4
operations using the representation.
Implement singly, doubly and circularly connected linked lists illustrating
5 operations like addition at different locations, deletion from specified locations
and traversal.
6 Repeat exercises 2, 3 & 4 with linked structure.
7 Implementation of binary tree with operations like addition, deletion, traversal.
Depth first and breadth first traversal of graphs represented using adjacency
8
matrix and list.
9 Implementation of binary search in arrays and on linked Binary Search Tree.
Implementation of different sorting algorithm like insertion, quick, heap, bubble
10
and many more sorting algorithms.

Syllabus of 2nd Year B. Tech. (CS) for students admitted in Session 2021-22 onwards. Page 8

You might also like