Page 122 - IT_Bulletin

DATA STRUCTURE AND ALGORITHMS

RGPV (DIPLOMA WING) OBE CURRICULUM FOR THE FORMAT- Sheet
BHOPAL 3 No. 1/3
COURSE

Branc COMPUTER SCIENCE AND Semest Third
h ENGINEERING/INFORMATIONTECHNOLOGY er

Course 304 Cours DATA STRUCTURE AND ALGORITHM
Code e
Teaching Marks
Nam Hrs
e

Course APPLY BASICS OF DATA STRUCTURES, POINTERS & DYNAMIC 30 34
Outcome 1 MEMORY MANAGEMENT IN A GIVEN PROBLEM SITUATION.

Learning EXPLAIN DATA TYPES & ABSTRACT DATA TYPES (ADT), 14 14
Outcome 1 POINTERS, STRUCTURE AND DYNAMIC MEMORY.
10
Contents Overview of Data, Abstract Data Types and Data-Structure.

Classification of Data Structure: Linear, Non-Linear, Primitive,
Non-Primitive, etc.

Pointers: Introduction, Declaring and initializing pointers, Accessing
variables using pointers, Pointer arithmetic, Array of Pointers, Row-
major & Col-major implementation of 2-D array.

Structure: Definition, Declaration, Initializing Structure,
Accessing Structure elements, Array of Structure, Pointer to
Structure.

Learning Dynamic Memory Allocation/Deallocation: malloc(), calloc(), free(), 08
Outcome 2 realloc().

INTERPRET STRUCTURE & POINTERS, DYNAMIC MEMORY
ALLOCATION AND DE- ALLOCATION.

Contents Pointers and constant pointer self referential structures, Dynamic structures,

Comparative Study of Union & Structure.

Learning USE STRUCTURE & POINTERS FOR A GIVEN PROBLEM SITUATION. 08 10
Outcome 3

Contents Invoking functions by passing the pointers, Declaration and use
of structure.

DATA STRUCTURE AND ALGORITHMS