BSC CSIT Semester 3 – Data Structure and Algorithms () Questions & Answers | Past TU Exam Papers

Question 1

Trace selection sort algorithm with array of numbers 2, 81, 6, 45, 11, 21, 23, 41, and 11.

Marks: 5

Year: 2080 Final TU

Selection Sort – Definition Selection Sort is a simple comparison-based sorting algorithm that repeatedly selects the smallest element from the unsorted part of the array and places it at the correct

Question 2

Write a program to implement insertion sort.

Marks: 5

Year: 2080 Final TU

Definition Insertion Sort is a simple comparison-based sorting algorithm that builds the final sorted array one element at a time. - It is similar to the way we arrange playing cards in hand. - Best

Question 3

Sort the number {82, 73, 12, 39, 26, 88, 2, 9, 60, 41} using shell sort.

Marks: 5

Year: 2081 Final TU

1. Definition of Shell Sort Shell Sort is an improved version of Insertion Sort that allows comparison and swapping of elements far apart. - It sorts elements by using a gap sequence. - The gap

Question 4

Sort the numbers 82,73,12,39,26,88,2,9,60,41 using shell sort.

Marks: 5

Year: 2079 Final TU

Shell Sort 1. Definition Shell Sort is an improved version of Insertion Sort that allows the exchange of elements far apart by using a sequence of gaps. The gap is reduced step by step until it bec

Question 5

In which case the position of pivot element in quick sort always either in the last or the first position? Create a max heap from the numbers. {10,12,53,34,23,77,59,66,5,8}

Marks: 5

Year: 2079 Final TU

Part A: Pivot Position in Quick Sort Definition Quick Sort is a divide-and-conquer sorting algorithm that selects a pivot element and partitions the array around it. Case When Pivot is Always First

Question 6

Hand test selection sort with array of numbers 4, 71, 32, 19, 61, 2, -5 in descending order.

Marks: 5

Year: 2078 Final TU

Step 1: Definition Selection Sort is a simple comparison-based sorting algorithm: - It repeatedly selects the maximum (or minimum) element from the unsorted part and places it in the correct positio

Question 7

Hand test bubble sort with array of numbers 53, 42, 78, 3, 5, 2, 15 in ascending order.

Marks: 5

Year: 2077 Final TU

1. Definition of Bubble Sort Bubble Sort is a simple comparison-based sorting algorithm that repeatedly compares adjacent elements and swaps them if they are in the wrong order. After each pass, the