Scribd
Upload
3 views

DataStruct_6thct2DataStructures

The syllabus for the Data Structures course at Cluster University Srinagar outlines the curriculum for 6th semester Computer Applications majors, focusing on linear and non-linear data structures, sorting algorithms, and graph traversal techniques. Students will gain practical experience through programming assignments in C, covering topics such as arrays, stacks, queues, linked lists, trees, and graphs. The course aims to develop implementation skills, algorithm analysis capabilities, and problem-solving techniques related to data structures.

Uploaded by

sidiqui777
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
3 views

DataStruct_6thct2DataStructures

The syllabus for the Data Structures course at Cluster University Srinagar outlines the curriculum for 6th semester Computer Applications majors, focusing on linear and non-linear data structures, sorting algorithms, and graph traversal techniques. Students will gain practical experience through programming assignments in C, covering topics such as arrays, stacks, queues, linked lists, trees, and graphs. The course aims to develop implementation skills, algorithm analysis capabilities, and problem-solving techniques related to data structures.

Uploaded by

sidiqui777
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/ 2

CLUSTER UNIVERSITY SRINAGAR

SYLLABUS (FYUP UNDER NEP - 2020)


Offered by Department of Computer Applications
Semester 6th (Major Course – CT2)
Title: Data Structures
Course Code: UGCOA22J602 Max. Marks: 150
Credits: 6 (Theory: 4, Practical: 2) Theory External: 80; Min Marks: 32
Contact Hrs: 120 (Theory: 60, Practical: 60) Theory Internal (Continuous Assessment): 20 Marks, Min Marks: 08
Practical Experimental Basis= 30, Min. Marks: 12
Practical Experimental (Continuous assessment) = 20, Min. Marks: 08
Course Objectives:
This Data Structures course equips 5th semester Computer Applications majors with fundamental programming concepts.
Students will explore linear data structures like arrays, stacks, queues, and linked lists, implementing them and their
operations in C. They'll then delve into sorting algorithms and explore non-linear structures like trees and graphs, including
graph traversal algorithms like BFS and Dijkstra's shortest path.

Course Outcomes:
1. Understanding Basic Data Structures: Become familiar with fundamental data structures such as arrays, linked lists,
stacks, queues, trees, and graphs.
2. Implementation Skills: Learn how to implement these data structures in a programming language, which is crucial for
developing efficient software.
3. Algorithm Analysis: Gain the ability to analyze the performance characteristics of algorithms, including time and space
complexity.
4. Problem-Solving Techniques: Develop the skills to choose and design appropriate data structures for solving specific
problems.

UNIT 1: (15 Hrs)


Introduction to data structure (Linear, Non-Linear, Primitive, Non-Primitive), Data Operations, Algorithm Complexity: Time
and Space Complexity.
Single dimensional array and its operations (Searching, traversing, inserting, deleting), Two-Dimensional array, Addressing,
Sparse Matrices, recursion.
Searching Algorithms: Linear Search, Binary Search and their Comparison.

UNIT 2: (15 Hrs)


Array Sorting Algorithms: Selection sort. Insertion sort, Bubble Sort, Quick sort.
Stack: Definition & Concepts, Array Representation of Stack, Operations on Stack. Applications of Stack: Expressions and
their representation: Infix, Prefix, Postfix and their conversions & evaluation.
Queue: Definition & Concepts, Array Representation of Queue, Operations on Queue, Circular Queue, Applications of
Queue.

UNIT 3: (15 Hrs)


Introduction to Linked Lists and their applications: Singly linked list: Definition & Concepts, representation in memory,
operations on singly linked list (insertion, deletion, traversal, reversal). Creation and Traversal of Doubly linked list & circular
linked list.
Linked list implementation of Stack and Queue.

UNIT 4: (15 Hrs)


Trees: Introduction to trees. Binary Trees, Binary tree representation and traversals (in-order, pre-order, post-order), Binary
Search Tree, Applications of trees.
Graphs: Introduction, terminology, linked and matrix representation. Traversing a Graph: BFS, DFS. Dijkstra’s Shortest Path
Algorithm. Applications of graphs.

Practical/Lab Course- (2 Credits, 60 Hrs.)


1. Write a Program to demonstrate the concept of one-dimensional array.
2. Write a Program to insert and delete element in an array.
3. Write a Program to Search an element using sequential search
4. Write a Program to Search an element using binary search
5. Write a Program to Add two 2-D Matrices
6. Write a Program to multiply two 2-D Matrices
7. Write a Program to read a 2-D Matrix and create its equivalent sparse representation.
8. Write a Program to add two sparse matrices.
9. Write a Program to implement recursion (factorial)
10. Write a Program to arrange the list of numbers using Bubble Sort
11. Write a Program to arrange the list of numbers using Insertion Sort
12. Write a Program to arrange the list of numbers using Selection Sort.
13. Write a Program to arrange the list of numbers using quick sort.
14. Write a Program to implement stack operations using array.
15. Write a Program to implement basic operations on queue.
16. Write a Program to implement a circular queue.
17. Write a Program to convert infix expression to its postfix form using stack operations.
18. Write a Program to evaluate the given postfix expression using stack operations.
19. Write a Program to create a singly linked list and perform operations such as insertions and deletions.
20. Write a Program to reverse a singly linked list.
21. Write a Program to implement stack and its operations using linked representation.
22. Write a Program to implement queue and its operations using linked representation.
23. Write a Program to implement basic operations on doubly linked list.
24. Write a Program to implement basic operations creation of Binary Search tree.
25. Write a Program to implement basic operations insertion, search, find min and find max on
Binary Search tree.
26. Write a Program to implement basic operations deletion on Binary Search tree.
27. Write a Program to implement tree traversal methods
28. Write a Program to implement breadth first graph traversal
29. Write a Program to implement Depth first graph traversal.
30. Write a Program to implement Dijsktra's Shortest Path Algorithm on a graph.

SUGGESTED READING:
1. Fundamentals of Data Structures in C++: Ellis Horowitz, Sartaj Sahni, Susan Anderson-Freed.
2. Data Structures & Algorithms; Concepts, Techniques & Algorithms: G. A. V. Pai Tata McGraw
Hill

You might also like