Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
75 views

Data Structures and Algorithms - CSE 102 Program List: Week 1

The document outlines a program list for a data structures and algorithms course. It includes 5 programming assignments: 1) Measuring time to insert and delete elements from arrays with adjustments for free spaces. 2) Simulating indexing for 1D, 2D arrays and lower triangular matrices. 3) Creating a sorting package for bubble, selection, insertion, quick and merge sort and comparing their time complexities. 4) Sorting sentences lexicographically. 5) Simulating insertion, deletion and display of nodes in a singly linked list.

Uploaded by

Abhir Bhandary
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
75 views

Data Structures and Algorithms - CSE 102 Program List: Week 1

The document outlines a program list for a data structures and algorithms course. It includes 5 programming assignments: 1) Measuring time to insert and delete elements from arrays with adjustments for free spaces. 2) Simulating indexing for 1D, 2D arrays and lower triangular matrices. 3) Creating a sorting package for bubble, selection, insertion, quick and merge sort and comparing their time complexities. 4) Sorting sentences lexicographically. 5) Simulating insertion, deletion and display of nodes in a singly linked list.

Uploaded by

Abhir Bhandary
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 1

Data Structures and Algorithms CSE 102 Program list

WEEK 1
1. Write a program to delete and insert elements into array and adjust the free spaces. Compare the time taken for various set of inputs. 2. Write program to simulate the indexing formula for : 1D array, 2D array and lower triangular matrix. 3. Form a software package of these sorting algorithms: Bubble sort, selection sort, insertion sort, quick sort, merge sort. Find out the time complexities for Best case, average case and worst case of each algorithm practically and theoretically. Then Compare the time complexities for Best case, average case and worst case(same set of inputs) among all the sorting algorithms and find the one which takes max and min time for sorting. 4. Sort n sentences in lexicographical order. 5. Write program to simulate (graphically) the insertion (front, rear and any position), deletion (front, rear and any position) and display of singly linked list.

You might also like