Skip to content
CampusPrep
IT-303 · Data Structure/Official Syllabus

Data Structure (IT-303) - Official Syllabus

1
Unit 1

Introduction

  • Data, data type, data object
  • Types of data structure – primitive & non-primitive , linear & non-linear
  • Operations on data structures – traversing, searching , inserting , deleting
  • Complexity analysis – worst case, best case, average case
  • Time – space trade off
  • algorithm efficiency
  • asymptotic notations – big oh , omega , theta
2
Unit 2

Arrays & Structure

  • Introduction , declaration of arrays
  • operations on arrays – inserting , deleting , merging of two arrays
  • 1 dimensional & 2 dimensional arrays
  • row & column major representation
  • address calculation in array
  • storing values in arrays
  • evaluation of polynomial – addition & representation
  • Searching & sorting – Introduction
  • sequential search
  • binary search
  • Fibonacci search
  • indexed sequential search
  • hashed search
  • Types of sorting with general concepts – bubble , heap , insertion , selection , quick , shell , bucket , radix and merge sort
3
Unit 3

Stacks & Queues

  • Basic concept of stacks & queues
  • array representation of stacks
  • operation on stacks – push , pop , create , getTop , empty
  • linked representation of stack
  • multiple stack
  • Application of stack – Conversion: infix , prefix , postfix and evaluation of arithmetic expression
  • Linked representation of queue
  • operations on queue – insertion & deletion
  • Types of queue with functions – circular , deque , priority queue
  • Applications of queues – job scheduling , Josephus problem
4
Unit 4

Linked List

  • Introduction – basic terminology
  • memory allocation & deallocation for linked list
  • Linked list variants – head pointer , head node
  • types linked list – linear & circular linked list
  • Doubly linked list , creation of doubly list, deletion of node from doubly linked list, insertion of a node from doubly linked list, traversal of doubly linked list
  • Circular linked list – singly circular linked list , circular linked list with header node , doubly circular linked list
  • Applications of linked list – polynomial representation & garbage collection
5
Unit 5

Trees

  • Basic terminology – general tree
  • representation of general tree
  • types of trees
  • binary tree- realization and properties
  • traversal in binary trees – inorder , preorder , postorder
  • applications of trees
  • Graph- Basic Terminologies and representations
  • Graph search and traversal algorithms

Laboratory Experiments

  • Write a program to search an element in the array using Linear and Binary Search.
  • Write a program to perform the following operation in Matrix: 1. Addition 2. Subtraction 3. Multiplication 4. Transpose
  • Write a program to perform the following operation on strings using string functions: 1. Addition 2. Copying 3. Reverse 4. Length of String
  • Write program for implementing the following sorting methods to arrange a list of integers in ascending order: a) Quick sort b) Selection sort c) Insertion sort d) Merge sort
  • Write a program that uses stack operations to convert a given infix expression into its postfix equivalent.
  • Write a program to merge two sorted array into one sorted array.
  • Write a program to implement stack using array and linked list.
  • Write a program to implement queue and circular queue using array.
  • Write a program to insert an element in the beginning and end of singly linked list.
  • Write a program to insert an element at any position in singly and doubly linked list.
  • Insert and delete a node at any position in doubly linked list.
  • Write a program of Tower of Hanoi.
  • Write a program that uses functions to perform the following: a) Create a binary search tree of integers. b) Traverse the above Binary search tree non recursively in in order.

Reference Books

  • Data Structure Using C++ — Varsha H. Patil — Oxford
  • Data Structures Using C & C++ — Rajesh K. Shukla — Wiley India
  • Data Structure Using C — Reema Thareja — Oxford
  • Data Structure Using C++ — D. S Malik — Cengage — Second Edition
  • Data Structure: A programming Approach with C — Kushwaha, Mishra — PHI Learning
  • Data Structure Using C — A. K Sharma — Pearson
  • Fundamentals of Data Structures — Ellis Horowitz, Sartaj Sahni — Computer Science Press
Go to where you left off?

Quick Add to Notes

Save questions, your own notes and screenshots into notes filed by unit. It takes a free account.

Create free account

Have an account? Log in