We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 2
Rajiv Gandhi University of Knowledge Technologies -
Nuzvid RKV/Srikakulam/Ongole
Counte Courre 5
one ‘Course Name Cammery | ETP | cretis
CSHIOT Problem Solving and
ec ESC 310 4
Course Learning Objectives:
1, To understand the various steps in Program development
‘To understand the basic concepts in C Programming Language.
To leam about anays and character anays
To leam how to wate modular and readable C Programs
‘To understand the basic concepts of Pointers and Dyzamic memory allocation
‘To understand the usage of Structure and Unions and about file operations
Course Content:
UNIT-1 0 Contact hours)
Introduction to Computer Programming: Computing Envizonments, Computer
Languages, Creating and Running Programs. Algorithms and Flow charts
Definition of Algorithms and examples, Intoduction to C Language - Background, C
Identifiers, Data Types, Operators, Vauiables, Constants, Input / Output, Expressions, C
Programs, Precedence and Assoviativity, Evaluating Exyessions, Type Conversion,
Statements, Bitwise Operators
UNTI (G0 Contact hours)
Conditional Statements and Loops: ifels, switch Statements, Standard Functions.
Repetition: loops, while, for, do-while statements, Loop examples, beak, continue and
GOTO statements
UNT-W 8 Contact hours)
Arrays: Anay Concepés, Using Anays in C, Anay Applications, Two. Dimensional Amays,
‘Multidimensional Anays;
Strings: Declaring, Initializing, Printing and reading strings, string manipulation functions,
String input and output fmtions, nay of stings,
UNIT-IV (2 Contact hours)
Functions: Designing Structured Programs, Function Basics, User Defined Functions, Inter
Function Communication, Standard Functions, Recusion- Recuisive Functions, Preprocessor
Commands, Stings - Concepts, C Stings, Stung Input / Output Functions, Anaye of Stings,
String Manipulation Functions
UNT-V 0 Contact hours)
Pointers: Introduction, Pointers to Pointers, Compatibility, void Pointers, Anays and
Pointers, Pointer constants, Pointers and Stings, Pointers to Functions, Pointers to Constant
(Objects, Constant Pointers, Pointer Anthmetic. Call-by-reference: Pointers for Inter Function
Communication, Passing Anays to a Function,
Dynamic Memory Allocation: Memory Allocetion Functions, Programming Applications,
(Command-line Arguments
6Rajiv Gandhi University of Knowledge Technologies -
Nuzvid RKV/Srikakulam/Ongole
UNIT-VI (G0 Contact hours)
‘The Type Definition (type def), Enumerated Types
Structure& Union: Definition and Initialization of Structures, Accessing Structures, Nested
Structues, Anayg of Structures, Stuctuzes and Functions Pointers to Structures, Self
Referential Structures, definition and Initialization of Union, Accessing of Union
Files: Input and Output: Files, Steams, Standard lizary Input Outpat Functions, Character
Input Output Functions
Learning resources,
Textbook:
1. Reema Tharej, “ Programming in C”, Oxford Publications, 2 Edition
Reference Books:
1. E. BalaguniSwamy, “ Programming in ANSIC”, Me Graw Hill, 7 Edition
2, Brian W. Kemighan, Dennis M Ritchie, “ The C Programming Language”, Prentice
Hall, 2 Edition
Web resources:
Indian Institute of Technology, Kharagpur, “Problem Solving through Programming in
(C”, bt Inpte] ec in/eowses/106105171/
Course outcomes: At the end ofthe couse, the student willbe able to
TOT_| Develop Hawcharir, algonitins for given complex problems
TO1_[ Analyze basic programming constructs
Gog | Wie C prograns for real world problems Implement C programing By
using various contol structures
COS_| Able to wate ute modular and readable C Programs
(COS_| Able to use pointers in C prog:
amg
‘COS | Appreciate coding standards and best practices for wogvam development
For Theory couses ony:
‘Course Nature I Theory
‘Assesment Metiod
BREEN eckiyteats | Monthlytess | EndSenesterTest | Total
gigs TLIO 0% 30% 10%
v