Department of Computer Science and Engineering

ANNAMACHARYA INSTITUTE OF TECHNOLOGY AND SCIENCES

(Autonomous)
Problem Solving through C programming

B.Tech.
Program Name: Computer Science and Engineering Academic Year: 2022-23

Course Code: 20A511T Class: I B. Tech.

Name of the Course: Problem Solving through C Semester: I
programming
Regulation R20 L-T-P-C 3-0-0-3
Pre-Requisite Formulate simple algorithms for arithmetic and logical
/Exposure problems.
Translate the algorithms to programs (in C language)
Test and execute the programs and correct syntax and logical
errors.
Implement conditional branching, iteration and recursion
Faculty Name: Mr. S ASHOK KUMAR

Course Description:
Problem Solving through C programming course equips learners with problem-solving skills
essential for software development. Through hands-on exercises and projects, students delve into
foundational concepts such as variables, control structures, functions, and arrays. They tackle
real-world challenges, honing their ability to analyze problems and design efficient solutions
using C programming constructs. The course emphasizes algorithmic thinking and debugging
techniques to overcome coding obstacles effectively. By the end, participants gain a solid
understanding of C programming principles and the confidence to tackle complex programming
tasks independently. This course is ideal for beginners and aspiring programmers seeking to
enhance their problem-solving capabilities through practical coding experience.

Course Objectives:

The aim of this course is to help you understand what programming is, and what is a programming
language. The course helps you understand the concepts of loops, reading a set of data, stepwise
refinement, functions, control structures, and arrays.

• To Elucidate the basic architecture and functionalities of a computer

• Apply programming constructs of C language to solve the real-world problems
• Explore user-defined data structures like arrays, strings, structures and pointers in
implementing solutions to problems
• Design and Develop Solutions to problems using modular programming constructs
such as functions and procedures and files.
Course Content:

Module Description of Topic Contact

No. Hrs.
1 Steps to solve problems, algorithm, Pseudo code, Flowchart with examples, 9
Program Development Environments. Introduction to programming:
Programming languages and generations. Introduction to C: Introduction,
structure of C program, keywords, identifiers, Variables, data types, constants,
I/O statements, operators, precedence and associatively.
2 Selective, looping and nested statements, jumping statements. Arrays: 9
Introduction, declaration of arrays, accessing and storage of array elements,
searching (linear and binary search algorithms) and sorting (selection and bubble)
algorithms, multidimensional arrays, matrix operations.

3 Strings: Declaration and Initialization, String Input / Output functions, String 9

manipulation functions. Functions: Types of functions, recursion, scope of variables
and storage classes. Preprocessor Directives: Types of preprocessor directives,
examples.
4 Pointers: Understanding computer ‘s memory, introduction to pointers, declaration 8
pointer variables, pointer arithmetic, pointers and strings, array of pointers, function
pointers, dynamic memory allocation, advantages and drawbacks of pointers.

9
5 Structures: Structure definition, initialization and accessing the members of a
structure, nested structures, array of structures, structures and functions, structures
and pointers, self-referential structures, unions and enumerated data types. Files:
Introduction to files, file operations, reading and writing data on files, error handling
during file operations.
 Course Outcomes (CO):

Upon completion of the course, the students will be able to:

CO Taxonomy
CO Statement
Number Level

Comprehension
ESC- Interpret the basics concepts of computer fundamentals and L2
20A511T-1 programming to formulate simple algorithms and translate the
algorithms to programs (in C language).

ESC- Apply programming constructs of C language to solve the real-world Application

20A511T-2 problem. L3

Synthesis
ESC- write user-defined data structures like arrays in implementing
20A511T-3 solutions to L6
Problems like searching and sorting.

ESC- Apply user-defined data structures like structures, unions and Application
20A511T-4 pointers in L3
Implementing solutions.

