Syllabus COCSC02
Syllabus COCSC02
COURSE OUTCOMES
1. Candidate will be able to choose the appropriate data structure for a specified
problem and determine the same in different scenarios of real world problems.
2. Become familiar with writing recursive methods and reducing larger problems
recursively in smaller problems with applications to practical problems.
3. Be able to understand the abstract properties of various data structures such as
stacks, queues, lists, trees and graphs and apply the same to real life problems of
sorting, searching, and traversals for skill enhancement in problem solving.
4. Be able to implement various data structures in more than one manner
5. Understand the advantages and disadvantages of the different implementations by
using efficient representation of problems.
COURSE CONTENT
UNIT-I
Introduction: Basic Terminology: Elementary Data Organization, Data Structure
Operations, Algorithms Complexity and Time-Space Trade off.
Arrays: Array Definition and Analysis, Representation of Linear Arrays in Memory,
Traversing, Insertion And Deletion in Array, Single Dimensional Arrays, Two
Dimensional Arrays, Bubble Sorting, Selection Sorting, Linear Search, Binary Search,
Multidimensional Arrays, Function Associated with Arrays, Character String in C,
Character String Operations, Arrays as parameters, Implementing One Dimensional
Array.
UNIT-II
Stacks and Queues: Introduction to Operations Associated with Stacks Push & Pop,
Array representation of stacks, Operation associated with stacks: Create, Add, Delete,
Application of stacks recursion polish expression and their compilation conversion of
infix expression to prefix and postfix expression, Tower of Hanoi problem,
Representation of Queues, Operations of queues: Create, Add, Delete, Front, Empty,
Priority Queues and Heaps, Dequeue.
UNIT-III
Recursion: Recursive thinking, Recursive Definition of Mathematical Formulae,
Recursive Array Search, Recursive Data Structure, Problem Solving With Recursion,
Back Tracking
Linked Lists:More operations on linked list, polynomial addition, Header nodes, doubly
linked list, generalized list, circular linked lists.
UNIT-IV
Trees:Trees – mathematical properties, Binary Search Trees and their representation,
expression evaluation, Complete Binary trees, Extended binary trees, Traversing
binary trees, Searching, Insertion and Deletion in binary search trees, Complexity of
searching algorithm, Path length, Huffman’s algorithm, General trees, AVL trees,
Threaded trees, B trees, Trie data structure
UNIT-V
Sorting: Insertion Sort, Quick sort, two-way Merge sort, Heap sort, sorting on different
keys, External sorting.
Graphs: Sequential representation of graphs, Adjacency matrices, Search and Traversal
of graphs: Depth first, breadth first, topological sort.