Scribd
Upload
17 views

Lab Manual 13

The document outlines an open-ended lab experiment on analyzing the running time of various sorting algorithms. Students are asked to create a table and graph showing the execution time of bubble sort, insertion sort, selection sort, heap sort, binary search tree, merge sort and quicksort on random inputs of varying sizes from 1 to 10 million elements. The output and assessment rubric are also included.

Uploaded by

obaid ur rehman
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
17 views

Lab Manual 13

The document outlines an open-ended lab experiment on analyzing the running time of various sorting algorithms. Students are asked to create a table and graph showing the execution time of bubble sort, insertion sort, selection sort, heap sort, binary search tree, merge sort and quicksort on random inputs of varying sizes from 1 to 10 million elements. The output and assessment rubric are also included.

Uploaded by

obaid ur rehman
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

COLLEGE OF ENGINEERING & TECHNOLOGY

UNIVERSITY OF SARGODHA

CE 416: Data Structure and Algorithms

Lab 13 Manual
Open Ended Lab

Instructor & Demonstrator: Engr. Nauman Ahmad Tariq

Student Name

Roll No.

Date Performed

Marks obtained

Instructor Signature
CLO-1 Illustrate understanding of key concepts of Data structures
and Algorithms using Dev C++ Platform
CLO-2 Design a programming application by applying concepts of
Data Structures and algorithms leading to the solution of a moderate
scale-programming problem.
CLO-3 Write lab notes, effective communication and the analysis of
the given problem to perform in the laboratory environment.
CLO-4 Demonstrate involvement in the Project as a team or
individually with respect to the contribution.

OBJECTIVE:
Objective of this experiment is to design, develop and implement a C++ program that analyzes the
running time of all the sorting algorithms for a random input of specific sizes.

ABOUT THE EXPERIMENT:


The sorting algorithms covered in the course i.e., bubble sort, quicksort, binary search tree, heapsort,
insertion sort, selection sort and merge sort, all have different time complexities. All the algorithms will
have different execution time to sort a random input of a specific size. Students are to create a table and a
graph of the execution time of the respective algorithms for a random input of the sizes 1million, 2.5
million, 5 million, 7.5 million and 10 million elements for all the algorithms.

Sorting Execution Time


Algorithm 1 million 2.5 million 5 million 7.5 million 10 million
Elements Elements Elements Elements Elements
Bubble Sort
Insertion Sort
Selection Sort
Heap Sort
BST
Merge Sort
Quick Sort
C++ Program Code:

OUTPUT:
Assessment Rubric for Lab 13
Method of Evaluation: Lab report.

Outcomes Assessed:

CLO-1 Illustrate understanding of key concepts of Data structures and Algorithms using Dev
C++ Platform.
CLO-2 Design a programming application by applying concepts of Data Structures and
algorithms leading to the solution of a moderate scale-programming problem.
CLO-3 Write lab notes, effective communication and analysis of the given problem to
perform in the laboratory environment.
CLO-4 Demonstrate involvement in the Project as a team or individually with respect to the
contribution.

Performance 5 Excellent 4 Good 3 Satisfactory 2-1 Needs Marks


Improvement
Realization of Fully understand Close to fully Partially Unable to
Experiment & able to illustrate understand & able understands & understand & able
CLO-1 rationale behind to illustrate able to illustrate to illustrate
different execution rationale behind rationale behind rationale behind
time of all the different execution different execution different execution
algorithms time of all the time of all the time of all the
algorithms algorithms algorithms
Conducting Completely able to Close to Partially able to Unable to
Experiment successfully completely able to successfully successfully
CLO-2 design and successfully design and design and
compile C++ design and compile C++ compile C++
programs for all compile C++ programs for all programs for all
the algorithms programs for all the algorithms the algorithms
the algorithms
Data Collection Completely Close to Partially Unable to
and Data Analysis understand & able completely understand & able understand & able
CLO-3 to demonstrate understand & able to demonstrate to demonstrate
syntax of all the to demonstrate syntax of all the syntax of all the
algorithms syntax of all the algorithms algorithms
algorithms

Individual/Team Completely able to Close to Partially able to Unable to execute


Work execute different completely able to execute different different programs
CLO-4 programs for all execute different programs for all for all the
the algorithms programs for all the algorithms algorithms
the algorithms

Total

You might also like