ESC- Synthesis
Design and Develop Solutions to problems using modular
20A511T-5 programming constructs L6
using functions and file handling
CO-PO/PSO Relationship Matrix:
(LevelofMapping:3-High;2-Moderate;1-Low)

PSO1

PSO2

PSO3
PO10

PO11

PO12
PO1

PO2

PO3

PO4

PO5

PO6
PO7
PO8
PO9
CO
20A511T-1 2 2 1 1 2 - - - - - - 2 3 3 3
20A511T-2 3 2 1 2 3 - - - - - - 3 - 3 3
20A511T-3 3 3 3 3 3 - - - - - - 3 - 3 3
20A511T-4 3 2 1 2 3 - - - - - - 3 - 3 3
20A511T-5 3 3 3 3 3 - - - - - - 3 3 3 3
Sum 14 12 9 11 14 - - - - - - 14 6 15 15
No of POs
5 5 5 5 5 - - - - - - 5 2 5 5
Mapped
Average 2.8 2.4 1.8 2.2 2.8 - - - - - - 2.8 3 3 3
Roundoff 3 3 2 2 3 - - - - - - 3 3 3 3

PO1:EngineeringKnowledge PO7:Environment&Sustainability
PO2:ProblemAnalysis PO8:Ethics
PO3:Design/DevelopmentofSolutions PO9:Individual&TeamWork
PO4:ConductInvestigationsofcomplexproblems PO10:CommunicationSkills
PO5:ModernToolusage PO11:ProjectManagement&Finance
PO6:Engineer&Society PO12:Life-longLearning
PSO1:Understandtheworkingofnewhardware/softwarearchitectures,componentsanddesign
Solutions for Realtime problems.
PSO2:Model the computer based systems and design algorithms that explores understanding of the
trade-off s involved on design choices.
PSO3:Design,develop and test the system software &application software for distributed and
Centralized computing environments to verify domain and platforms.
Justification of Mapping:
CO PO/PSO Mapped Justificatio
n

PO1:
Moderately mapped as the students can develop robust
and efficient software systems to tackle the myriad
challenges of the engineering domain. By embracing
these principles, engineers can drive innovation, optimize
processes, and ultimately contribute to the advancement
of technology and society as a whole.
PO1, PO2,
ESC- PO2:
PO3,PO4,PO5,PO1
20A511T-1 Moderately mapped as the students can analysis in
2,PSO1,PSO2,PSO3 engineering by providing systematic approaches, visual
clarity, and feasibility assessment, enabling engineers to
dissect complex problems, communicate solutions
effectively, and identify optimization opportunities.

PO3:
Moderately mapped as the students aids in the design and
development of solutions by providing structured
approaches, visual representations, and practical
implementation methods, facilitating the creation of
efficient and effective engineering solutions.

PO4:
Slightly mapped as the student may apply systematic
analysis, visual representation, and practical
implementation methods, facilitating thorough
understanding and effective problem-solving.

PO5:
Moderately mapped as foundational understanding and
practical implementation skills essential for leveraging
advanced software tools and technologies in engineering
practices.

PO12:
Moderately mapped as fosters lifelong learning by
instilling problem-solving skills, adaptability, and a solid
foundation in computational concepts necessary for
continuous skill development and staying abreast of
advancements in engineering and technology.
 PSO1:
