TCS303
DATASTRUCTURES
LTP
310
UNIT I (10L)
Introduction:BasicTerminology,ElementaryDataOrganization,Structure
operations,AlgorithmComplexityandTime-Spacetrade-off
Arrays:ArrayDefinition,RepresentationandAnalysis,SingleandMultidimensional
Arrays, addresscalculation,applicationofarrays,CharacterStringinC,Characterstring
operation,ArrayasParameters,OrderedList,SparseMatricesandVectors.
Stacks:ArrayRepresentationandImplementationofstack,OperationsonStacks:Push&Pop,
ArrayRepresentationofStack,LinkedRepresentationofStack,OperationsAssociatedwith
Stacks,Applicationofstack:ConversionofInfixtoPrefixandPostfixExpressions,
Evaluation ofpostfixexpressionusingstack.
Recursion:Recursivedefinitionandprocesses,recursion,exampleofrecursion,Towerof
HanoiProblem,simulatingrecursion,Backtracking,recursivealgorithms.
UNIT II (8L)
Queues:Arrayandlinkedrepresentation andimplementationofqueues,Operationson
Queue:Create, Add,Delete,FullandEmpty,Circularqueues,D-queuesandPriorityQueues.
Linkedlist:RepresentationandImplementationofSinglyLinkedLists,Two-wayHeader
List,TraversingandSearchingofLinkedList,OverflowandUnderflow,Insertionand
deletionto/fromLinkedLists,InsertionanddeletionAlgorithms,Doublylinkedlist,
LinkedListinArray, Polynomialrepresentationandaddition,GarbageCollectionand
Compaction.
UNIT III (8L)
Trees:Basicterminology,BinaryTrees,Binarytreerepresentation,algebraic
Expressions,CompleteBinaryTree,ExtendedBinaryTrees,ArrayandLinked
RepresentationofBinarytrees,TraversingBinarytrees,ThreadedBinarytrees,path
lengthalgorithm.HuffmanAlgorithm.
BinarySearchTrees:BinarySearchTree(BST),InsertionandDeletioninBST,
ComplexityofSearchAlgorithm.
UNIT IV (8L)
SearchingandHashing:Sequentialsearch,binarysearch,comparisonandanalysis,
HashTable,HashFunctions,CollisionResolutionStrategies,HashTableImplementation.
Sorting:InsertionSort,BubbleSort,QuickSort,TwoWayMergeSort,HeapSort,Sortingon
DifferentKeys.
UNIT V (6L)
FileStructures:PhysicalStorageMediaFileOrganization,Organizationofrecords
intoBlocks,SequentialFiles,IndexingandHashing,Primaryindices,Secondaryindices,B+
TreeindexFiles,BTreeindexFiles,IndexingandHashingComparisons.
Referencebooks:
1.Shukla, Data StructuresusingCand C++ ,WileyIndia
2.AM.Tenenbaum, DataStructuresusingC&C++ ,Prentice-HallofIndiaPvt.Ltd.,New
3.Delhi.(2nded).
4.R.Kruseetal, DataStructuresandProgramDesigninC ,PearsonEducationAsia,
5.Delhi-2002.Reprint2010.
6.Keogh, DataStructures:Principlesand Fundamentals , WileyIndia