Scribd
Upload
15 views1 page

Tutorial 2 DS

The document outlines an assignment for a B.Tech Computer Science course at Ashoka Institute of Technology and Management, focusing on Data Structures. It includes a list of questions covering sorting algorithms, tree structures, and graph theory, with specific marks assigned to each question. The assignment is due on December 19, 2024, and was given on December 5, 2024.

Uploaded by

sd4662385
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
15 views1 page

Tutorial 2 DS

The document outlines an assignment for a B.Tech Computer Science course at Ashoka Institute of Technology and Management, focusing on Data Structures. It includes a list of questions covering sorting algorithms, tree structures, and graph theory, with specific marks assigned to each question. The assignment is due on December 19, 2024, and was given on December 5, 2024.

Uploaded by

sd4662385
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/ 1

Ashoka Institute of Technology and Management

Ashoka Engineering Chauraha Paharia, Sarnath, Varanasi-221007 (U.P), INDIA


Phone No: +91-9198840005 Email: [email protected] Fax: +91-542-2582255
(Affiliated to Dr. A.P.J. Abdul Kalam Technical University & Board of Technical Education, Lucknow)
(Approved by AICTE & PCI, New Delhi)
AKTU-641 BTE-4186

ASHOKA INSTITUTE OF TECHNOLOGY AND MANAGEMENT,VARANASI


Ashoka Engineering Chauraha, Paharia, Sarnath, Varanasi-221007 (U.P), INDIA

TUTORIAL 2
Course & Branch:B.Tech/Computer Science & Subject Name: DATA STRUCTURE
Engineering
Semester: III Sem Subject Code:BCS-301
Assignment Given on-5/12/2024 Assignment Submission Date -19/12/2024
Name of the Faculty –Dicksha Sharma Session: 2024-25
S. No. Questions Marks CO BL
Note: Attempt all questions. Each question carries equal mark.
1(a) Explain what is ideal sorting algorithm? 1 3 K1
1(b) What is meant by to Sort in Place? 1 3 K2

1(c) Sort a Stack Using Recursion. 1 3 K2

1(d) Which Sort algorithm work best on mostly Sorted data? 1 3 K1

1(e) What is the best sorting algorithm for large datasets? 1 3 K1

2(a) Compare Binary tree and binary search tree. 1 4 K3

2(b) What is the signification of the degree of the node in a tree? 1 4 K1


Compare Array and a Tree. 1 4 K2
2(c)
2(d) Define Tree and internal node in a tree. 1 4 K1

How would you fine the maximum path sum in a binary tree. 1 4 K1
2(e)
3(a)
Define Euler Path And Euler Circuit In A Graph Theory. 1 5 K3

3(b) Describe common graph types 1 5 K1

3(c) Compare DFS and BFS algorithms: strengths, weaknesses, and use 1 5 K2
cases.

3(d) How can you determine the shortest path in a directed acyclic graph 1 5 K4
(DAG)?

3(e) What is the difference between directed graph and non-directed 1 5 K1


graph?

You might also like