Moderately mapped as the knowledge gained.
PSO2:
Stronglymappedastheknowledgegainedof design and
development of solutions by providing structured
approaches.
PSO3:
strongly mapped as Design, develop and test the system
software &application software for distributed and
Centralized computing environments to verify domain and
platforms
PO1:
Strongly mapped as engineering knowledge of algorithmic
and decision-making technique.
PO2:
Moderately mapped as the analytical technique learned
ESC- PO1, PO2, involves in analysis.
20A511T-2
PO3,PO4,PO5,P PO3:
Slightly mapped as the acquired knowledge will support the
O12,PSO2,PSO3 design of practical implementation methods.
PO4:
Moderately mapped as the analytical knowledge gained of
understanding and effective problem-solving.
PO5:
Strongly mapped by understanding and implementing
advanced software functionalities, optimizing algorithms,
and effectively managing and processing data, thus
enhancing productivity and innovation in engineering
practices
PO12:
Strongly mapped as the learning outcome prepares the
learner for self-learning the working of advancements in
engineering and technology.
PSO2:
Strongly mapped as the knowledge gained of design and
development of solutions by providing structured approaches
of control structures.
PSO3:
Strongly mapped as the knowledge gained of design and
development of solutions by providing sorting and searching
techniques.
 PO1:
Strongly mapped by facilitating text manipulation, modular
code organization, and code customization for efficient and
scalable engineering solutions.
PO2:
Strongly mapped by enabling engineers to dissect complex
ESC- data, organize modular solutions, and customize code for
PO1, PO2, systematic evaluation and effective resolution of engineering
20A511T-3
PO3,PO4,PO5,P challenges.
O12,PSO2,PSO3 PO3:
Moderately mapped as the analytical technique learned
involves analysis
PO4:
Strongly mapped as the analytical technique learned involves
analysis.
PO5:
Strongly mapped with emphasizing the development of
critical thinking skills through the analysis, synthesis, and
evaluation of complex concept in problem design solution.
PO12:
Strongly mapped as the learning outcome prepares the
learner for self-learning the working of programming
languages.
PSO1:
Strongly mapped as the knowledge gained.
PSO3:
Strongly mapped As robust understanding of these
principles is essential for proficiency in C programming, as
they form the cornerstone for mastering the language's
intricacies and achieving fluency in crafting efficient and
effective solutions..
PO1:
Strongly mapped as engineering knowledge of intermediate
code form.
PO2:
ESC- Moderately involves understanding and communicating
20A511T-4 PO1, PO2, grade-off sin language design, enhancing students' ability to
PO3,PO4,PO5,PO communicate complex technical concepts effectively.
12,PSO2,PSO3 PO3:
Slightly mapped as the acquired knowledge will support the
design of vibration aided and vibration control applications
as per specific need.
PO4:
moderately mapped as the analytical technique learned
involves analysis.
PO5:
Strongly mapped as it facilitates modern tool usage by
enabling efficient memory management and flexible data
manipulation, essential for handling complex data structures
and optimizing resource utilization in advanced software
development
 PSO2:
Strongly mapped as the knowledge gained of pointers
and its memory organization .
PSO3:
Strongly mapped As profound comprehension of these
foundational principles is paramount for adeptness in C
programming and its execution, underscoring their
indispensability in mastering the language and realizing
sophisticated implementations
PO1:
Strongly mapped with enabling efficient organization,
memory optimization, and data storage in diverse
engineering applications.
PO2:
Strongly mapped involves understanding and
communicating trade-offs in language design, enhancing
students' ability to communicate complex technical
PO1, PO2, concepts effectively.
ESC- PO3,PO4,PO5,PO1 PO3:
20A511T-5
2,PSO1,PSO2,PSO3 Strongly mapped as the acquired knowledge will support
the design of balanced and unbalanced systems as per
specific need.
PO4:
Strongly mapped as the analytical technique learned
involves analysis interpretation of data and synthesis of
information.
PO5:
Strongly mapped as student will able to understand
memory management, and storage capabilities,
facilitating the development of sophisticated software
solutions and the integration of advanced technologies
PO12:
Strongly mapped as the learning outcome prepares the
learner for self-learning the working of different
memory technique.
PSO1:
Strongly mapped as the knowledge gained.
PSO2:
Strongly mapped as the knowledge gained will
contribute to the multidisciplinary approach of
Techniques.
PSO3:
Strongly mapped the student able to design, develop,
and test system and application software for both
distributed and centralized computing environments,
ensuring compatibility across various domains and
platforms through thorough verification processes
Gaps in the Syllabus-To Meet Industry/Professional Requirements, Pos :

