Scribd
Upload
65 views3 pages

Syllabus

This document outlines a course on C Programming and Data Structures. The course objectives are to teach basic C programming concepts, functions, arrays, pointers, structures, and various data structures like stacks, queues, linked lists, trees, and graphs. The course is divided into 5 units that cover these topics and their applications. The learning outcomes for each unit are also listed. The course aims to help students analyze, design, apply, and demonstrate various programming and data structure concepts.

Uploaded by

Salma Faroze
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
65 views3 pages

Syllabus

This document outlines a course on C Programming and Data Structures. The course objectives are to teach basic C programming concepts, functions, arrays, pointers, structures, and various data structures like stacks, queues, linked lists, trees, and graphs. The course is divided into 5 units that cover these topics and their applications. The learning outcomes for each unit are also listed. The course aims to help students analyze, design, apply, and demonstrate various programming and data structure concepts.

Uploaded by

Salma Faroze
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/ 3

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY ANANTAPUR

B.Tech (CE) – II Sem L T P C

3 0 0 3

(20A05201T) C-Programming & Data Structures

(Common to All Branches of Engineering)

Course Objectives:

 To illustrate the basic concepts of C programming language.


 To discuss the concepts of Functions, Arrays, Pointers and Structures.
 To familiarize with Stack, Queue and Linked lists data structures.
 To explain the concepts of non-linear data structures like graphs and trees.
 To learn different types of searching and sorting techniques.

UNIT-1

Introduction to C Language - C language elements, variable declarations and data types, operators
and expressions, decision statements - If and switch statements, loop control statements - while, for, do-
while statements, arrays.

Learning outcomes:

At the end of this unit, the students will be able to


 Use C basic concepts to write simple C programs. (L3)
 Use iterative statements for writing the C programs (L3)
 Use arrays to process multiple homogeneous data. (L3)
 Test and execute the programs and correct syntax and logical errors. (L4)
 Translate algorithms into programs. (L4)
 Implement conditional branching, iteration and recursion. (L2)

UNIT – 2

Functions, types of functions, Recursion and argument passing, pointers, storage allocation, pointers to
functions, expressions involving pointers, Storage classes – auto, register, static, extern, Structures,
Unions, Strings, string handling functions, and Command line arguments.

Learning outcomes:

At the end of this unit, the students will be able to


 Writing structured programs using C Functions. (L5)
 Writing C programs using various storage classes to control variable access. (L5)
 Apply String handling functions and pointers. (L3)
 Use arrays, pointers and structures to formulate algorithms and write programs.(L3)
UNIT-3

Data Structures, Overview of data structures, stacks and queues, representation of a stack, stack
related terms, operations on a stack, implementation of a stack, evaluation of arithmetic expressions,
infix, prefix, and postfix notations, evaluation of postfix expression, conversion of expression from
infix to postfix, recursion, queues - various positions of queue, representation of queue, insertion,
deletion, searching operations.

Learning outcomes:

At the end of this unit, the students will be able to


 Describe the operations of Stack. (L2)
 Explain the different notations of arithmetic expression. (L5)
 Develop various operations on Queues. (L6)

UNIT – 4

Linked Lists – Singly linked list, dynamically linked stacks and queues, polynomials using singly
linked lists, using circularly linked lists, insertion, deletion and searching operations, doubly linked
lists and its operations, circular linked lists and its operations.

Learning outcomes:

At the end of this unit, the students will be able to


 Analyze various operations on singly linked list. (L4)
 Interpret operations of doubly linked lists. (L2)
 Apply various operations on Circular linked lists. (L6)

UNIT-5

Trees - Tree terminology, representation, Binary trees, representation, binary tree traversals. binary
tree operations, Graphs - graph terminology, graph representation, elementary graph operations,
Breadth First Search (BFS) and Depth First Search (DFS), connected components, spanning trees.
Searching and Sorting – sequential search, binary search, exchange (bubble) sort, selection sort,
insertion sort.

Learning outcomes:

At the end of this unit, the students will be able to


 Develop the representation of Tress. (L3)
 Identify the various Binary tree traversals. (L3)
 Illustrate different Graph traversals like BFS and DFS. (L2)
 Design the different sorting techniques (L6)
 Apply programming to solve searching and sorting problems. (L3)
Text Books:
1. The C Programming Language, Brian W Kernighan and Dennis M Ritchie, Second
Edition, Prentice Hall Publication.
2. Fundamentals of Data Structures in C, Ellis Horowitz, SartajSahni, Susan Anderson-
Freed, Computer Science Press.
3. Programming in C and Data Structures, J.R.Hanly, Ashok N. Kamthane and A.
AnandaRao, Pearson Education.
4. B.A. Forouzon and R.F. Gilberg, “COMPUTER SCIENCE: A Structured Programming
Approach Using C”, Third edition, CENGAGE Learning, 2016.
5. Richard F. Gilberg & Behrouz A. Forouzan, “Data Structures: A Pseudocode Approach
with C”, Second Edition, CENGAGE Learning, 2011.

Reference Books:

1. Pradip Dey and Manas Ghosh, Programming in C, Oxford University Press, 2nd
Edition 2011.
2. E. Balaguruswamy, “C and Data Structures”, 4th Edition, Tata Mc Graw Hill.
3. A.K. Sharma, Computer Fundamentals and Programming in C, 2nd Edition,
University Press.
4. M.T. Somashekara, “Problem Solving Using C”, PHI, 2nd Edition 2009.

Course Outcomes:

 Analyse the basicconcepts of C Programming language. (L4)


 Design applications in C, using functions, arrays, pointers and structures. (L6)
 Apply the concepts of Stacks and Queues in solving the problems. (L3)
 Explore various operations on Linked lists. (L5)
 Demonstrate various tree traversals and graph traversal techniques. (L2)
 Design searching and sorting methods (L3)

You might also like