Scribd
Upload
41 views2 pages

CS3353 Syllabus

The document outlines the course CS3353 on C Programming and Data Structures, detailing its objectives and structure. It covers fundamental and advanced features of C programming, linear and non-linear data structures, and various sorting and searching techniques. The course consists of five units, each focusing on different aspects of C programming and data structures over a total of 45 periods.

Uploaded by

soundhuk1806
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
41 views2 pages

CS3353 Syllabus

The document outlines the course CS3353 on C Programming and Data Structures, detailing its objectives and structure. It covers fundamental and advanced features of C programming, linear and non-linear data structures, and various sorting and searching techniques. The course consists of five units, each focusing on different aspects of C programming and data structures over a total of 45 periods.

Uploaded by

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

CS3353 C PROGRAMMING AND DATA STRUCTURES L TPC 3 0 0 3

COURSE OBJECTIVES:

To introduce the basics of C programming language.

To learn the concepts of advanced features of C.

To understand the concepts of ADTs and linear data structures.

To know the concepts of non-linear data structure and hashing.

To familiarize the concepts of sorting and searching techniques.

UNIT I C PROGRAMMING FUNDAMENTALS 9

Data Types – Variables – Operations – Expressions and Statements – Conditional Statements – Functions – Recursive Functions – Arrays – Single and Multi-

Dimensional Arrays.

UNIT II C PROGRAMMING - ADVANCED FEATURES 9

Structures – Union – Enumerated Data Types – Pointers: Pointers to Variables, Arrays and Functions – File Handling – Preprocessor Directives.

UNIT III LINEAR DATA STRUCTURES 9

Abstract Data Types (ADTs) – List ADT – Array-Based Implementation – Linked List

– Doubly- Linked Lists – Circular Linked List – Stack ADT – Implementation of Stack

– Applications – Queue ADT – Priority Queues – Queue Implementation – Applications.

UNIT IV NON-LINEAR DATA STRUCTURES 9

Trees – Binary Trees – Tree Traversals – Expression Trees – Binary Search Tree – Hashing - Hash Functions – Separate Chaining – Open Addressing –

Linear Probing– Quadratic Probing – Double Hashing – Rehashing.

UNIT V SORTING AND SEARCHING TECHNIQUES 9

Insertion Sort – Quick Sort – Heap Sort – Merge Sort –Linear Search – Binary Search.

TOTAL 45 PERIODS
CS3353 C PROGRAMMING AND DATA STRUCTURES L TPC 3 0 0
3

You might also like