S.No. Description Proposed Actions

Guest lectures / demos will be
1. Exposure to modern techniques and tools.
Arranged to meet the outcome PO6.
Expert talk will be arranged to
2. Practical exposure to real time applications.
Meet the outcome PO8
Work shop will be organized to meet
Providing Industrial experiences by conducting
3. theoutcomesPO6, PO7, PO8, PO9,
workshop on C PROGRAMMING
PO10, PO11.
PROPOSEDACTIONS: ASSIGNMENT/INDUSTRYVISIT/GUESTLECTURE/NPTELetc.

Topics beyond the Syllabus:

S.No Topic TeachingMethod
ExpertTalk/
1. Examples of increment and decrement (Pre/Post) operators on different GuestLecture
IDEs. Working of Bitwise operators via program

ExpertTalk
2. Explore the working of function in terms of memory utilization.
Write a C program to convert a 10 base number into 2 base
number.(Binary).
ExpertTalk/
3. Design user defined function to copy string. *Design user defined function GuestLecture
co concatenate two strings.

4. Pointer,Address Mapping,Importance of pointer,Risks while using GuestLecture

pointers. Write a program in C to read 5X5 matrix using array and
calculate product of diagonal elements.

5. Data structure,Derived data types. Develop structures for Library DEMO

Management System,Hostel Management System,Hospital Management
System
Lesson Plan:

Teaching
S.No. Topic/Sub Topic Reference
Method
1 Steps to solve problems T1:1-4 C&T
2 algorithm, T2:6-7 C&T
3 Pseudo code T2:6-7 C&T
4 Flowchart with examples T1:77-86 C&T
5 Program Development Environments T1:83-175 S/P
6 Programming languages and generations S/P
T1:83-175
7 Introduction to C. structure of C program C&T
T1:105-109
8 keywords, identifiers, C&T
T1:35-40
9 Variables, data types C&T
T1:35-40
10 Constants, I/O statements, C&T, S/P
T1:41-50
11 operators, C&T
T1:50-54
12 precedence and associatively. C&T
T1:56-65
13 Selective statements C&T, S/P
T1:56-65
14 looping statements C&T, S/P
T1:56-65
15 nested statements C&T, S/P
T1:56-65
16 jumping statements. C&T
T1:66-70
17 Arrays: Introduction, declaration of arrays S/P, C&T
T1:286-290
18 accessing and storage of array elements T1:286-290 C&T
19 Linear search T2:608 S/P
20 binary search algorithms T2:106-108 S/P,C&T
21 Selection sort T2:537-539 C&T
22 Bubble sort T2:558-560 C&T
23 multidimensional arrays T1:286-290 S/P
24 matrix operations. T1:286-290 ET/GL
25 Strings: Declaration and Initialization, T1:334-350 S/P,C&T
26 String Input / Output functions, T1:334-350 S/P,C&T
27 String manipulation functions T1:334-350 C&T
28 Functions T1:470-475 S/P
29 Types of functions, T1:470-475 S/P,C&T
30 recursion T2:45-48 S/P,C&T
31 scope of variables T1:129-135 S/P,C&T
32 storage classes T1:129-135 S/P,DEMO
33 Preprocessor Directives: T1:457-465 S/P,C&T
34 Types of preprocessor directives, examples. T1:457-465 C&T
35 Pointers: Understanding computer‘s memory, T1:457-465 S/P
36 introduction to pointers T1:457-468 S/P,C&T
37 declaration pointer variables T1:457-468 S/P,C&T
38 pointer arithmetic S/P,C&T,
T1:457-468
DEMO
 39 pointers and strings T1:334
