Scribd
Upload
20 views4 pages

FDS QB

The document outlines a series of assignments covering various topics in data structures, including definitions, algorithms, and comparisons of data structures such as arrays, linked lists, stacks, queues, trees, and graphs. Each unit contains specific tasks such as writing algorithms, explaining concepts, and creating data structures. The assignments aim to enhance understanding of data structure operations and their applications.

Uploaded by

atharvachikane2005
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
20 views4 pages

FDS QB

The document outlines a series of assignments covering various topics in data structures, including definitions, algorithms, and comparisons of data structures such as arrays, linked lists, stacks, queues, trees, and graphs. Each unit contains specific tasks such as writing algorithms, explaining concepts, and creating data structures. The assignments aim to enhance understanding of data structure operations and their applications.

Uploaded by

atharvachikane2005
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/ 4

Assignment - I

Unit 1: Introduction to Data Structures

1. Give the definition of data structure, some examples of data structure and
applications of it.
2. Define algorithm, time and space complexity and give time complexity of linear loop,
logarithmic loop, and quadratic loop.
3. Describe in detail Classification of Data structures.
4. Define the term algorithm and discuss the two design approaches of algorithm and
write an algorithm to find the larger of two numbers.

Assignment - II
Unit 2: Arrays and Linked List
1. Write the algorithm to insert an Element in the Middle of an Array.
2. Write the algorithm for inserting a Node at the Beginning of a Linked List.
3. Explain the concept of doubly linked list.
4. Make a comparison between a linked list and a linear array. Which one will you
prefer to use and when?
Assignment - III
Unit 3: Stack and Queues
1. Explain the push, pop operations with examples.
2. Explain the enqueue and dequeue operations in a queue.
3. What is the difference between stacks and queues in terms of their operations and
use cases?
4. Write the algorithm for queue insert and delete operations and explain these
operations with the help of example.

Assignment - IV
Unit 4: Trees

1. Explain in-order traversal with an example.


2. What is post-order traversal, and where is it used?
3. Create a binary search tree using the following data elements: 45, 39, 56, 12, 34, 78, 32,
10, 89, 54, 67, 81
4. State the properties of binary search tree and draw the binary search tree for the
numbers 39, 27, 45, 18, 29, 40, 54, 9, 21, 28, 36, 59, 10, 19, 65, 60.

Assignment - V
Unit 5: Graphs

1. What is a strongly connected graph? How is it different from a weakly connected


graph?

2. What is an adjacency matrix representation and adjacency list representation? ?


What are its advantages and disadvantages?

3. Consider the graph given below. And write the adjacency matrix of G.
4. What is the transitive closure of a directed graph? How is it useful?

Assignment - VI
Unit 6: Sorting and Searching

1. What is binary search? What are its advantages and limitations?


2. Discuss bubble sort in detail for this consider an array A[] that has the following
elements: A[] = {30, 52, 29, 87, 63, 27, 19, 54}
3. Explain the concept of quick sort with the help of following numbers.

4. Explain the concept of merge sort and show it using following example.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy