Programme Code: B.Sc.

Programme Title: Computer Science

Course Code: 23UACSO5 Course Title: Batch: 2023

Total Hours: 60
Data Structures Semester:
(Common for IT, CT, CS, Al&DS, BCA) Credits: 40

22

Course Objective
The course aims
To determine various data structures such as stacks, queues, arrays and lists.
To understand and evaluate prefix, infix and postfix expresion formats.
To know about different types of sorting.
Course Outcomes (Co)
On the successful completion of the course, students will be able to
Knowledge CO Course Outcome
Level Number
K2, K4 CO1 Gain knowledge on data structure operations and algorithms.
K4 CO2 |Analysesearching techniques.
K2 CO3 Deseribe stack, queues and linked list operations.
KI, K3 CO4 Have knowledge of tree and graph concepts.
K1, K2 COs Illustrate types of sorting algorithms.
KI - Remember; K2 - Understanding: K3 Apply; K4- Analyze; K5- Evaluate
SYLLABUS
No. of
Unit Content
Hours
Introduction Basic Terminology: Elementary Data Organization Data

I Structures Data Structures Operations Preliminaries Mathematical Notation 12

and Functions Algorithmic Notation - Control Structure - Complicity of
Algorithms -Other Asymptotic Notations for Complicity by Algorithms.
Arrays, Records and Pointers: Introduction Linear Arrays Representation by
Linear Arrays in Memory - Traversing Linear Arrays - Inserting and Deleting
Linked List: Introduction Representation of Linked List in Memory - Traversing 12
Linked List - Searching a Linked List - Memory Allocation* Insertion into a
Cinked List - Deletion from a Linked List.
STACKS, Queues, RECURSION: Introduction Stacks Arrays Representation
of Stacks - Linked Representation of Stacks - Arithmetic Expression - Polish 12
Notation -Quick Sort, an Application of Stacks- Recursion*- Towers of Hanoi
-Queues -Linked Representation of Queues
TREES: Introduction - Binary Trees - Representing Binary Trees in memory
IV Traversing Binary Trees - Traversal Algorithms using Stacks - Graphs and their 12
Applications - Graph theory Terminology - Sequential
Warsball'sAloikesentation of Graphs:
Adia
Odcency matrix, pathmatrix, Paths
Sorting and searching: Introduction - Sorting Insertion Sort- Selection Sort
Merging - Merge Sort - Radix Sort - Searching and Data Modification 12
Hashing.
- Self study>

Text Book:
Seymour Lipschutz, GA Vijayalakshmi Pai, Data Structures" Tata McGraw HILL, Fourth Edition,
2006. (Unit I V)
Reference Books:
1. Alfred V.Aho, John E. Hopcroft, Jeffrey D.Ulman, Data Structures and Algorithms" Pearson
Education, First Edition, 2005.
23

2. Ellis Horowitz, Saartaj Sahni, Fundamentals of Data Structures", Galgotia Book Source, Fourth
Edition, 1978.
3. Debasis Samanta, "Classic Data Structures, PHI, Second Edition, 2009.
E-references:
1. https://www.javatpoint.com/data-structure-tutorial
2. https://www.programiz.com/dsa
3. https://www.slideshare.net/PsEditor/data-structures-17664936

Mapping with Programme Specific Outcomes

PSO
PSO1 PSO2 PSO3 PSO4 PSOS
Co
CO1 S M

C02 S M H S
 7
7

4 1

S
15

a) Draw the procct network.

variance ol each activity
b) Ind the expcted duration and times for cach cvent. What is the expected projcct
length?
c) Caleulate carly and late occurrence

Reg No.
SNe. I31 IBAT:2017 &2018

END OF SEMESTER NAMINATIONS, DECEMDER - 2020

SUUECTCODE: 0SUACSOG
MAOR LS.. (CS
SEMESTILR I
iOURS MALARKS : 75

SECTION-A(5X2-10)
Answer ALL the Onestions:

Define ordered list.

2 What s Qucuc
1 Define Irec
4. Whatis an AOV-Network?
$ Define Keys

SECTION-I (SX4-20)
Answer ALL the Ouestions:

6. a) Write short note on SPARKS

(OR)
b)Mention the different operations performed on Ordered Lists.
7. a) Explain about operations on Stack,
(OR)
b) Give brief note on Multiple Stacks and Queues.
8. a) Create an algorithm to insert a node into the Singly Linked List.
(OR)
by Explain Binary Tree Iraversal with example
9. a) Describe about Graph.
(OR)
b) Explain about how to deternine the minimum cost Spanning Iree of agraph using
Kruskal's Algorithm.
10. a) Write an Algorithm for Binary Search.
(OR)
b) Explain lHcap Sort with cxample.
SECTION -C3X I5-45 )

Answet anx THIREE Questions;

11 Discuss about Representation of Arrays

12 Write an Algorithm for coversion of an Infix expression to Postfix expression.
13 Discuss n detanl ahout lhreaded Binary Iree
14 Brnefly eyplan ahout lopolgscal Sorting in detail.
15 Explatn Merge Sort Algorithm with exa1ple

24
Reg.No.

MAJOR: B.Sc., (CS)

TIME :3 I10URS
S.No, 246 BATCII: 2017 - 2018

END OF SEMESTEREXAMINATIONS, DECEMIBER- 2020

MICROPROCESSORS AND ASSEMBLY LANGUAGE. PROGRAMMING
SUBJECT CODE: OSUA CS07
J
SEMESTER
MAX.MARKS:75

SECTION -A(5x 2 = 10)

Answer ALL Questions:
1. Conment on the role of memory interfacing.
2 How is looping statcment significant?
3. Comprehend the term segment.
4. ighlight the concept of data communication.
S. Comparc I6 bit witlh 32 bit micioprocessors.
SECTION -B(5x 4= 20)
Answer ALL Questions:
6. a) Evaluatc the various instructions in microprocessor.
 Vo
7:22 PM|0.8KB/s llll wiFi D 89%

t DOC-202403.. Q
b)Daabase scenariOs and distributes scenarios
c) Arranging books on a library shelf
d) Real -time system
..2..

1ENan the vanusINNofolSwure

1a11w Tavsal inu aav n data stiwaIs
(ORY

i8 a) Explain an Array Reesnatien of Sac.

(OR)
HIik thelin Reesntation oeueues

19 aClassify the diterentnavs ofwyesening binary Tiw in Memery.

(ORI
) 1 i he iah and Muli cirph with xanple
0 a) Talain the Selwin stith Algoith1m.
(OR)
) Deserilv the Radix SoHt with xanple.
SCTON-C3N 10-30)
Answ er auy lhrw questioN:
1Eeidate the Mathemtical Notation and netions.
*Discs alt itstuing nie into a l inhed l ist with Aigithm.
Fhuciate the Quick sot with evmple.
:4. Disctss alvnt the thw walsof laeising binary live with examle.
3 Sunnarise the Mtege sotalgoithn witlh an example.

.No.:
S. No.: )8 2 IBATCIH: 260B- 2-0l6, 2o)9
5. The Operating System of a Computer may periodically collect all the deleted storage. Any Technique whi
this collection is called
a) Memory b) Block c) Files d) Garbage collection
6. A linear collection of data elements where the linear node is given by means of Pointer is
Called
a) Linear list b) Node list c) Primitive list d) None of these
7. In a stack, if a user tries to remove an element from empty stack it is called
a) Underflow b) Empty collection c) Overflow d) Garbage collection
8. A Queue follows
a) First in First out b) Last in First out c) Ordered array d) Linear Tree
9.
Circular
a) Ring er
is also known as
b) Square Buffer c) Rectangle Buffer d) Curve Buffe
10. Traversing a Binary tree fist Root and then Left and Right sub trees called traversal
a) Post order b) Pre order c) In order d) Search Order

11. The maximum degree of any vertex in a simple graph with N vertices is
a) n b) n-1 c) n+1 d) 2n-1
12. An undirected Graph G which is connected and acyclic is called
a) Bipartite graph b) Cyclic Graph c) Tree d) Forest
13. Merge Sort uses
a) Divide and Conquer b) Backtracking
c) Heuristic Approach d) Greedy Approach
14. What is the worst case complexity of selection sort?
a) O (n log n) b) O(log n) c) O(n) d) On')
15. Which of the following Sorting algorithms has the lowest. Worst case complexity?
a) Merge Sort b) Bubble Sort c) Quick Sort d)Selection Srt

SECTION-B_ (5x5= 25)

Answer ALL the questions:
16. (a) Enumerate the Data Structure Operations with an Example.
(OR)
(b) Illustrate the Mathematical Notations and Functions with suitable Example.
17. (a) Discuss about the Operations Performed on an Aray.
(OR)
(b) Explain about Memory Allocation and Garbage Collection.
2..

12/

18. (a) Analyze the concept of Arithmetic Expressions.

(OR)
(b) Discuss about Recursion.
19. (a) Elucidate the Concept of Traversing Binary Trees.
(OR)
(b) What are the different ways to Represent Binary Trees in Memory?
20. (a) Discuss about Selection Sort.
(OR)
(b).Enumerate the Concept of Radix Sort with suitable Example.
SECTION-C(3x10 =30)
Answer Any THREE questions:
21. Discuss in detail about Control Structures.
22. Explain about Linked List and its Operations.
23. Elucidate the Concept of Stacks.
24. Briefly explain about the Sequential Representation of Graphs.
25. Describe about Hashing with Example.