S/P,C&T
40 array of pointers T1:286 C&T
41 function pointers T1:475 S/P
42 dynamic memory allocation T1:312 S/P,C&T,DEMO
43 advantages and drawbacks of pointers T1:336 S/P
44 Structures: Structure definition, initialization T1:127-135 S/P,C&T
45 accessing the members of a structure T1:127-135 S/P
46 nested structures T1:135-139 S/P,C&T,DEMO
47 array of structures, T1:127-147 S/P
48 structures and functions T1:127-147 S/P,C&T
49 structures and pointers T1:127-147 S/P,C&T,
50 self-referential structures T1:127-147 DEMO
51 unions and enumerated data types. T1:127-147 C&T
52 Files: Introduction to files T1:372-385 C&T
53 file operations T1:372-385 C&T
54 reading and writing data on files T1:372-385 C&T
55 error handling during file operations T1:372-385 C&T

Teaching Methods:

C&T: -Chalk & Talk; S/P: -Slides/PPT; Videos; SEM: Seminar; DEMO; CHART; ET/GL:
Expert Talk/Guest Lecture; QUIZ; GD: -Group discussion; RTCS: Real time case studies;
JAR: -Journalarticlereview; PD: -Poster design; OL: -Online lecture/Google class room.
TEXTBOOKS(T):

1."The C Programming Language”, BrianW.KernighanandDennisM. Ritchie, Prentice-

Hall,1988.

2. C Programming and Data Structures. B.A. Forouzan, R. F.Gilberg, Cengage learning, Indian
edition.
3. C and Data Structures, E.Balaguruswamy, Tata McGraw Hill.
4. Programming in C and Data Structures, J.R.Hanly, Ashok N. Kamthane and A. Ananda Rao,
Pearson Education.

REFERENCEBOOKS(R):

1. LET US C, YeswanthKanitkar, Ninth Edition, BPB Publication

2. Byron Gottfried, Schaum ‘s‖ Outline of Programming with C, McGraw-Hill.
3. Brian W. Kernighan and Dennis M. Ritchie, The C Programming Language, Prentice Hall of
India.
4. A K Sharma ―Computer Fundamentals and Programming‖, 2nd Edition, University Press,
2018.
5. Pradeep Dey and Manas Ghosh, ―Programming in C‖, Oxford Press, 2ndEdition, 2017
6. ReemaTharaja ―Introduction to C Programming‖, Second Edition, OXFORD Press, 2015

WEBRESOURCES(WR):

1. https://www.cprogramming.com/
2.elearning.vtu.ac.in/content/courses/video/BS/15PCD23.html
3. https://nptel.ac.in/courses/106/105/106105171/
MOOC courses can be adopted for more clarity in understanding the topics and verities
of problem-solving methods.

AssessmentMethodologies:
1. Assignments
2. Tests
3. Reportwriting
4. Presentation
5. Universityexamination

Innovations in Teaching/Learning/Assessment Processes:

• E-Learning material, demonstrations, fieldvisits areextensively used.

• Incentive based class room interaction.
• Need based online sessions beyond class hours.
• Assessment process promotes self-learning, written and oral communication skills.

Faculty Signature
Periodic Monitoring:
Review1 Review2
Course Activity From T From To
o
NOV’22 DEC’22 DEC’22 FEB’23
Syllabus covered(%) 100% 100%
Planned(No.) 30 26
Lectures
Taken(No.) 32 26
Tutorials/Remedial Planned(No.) 0 1
Class Taken(No.) 0 1
Planned(No.) 03 02
Assignments
Taken(No.) 03 02
Planned 26.12.22 28.12.22
CA1,CA2 Dates
TakenDates 26.12.22 28.12.22
Specify any other Planned 01.11.22 24.12.22 11.02.23
(Fieldvisit, Guest Dates
lecture,Workshop,Semina TakenDates 01.11.22 24.12.22 11.02.23
retc.asmentionedinLesson
Plan)
SignatureofFaculty
SignatureofProgrammeCoordinator

SignatureofHOD