Scribd
Upload
80 views2 pages

CS3301 As01

This document contains instructions for Assignment 1 for the course Data Structure and Programming CS3301. It outlines 10 tutorials with 3 questions each, for a total of 30 questions worth 1 mark each. Students have 1 hour to complete the assignment, which covers fundamental data structures and algorithms topics like arrays vs linked lists, sorting algorithms, trees, hashing, and more.

Uploaded by

Himanshu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
80 views2 pages

CS3301 As01

This document contains instructions for Assignment 1 for the course Data Structure and Programming CS3301. It outlines 10 tutorials with 3 questions each, for a total of 30 questions worth 1 mark each. Students have 1 hour to complete the assignment, which covers fundamental data structures and algorithms topics like arrays vs linked lists, sorting algorithms, trees, hashing, and more.

Uploaded by

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

QUANTUM UNIVERSITY

Campus:-Mandawar,22KmMileStone,Roorkee -DehradunHighway(NH-73)
ROORKEE-247667(Uttarakhand, INDIA)

Data Structure and Programming CS3301


ASSIGNMENT: 1

General Instructions: sub code :CS3301


All questions are compulsory.

1. All questions carry 1 marks each.


2. Students are expected to take about 4-minute each for all questions

Time: 1 Hr Max
Marks: 30

Each question Caries 1 marks. (1X30 = 30)

TUTORIAL -01
1. Differentiate between Array and Linked list.
2. Difference between Linear and Non - Linear data structure.
3. Explain the Tower Of Hanoi.
TUTORIAL -02
1. Define any infix to postfix expression.
2. Using Row measure and Column measure solve any 2D Array question.
3. Define Linked list and its types.
TUTORIAL -03
1. Define Binary Search Tree (BST).
2. Define AVL Tree.
3. Define all Tree Traversal.
TUTORIAL -04
1. Define Stack and its Algorithm.
2. Define Binary Tree and its applications.
3. Define Queue and its Algorithm.

TUTORIAL -05
1. Define the Bubble Sort Algorithm with example.
2. Define Linear Search with Algorithm and its examples.
3. Define Binary Search and its Algorithm.

TUTORIAL -06
1. Define Radix Sort Algorithm and its Example.
2. Define Quick Sort Algorithm with example.
3. Define Selection Sort Algorithm and its Example.
TUTORIAL -07
1. Define Hip Sort Algorithm and its example.
2. Define Insertion Sort Algorithm with example.
3. Define Merge Sort Algorithm with example.

TUTORIAL -08
1. Differentiate between Linear and Binary Search.
2. Define Dijkstra’s Algorithm (Single Sort Path Algorithm).
3. Define Fluid Parcel.
TUTORIAL -09
1. Difference between Dijkstra’s Algorithm and Fluid Parcel Algorithm.
2. WAP to Inserting the node at the starting ,middle and end of the Linked list.
3. WAP to Deleting the node at the starting ,middle and end of the Linked list.
TUTORIAL -10
1. Define Hashing Table in detail.
2 . Define Hash Table in detail.
3. Polynomial representation using Generalised Linked list.

You might also like