Scribd
Upload
8 views

CS3353 C Programming and Data Structures

Uploaded by

Elavazhagan
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
8 views

CS3353 C Programming and Data Structures

Uploaded by

Elavazhagan
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

CS3353 C PROGRAMMING AND DATA STRUCTURES L T P C

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 (8+1 SKILL) 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 (8+1 SKILL) 9


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

UNIT III LINEAR DATA STRUCTURES (8+1 SKILL) 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 (8+1 SKILL) 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 (8+1 SKILL) 9


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

TOTAL: 45 PERIODS
SKILL DEVELOPMENT ACTIVITIES (Group Seminar/Mini Project/Assignment/Content
Preparation / Quiz/ Surprise Test / Solving GATE questions/ etc) 5
COURSE OUTCOMES:
CO1 Develop C programs for any real world/technical application.
CO2 Apply advanced features of C in solving problems.
CO3 Write functions to implement linear and non–linear data structure operations.
CO4 Suggest and use appropriate linear/non–linear data structure operations for solving a given
problem.
CO5 Appropriately use sort and search algorithms for a given application.
CO6 Apply appropriate hash functions that result in a collision free scenario for data storage and
retrieval.
TEXT BOOKS:

1. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C”, Second Edition, Pearson
Education, 1997.
2. ReemaThareja, “Programming in C”, Second Edition, Oxford University Press, 2016.

74
REFERENCES:

1. Brian W. Kernighan, Rob Pike, “The Practice of Programming”, Pearson Education, 1999.
2. Paul J. Deitel, Harvey Deitel, “C How to Program”, Seventh Edition, Pearson Education, 2013.
3. Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman, “Data Structures and Algorithms”, Pearson
Education,1983.
4. Ellis Horowitz, SartajSahni and Susan Anderson, “Fundamentals of Data Structures”, Galgotia,
2008.
List of Open Source Software/ Learning website:
https://www.coursera.org/specializations/data-structures-algorithms
https://nptel.ac.in/courses/112107243
https://nptel.ac.in/courses/112105598

MAPPING OF COs WITH POs AND PSOs


COs POs PSOs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
1 2 3 1 2 2 1 1 - 1 2 1 3 2 1 3
2 1 2 1 2 2 - - - 1 1 1 2 2 2 2
3 2 3 1 2 3 - - - 1 1 1 2 2 1 2
4 2 1 - 1 1 - - - 2 1 1 2 2 3 1
5 1 2 1 2 2 1 1 - 1 2 1 3 2 2 3
Avg. 2 2 1 2 2 1 1 - 1 1 1 2 2 2 2

EC3311 ELECTRONIC DEVICES AND CIRCUITS LABORATORY LTPC


0 0 3 1.5
COURSE OBJECTIVES:
 To enable the students to understand the behavior of semiconductor device based on
experimentation.
 Be exposed to active and passive circuit elements.
 Familiarize the operation and characteristics of transistor like BJT and FET.
 Explore the characteristics of amplifier gain and frequency response.
 Learn the required functionality of positive and negative feedback systems.

LIST OF EXPERIMENTS
1. Characteristics of Semiconductor diode, Zener diode , photo diode , and photo transistor,
2. Characteristics of NPN Transistor under common emitter , common collector and
common base configurations
3. Characteristics of JFET and draw the equivalent circuit
4. Characteristics of UJT and generation of saw tooth waveforms
5. Design and frequency response characteristics of a Common Emitter amplifier
6. Characteristics of light activated relay circuit

75

You might also like