Subject Syllabus
CSIT-303 - Data Structure
CSIT · Semester 3
Course Modules
Learn topic-wise with Hyper AI and revise using mapped PYQs.
Data, data type, data objectTypes of data structure – primitive & non-primitive, linear & non-linearOperations on data structures – traversing, searching, inserting, deletingComplexity analysis – worst case, best case, average caseTime – space trade offalgorithm efficiencyasymptotic notations – big oh, omega, theta
Introductiondeclaration of arraysoperations on arrays – inserting, deleting, merging of two arrays1 dimensional & 2 dimensional arraysrow & column major representationaddress calculation in arraystoring values in arraysevaluation of polynomial – addition & representationSearching & sorting – Introductionsequential searchbinary searchFibonacci searchindexed sequential searchhashed searchTypes of sorting with general concepts – bubble, heap, insertion, selection, quick, shell, bucket, radix and merge sort
Basic concept of stacks & queuesarray representation of stacksoperation on stacks – Push, Pop, Create, getTop, emptylinked representation of stackmultiple stackApplication of stack – Conversion: infix, prefix, postfix and evaluation of arithmetic expressionLinked representation of queueoperations on queue – insertion & deletionTypes of queue with functions – circular, deque, priority queueApplications of queues – Job scheduling, Josephus problem
Introduction – basic terminology, memory allocation & deallocation for linked listLinked list variants – head pointer, head nodetypes linked list – linear & circular linked listDoubly linked listcreation of doubly listdeletion of node from doubly linked listinsertion of a node from doubly linked listtraversal of doubly linked listCircular linked list – singly circular linked list, circular linked list with header node, doubly circular linked listApplications of linked list – polynomial representation & garbage collection