Data Structures (Syllabus and Model Paper)

DEPARTMENT OF COMPUTER SCIENCE
BSc III SEMESTER DATA STRUCTURES (SYLLABUS)
Section: NSCS-1 and NSCS-2
COURSE OBJECTIVES:
To introduce the fundamental concept of data structures and to emphasize the importance of various data
structures in developing and implementing efficient algorithms.
Course Learning Outcomes:
Upon successful completion of the course, a student will be able to:
● Understand available Data Structures for data storage and processing.
● Comprehend Data Structure and their real-time applications - Stack, Queue, Linked List, Trees and
Graph
● Choose a suitable Data Structures for an application Develop ability to implement different Sorting
and Search methods
● Have knowledge on Data Structures basic operations like insert, delete, search, update and
traversal
● Design and develop programs using various data structures
● Implement the applications of algorithms for sorting, pattern matching etc.
UNIT – I:
Introduction to Data Structures: Introduction to the Theory of Data Structures, Data Representation, Data
Types, Primitive Data Types, Data Structure and Structured Type, Refinement Stages.
Principles of Programming and Analysis of Algorithms: Software Engineering, Program Design, Algorithms,
Different Approaches to Designing an Algorithm, Complexity, Algorithm Analysis, Structured Approach to
Programming, Recursion.
UNIT – II:
Arrays: Introduction to Linear and Non- Linear Data Structures, One- Dimensional Arrays, Array Operations,
Two- Dimensional arrays, Multidimensional Arrays, Pointers and Arrays.
Linked Lists: Introduction to Lists and Linked Lists, Dynamic Memory Allocation, Basic Linked List
Operations, Doubly Linked List, Circular Linked List, Linked List in Arrays, Linked List versus Arrays
UNIT – III:
Stacks: Introduction to Stacks, Stack as an Abstract Data Type, Representation of Stacks through Arrays,
Representation of Stacks through Linked Lists, Applications of Stacks, Stacks and Recursion
Queues: Introduction, Queue as an Abstract data Type, Representation of Queues, Circular Queues, Double
Ended Queues- Deques, Priority Queues, Application of Queues
UNIT – IV:
Andhra Loyola College (Autonomous), Vijayawada-8

Binary Trees: Introduction to Non- Linear Data Structures, Introduction Binary Trees, Types of Trees, Basic
Definition of Binary Trees, Properties of Binary Trees, Representation of Binary Trees, Operations on a
Binary Search Tree, Binary Tree Traversal, Applications of Binary Tree
UNIT – V:
Searching and sorting: Sorting – An Introduction, Bubble Sort, Insertion Sort, Merge Sort, Searching An
Introduction, Linear or Sequential Search, Binary Search, Indexed Sequential Search.
Graphs: Introduction to Graphs, Terms Associated with Graphs, Sequential Representation of Graphs,
Linked Representation of Graphs, Traversal of Graphs, Spanning Trees, Shortest Path, Application of
Graphs.
BOOKS:
1. “Data Structures using C”, ISRD group Second Edition, TMH
2. “Data Structures through C”, Yashavant Kanetkar, BPB Publications
3. “Data Structures Using C” Balagurusamy E. TMH
Semester Examination Model Paper (Data Structures)
Section-A
Answer Any Five of the following 5*16 = 80
1. Explain different types of Data Representation in computer? 16m
(Or)
Explain briefly about space and time complexity? 16m
2. what is linked list ? Explain operations performed on a single linked list with example. 16m
(Or)
what is an array ? explain array operations insertion and deletion with the help of algorithms ?
16m
3. What is stack ? Explain the operations performed on a stack using array? 16m
(Or)
What is a Queue? Explain operations performed on a Queue using Arrays? 16m
4. Explain different types of trees in detail? 16m

(Or)
What is a binary tree? Explain binary tree transversal in detail with example? 16m
5. What is searching? Explain linear and Binary search with an example. 16m
(Or)

What is graph? Explain in how many way a graph is represented with example 16m
Section –B 10*2=20m
1. Define Data structure?

2. What is an algorithm?
3. Define Multi dimensional array ?
4. Define pointer?
5. Define pop operation?
6. Define dequeue?
7. Define red black tree?
8. What are tree applications?
9. What is graph?
10. Define edge and vertex?

Data Structures (Syllabus and Model Paper)

Uploaded by

Data Structures (Syllabus and Model Paper)

Uploaded by

DEPARTMENT OF COMPUTER SCIENCE

BSc III SEMESTER DATA STRUCTURES (SYLLABUS)

Section: NSCS-1 and NSCS-2

Course Learning Outcomes:

Upon successful completion of the course, a student will be able to:

● Understand available Data Structures for data storage and processing.

● Implement the applications of algorithms for sorting, pattern matching etc.

Andhra Loyola College (Autonomous), Vijayawada-8

1. “Data Structures using C”, ISRD group Second Edition, TMH

2. “Data Structures through C”, Yashavant Kanetkar, BPB Publications

3. “Data Structures Using C” Balagurusamy E. TMH

Semester Examination Model Paper (Data Structures)

Explain briefly about space and time complexity? 16m

4. Explain different types of trees in detail? 16m

Andhra Loyola College (Autonomous), Vijayawada-8

1. Define Data structure?

Andhra Loyola College (Autonomous), Vijayawada-8

You might also like