Scribd
Upload
25 views3 pages

Front Pages

The document outlines the course objectives and outcomes for a Data Structures course at Acropolis Institute of Technology & Research, focusing on various data structures, algorithms, and their applications. It also includes a comprehensive list of assignments designed to evaluate students' understanding of the subject matter, covering topics such as arrays, linked lists, trees, graphs, and sorting algorithms. Each assignment consists of specific questions and tasks aimed at enhancing students' analytical and problem-solving skills in data science.

Uploaded by

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

Front Pages

The document outlines the course objectives and outcomes for a Data Structures course at Acropolis Institute of Technology & Research, focusing on various data structures, algorithms, and their applications. It also includes a comprehensive list of assignments designed to evaluate students' understanding of the subject matter, covering topics such as arrays, linked lists, trees, graphs, and sorting algorithms. Each assignment consists of specific questions and tasks aimed at enhancing students' analytical and problem-solving skills in data science.

Uploaded by

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

Acropolis Institute of Technology & Research, Indore

Department of Computer Science & Engineering (Data Science)

Course Objectives and Outcomes


Course Objective

1. To Analyze and Understand Different types of data structures like arrays and its application.
2. To Evaluate Stacks, Queues and their different applications like infix to postfix conversion.
3. To Analyze different Tree, Type of tree like AVL Tree, B Tree and their applications.
4. To Solve problems involving Graphs data structures and different Graph traversing algorithms.
5. To Analyze different Searching and Sorting Algorithms and hashing algorithms.

Course Outcomes

At the end of the course student will be able to:

1. Students will be able to understand basic data structures such as arrays, strings, and linked lists.
2. Students will be able to evaluate Stacks, Queues and their different applications like infix to
postfix conversion.
3. Students will be able to analyze different Tree data structures and its applications.
4. Students will be able to solve problems involving Graphs data structures and different Graph
traversing algorithms.
5. Students will be able to analyze different Searching and Sorting Algorithms and hashing
algorithms.
Acropolis Institute of Technology & Research, Indore
Department of Computer Science & Engineering (Data Science)

List of Assignments
Data Structure (CD-303)

Date Faculty
S. of Sign
Questions
No Subm with
ission date.
Assignment No. 1

1 What is Data structure ? Write a brief note on classification of data structure.


Write a brief note on the following :
2 (i) Data structure operations,
(ii) Asymptotic Notations.
What do you mean by algorithmic complexity ? Explain Time complexity and space complexity in
3
brief.
What do you mean by Array? Describe the storage structure of Array. Also Explain various types
4
of Array in detail
How is physical memory allocated for a two-dimensional array? Calculate amount required to
store this array and the accessing function for it. If each element of an array D [20] [50] requires 4
bytes of storage, base address of D is 2000 determine the location of D[10] [10], when the array is
5
stored as :
a. Row major
b. Column major
6 What is a circular linked list? What operations can you perform on circular linked lists?
Define doubly linked list. Describe an algorithm to insert an element at the beginning of the doubly
7 linked list. Describe an algorithm to delete an element from the end of a doubly linked list. Also
explain the advantages and disadvantages of doubly linked lists.
Assignment No. 2
Solve the following recurrence relation to find big-oh notation.
(i) T(n) = T(n-1) + 1, with T(1) = 1
8
(ii) T(n) = T(n/2) + 1, with T(1) = 0
(iii) T(n) = 2T(n/2) + n, with T(1) = 0
9 What are Stack Data Structures? Explain its operations in brief.
Write an algorithm which reverses the order of elements of stack using one additional stack and
10
some additional variables?
Convert the following infix expression to a prefix expression.
11 (i) A^B*C-D+E/F/(G+H)
(ii) (A+B)*(C^(D-E)+F)-G
12 Write an algorithm to enque and deque an element in a queue?
How do you implement a circular queue in C using arrays? Write routines to implement operations
13
for it.
Acropolis Institute of Technology & Research, Indore
Department of Computer Science & Engineering (Data Science)
Assignment No. 3
The in-order and pre-order traversal sequence of a node in a binary tree are given below:
In-order : E A C K F H D B G
14
Pre-order: F A E K C D H G B
Draw the binary tree. State briefly the logic used to construct the tree.
Explain the Binary Search Tree with an example. Make a Binary Search Tree for the following
sequence of numbers, show all steps:
15
45, 32, 90, 34, 68, 72, 15, 24, 30, 66, 11, 50, 10. Also, delete 45, 90 and l1 (successively).
Also, write an algorithm to insert an element into a Binary Search Tree.
Define Huffman tree and describe an algorithm to create a Huffman tree. Construct a Huffman
16
Tree for data structures with its optimal code.
Define AVL Trees. Explain its rotation operations with example. Construct AVL Tree by inserting
17
the following data: 14, 17, 11, 7, 53, 4, 13, 12, 8, 60, 19, 16, 20
What is a red black tree? Discuss the properties of red black tree in detail. Also show the insertion
18
using following sequence of numbers, show all steps: 145, 332, 290, 034, 568, 372, 215,
Construct a B-Tree of order 3 for the following set of input data: 69, 19, 43, 16, 25, 40, 132, 100,
19
145, 7, 15, 18.
Assignment No. 4
21 What do you understand about graphs? How is the graph represented in memory?

22 Differentiate between Depth first search and Breadth first search algorithm?

23 Explain Kruskal’s algorithm for shortest path with the help of suitable examples.

24 Explain Prim’s algorithm for minimum spanning tree with an example.

25 Find the shortest path for a to f using Dijikstra’s Algorithm.


Assignment No. 5
Write the algorithm to create a heap and sort the following elements using heap sort: 12, 8, 10, 6,
26
4, 10, 6,11,9, 8, 14, 1, 2
Sort the following data in ascending order using Quick
27
9, 4, 12, 6, 5, 10, 7, 8
What do you understand by merge sort? Write the algorithm to sort using merge sort. Take an
28
example to explain your answer.
Apply Binary Search to find 123 in the following list:
29
49, 98, 101, 123, 149, 194, 199, 211, 240, 286, 840, 930
30 Define hash function. Discuss various methods used for resolving hash collisions.
Given the values {2341, 4234, 2839, 430, 22, 397, 3920} a hash table of size 7and a hash function
h(x) =x mod 7, show the resulting table after inserting the values in the given order with each of
the following collision strategies.
31
i) separate chaining
ii) linear probjng
ii) double hashing with second hash function h, (x) = (2r-1) MOD 7

You might also like