GUG SY CSE syllabus

GUG · Second Year B.Tech. Computer Science and Engineering · NEP 2020

Data Structures and Program Design

STPCCCSE305 · Semester III · 3 credits · IE 10 + mid-semester 10 + ESE 80

Taught in C: Units I and II cover structures, pointers and file handling in C.

  1. Unit 1: Pointers and Structures

    9 hours

    Defining structures and arrays of structures; pointers, pointer arithmetic and pointer operators; pointers in self-referential structures and the notion of a linked list.

    Examined in the 80-mark end-semester paper, and in the mid-semester exam if it is taught by then

    • Structures and unions
    • Pointers
  2. Unit 2: File Handling

    8 hours

    Streams in C and types of files; file input/output: modes of opening, reading and writing, closing files and fflush().

    Examined in the 80-mark end-semester paper, and in the mid-semester exam if it is taught by then

    • File handling and file organisation
  3. Unit 3: Data Structures and Algorithm Basics

    9 hours

    Basic terminology, elementary data organisation and data structure operations; abstract data types and their characteristics. Algorithms: definition, characteristics and analysis, asymptotic notations and time-space trade-offs. The array ADT: operations and row-major and column-major representations.

    Examined in the 80-mark end-semester paper, and in the mid-semester exam if it is taught by then

  4. Unit 4: Sorting, Searching and Hashing

    10 hours

    Approaches to sorting and the properties of insertion, Shell, quick, merge, heap and counting sort, with their performance analysis; linear and binary search and their complexity; hash functions and hash tables, closed and open hashing, the division, mid-square and folding methods, and collision resolution.

    Examined in the 80-mark end-semester paper, and in the mid-semester exam if it is taught by then

  5. Unit 5: Stacks and Queues

    9 hours

    The stack ADT, its operations and their complexity; applications of stacks to expression conversion and evaluation; multiple stacks. The queue ADT: simple and circular queues, with an introduction to double-ended and priority queues.

    Examined in the 80-mark end-semester paper, and in the mid-semester exam if it is taught by then

Unit contents are summarised from the official GUG syllabus . AiCanCode.org is not affiliated with Gondwana University, Gadchiroli.