0% found this document useful (0 votes)
67 views2 pages

frmCourseSyllabusIPDownload Aspx

This document outlines the course CAP267: Data Structures which is worth 3 credits. The course aims to help students understand computational efficiency of algorithms, memory representation of data structures, applying appropriate data structures to problems, and analyzing performance of different implementations. The course covers basic concepts, arrays, linked lists, stacks and queues, trees and graphs, and searching and sorting algorithms like bubble sort, shell sort, and merge sort. Recommended textbooks include Data Structures by Seymour Lipschutz and Data Structures Using C by Reema Thareja.

Uploaded by

ahrazrana8603
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
67 views2 pages

frmCourseSyllabusIPDownload Aspx

This document outlines the course CAP267: Data Structures which is worth 3 credits. The course aims to help students understand computational efficiency of algorithms, memory representation of data structures, applying appropriate data structures to problems, and analyzing performance of different implementations. The course covers basic concepts, arrays, linked lists, stacks and queues, trees and graphs, and searching and sorting algorithms like bubble sort, shell sort, and merge sort. Recommended textbooks include Data Structures by Seymour Lipschutz and Data Structures Using C by Reema Thareja.

Uploaded by

ahrazrana8603
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

CAP267:DATA STRUCTURES

L:3 T:0 P:0 Credits:3

Course Outcomes: Through this course students should be able to

CO1 :: describe the computational efficiency of the principal algorithms for searching and sorting.

CO2 :: understand how basic data structures are represented in memory

CO3 :: apply appropriate data structures to solve real world problems efficiently

CO4 :: analyze the alternate implementation of data structures to enhance performance

CO5 :: NULL

Unit I
Basic Concepts : introduction to data structures and algorithms, data structure operations,
complexity of algorithms, asymptotic notations for complexity, control structures, introduction to
pointers, advantages, pointer arithmetic, self-referential structures
Unit II
Arrays : concept of arrays, single dimensional arrays, two dimensional arrays, memory
representation of arrays, operations on arrays, searching, traversal, insertion, deletion, concatenation
and merging of two arrays
Unit III
Linked Lists : introduction to linked list, dynamic memory allocation, Representation of linked lists in
memory, traversing a linked list, Searching a linked list, insertion and deletion into linked list, doubly
linked lists, traversing a doubly linked list, insertion and deletion from doubly linked lists, Circular
linked lists
Unit IV
Stacks and Queues : introduction to stacks, representation of stacks, implementation of stacks
using sequential and linked representation, introduction to queues, implementation of queues using
sequential and linked representation, circular queues, Deques, recursion
Unit V
Trees and Graphs : concept of trees, representation of binary trees, binary search trees, recursive
and non-recursive traversal, searching in binary search tree, insertion and deletion in binary search
trees, terminology of graphs, depth first search, breadth first search
Unit VI
Searching and sorting : linear and binary search, concept of sorting, Bubble sort, shell sort,
Insertion sort, Selection sort, Merge sort, radix sort

Text Books:
1. DATA STRUCTURES by SEYMOUR LIPSCHUTZ, MCGRAW HILL EDUCATION

References:
1. DATA STRUCTURES USING C by REEMA THAREJA, OXFORD UNIVERSITY PRESS

2. DATA STRUCTURES USING C by MANOJ KUMAR, EAGLE PRAKASHAN

3. DATA STRUCTURES USING C by E BALAGURUSAMY, Tata McGraw Hill, India

4. DATA STRUCTURES & ALGORITHMS USING C by R.S. SALARIA, KHANNA PUBLISHERS

Session 2023-24 Page:1/2


Session 2023-24 Page:2/2

You might also like