Scribd
Upload
18 views3 pages

Guidelines

The document outlines the syllabus for the B.Sc. Physical Science/Mathematical Science course, focusing on the Discipline Specific Elective - Data Structures (BSCS05A) with a total of 6 credits. It details various topics including arrays, stacks, queues, linked lists, recursion, and trees, along with references and practical programming assignments in C++. The practical list includes implementing sorting algorithms, searching techniques, and data structure operations using C++.

Uploaded by

Pankaj Kumar
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
18 views3 pages

Guidelines

The document outlines the syllabus for the B.Sc. Physical Science/Mathematical Science course, focusing on the Discipline Specific Elective - Data Structures (BSCS05A) with a total of 6 credits. It details various topics including arrays, stacks, queues, linked lists, recursion, and trees, along with references and practical programming assignments in C++. The practical list includes implementing sorting algorithms, searching techniques, and data structure operations using C++.

Uploaded by

Pankaj Kumar
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/ 3

Course Name: B.Sc.

Physical Science/ Mathematical Science


Paper Name: Discipline Specific Elective - (DSE) Data Structures (BSCS05A)
Credit: 6
Date: 18 July 2021

Unit Topic Sections Reference No. of


hrs
1 Arrays Ch-7 2 16
Single, Multi-dimensional, Sparse (7.1.1), (7.1.2), (7.1.3),
(7.1.4) and (7.4.1)

Sorting Ch-9 1
Bubble, Selection, Insertion, (9.1.1), (9.1.2), (9.1.3),
Merge, and Quick (9.3.3), and (9.3.4)

Searching Ch-7 3
Linear and Binary Page 387-388, 394
2 Stacks Ch-4 1 8
Implementing using array, (4.1)

Prefix, Infix and Postfix Ch-2 3


expressions, Application of stacks (2.3) (upto page 108)
for conversion of infix to prefix
and postfix expressions,
Evaluation of postfix expressions
3 Queues Ch-4 1 8
Implementing simple queue, (4.2), (4.3), and (4.6)
circular queues, priority queues
using array
4 Linked Lists Ch-3 1 12
Single, double, and circular (3.1), (3.2). and (3.3)
Implementing Stack and Queue Ch-4 (4.4), and (4.5)

5 Recursion Ch-5 1 8
Recursive solutions to simple (5.1), (5.2), (5.3), and (5.10)
problems and their
implementation, Advantages,
Limitations
6 Trees Ch-6 1 8
Introduction to tree as a data (6.1), (6.2), (6.4) (upto page
structure, binary trees, binary 230)
search tree- creation and traversal
techniques
*All portions are covered excluding analysis of algorithms
References
1. Drozdek, Adam (2019). Data Structures and Algorithms in C++ (4th edition). Cengage
Learning
2. Sahni, Sartaj (2011). Data Structures, Algorithms and Applications in C++ (2nd edition).
University Press
3. Tenenbaum, A. M., Augenstein, M. J., & Langsam, Y. (2009). Data Structures using C and
C++ (2nd edition). PHI.

Practical List
Implement the following programs in C++:

1. To sort the elements of an array using:


a. Bubble sort
b. Selection sort
c. Insertion sort
d. Merge sort
e. Quick sort.
2. To search an element using Linear Search in:
a. An array
b. A Linked List
3. To search an element in a sorted array using Binary Search.
4. Write a menu driven program to implement Stack data structure using (I) Array (II) Linked
Lists with the following operations:
a. push()
b. pop()
c. peek()
d. isFull()
e. isEmpty()
f. display()
5. Using a stack data structure:
a. Convert infix expression into prefix expression
b. Convert infix expression into postfix expression
c. Evaluate postfix expression
6. Write a menu driven program to implement Queue data structure using (I) Array (II) Linked
Lists with the following operations:
a. enqueue()
b. dequeue()
c. peek()
d. isFull()
e. isEmpty()
f. display()
7. Write a menu driven program to implement Circular Queue using array with the following
operations:
a. insert() Or enqueue()
b. delete() Or dequeue()
c. isFull()
d. isEmpty()
e. display()
8. Implement solutions to the following problems using recursion:
a. Tower of Hanoi
b. Fibonacci series

You might also like