U18CSI1202-Problem Solving and Programming

Download as pdf or txt
Download as pdf or txt
You are on page 1of 3

L T P J C

2 0 2 0 3
U18CSI1202 PROBLEM SOLVING AND PROGRAMMING USING C

COURSE OUTCOMES
AFTER SUCCESSFUL COMPLETION OF THIS COURSE, THE STUDENTS SHOULD BE ABLE TO

CO1: Acquire knowledge on different problem solving techniques.


CO2: Use appropriate data types and control structures for solving a given problem.
CO3: Execute different array and string operations.
CO4: Experiment with the usage of pointers and functions.
CO5: Organize data using structures and unions.

Pre-requisites :Nil

CO/PO MAPPING
(S/M/W indicates strength of correlation) S-Strong, M-Medium, W-Weak
PROGRAMME OUTCOMES (POs)
COs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 S M L
CO2 S M L L
CO3 S L L L L L L
CO4 M L M L L L L L M
CO5 M L M L L L L L M

COURSE ASSESSMENT METHODS


DIRECT
1. Continuous Assessment Test I, II (Theory Component)
2. Assignment (Theory Component)
3. Group Presentation (Theory Component)
4. Pre/Post - experiment Test/Viva; Experimental Report for each experiment (lab
component)
5. Model examination (lab component)
6. End Semester Examination (Theory and lab component)
INDIRECT
1. Course-end survey

THEORY COMPONENT CONTENTS

STRUCTURED PROGRAMMING 6 Hours

Algorithms, building blocks of algorithms (instructions/statements, state, control flow,


functions), notation (pseudo code, flow chart, programming language), algorithmic problem
solving, simple strategies for developing algorithms (iteration). Introduction to C Programming
– Operators and Expressions – Data Input and Output – Control Statements.

ARRAYS AND STRINGS 6 Hours

Defining an array – Processing an array –Multidimensional Arrays Character Arithmetic –


Defining a string – Initialization of Strings – Reading and Writing Strings – Processing Strings
–Searching and Sorting of Strings

FUNCTIONS, STORAGE CLASSES 6 Hours

Defining a function – Accessing a function – Function prototypes – Passing arguments to a


function – Passing arrays to functions – Function with string - Recursion – Storage classes

POINTERS 7 Hours

Pointer Fundamentals – Pointer Declaration – Passing Pointers to a Function – Pointers and


one dimensional arrays – operations on pointers– Dynamic memory allocation.

STRUCTURES AND UNIONS 5 Hours

Structures and Unions: Defining a Structure – Processing a Structure – User defined data types
(Typedef) – Unions

Theory: 30 Tutorial: 0 Practical: 0 Project: 0 Total: 30 Hours

REFERENCES
1. Byron S Gottfried and Jitendar Kumar Chhabra, “Programming with C”, Tata
McGraw Hill Publishing Company, Third Edition, New Delhi, 2011.
2. Pradip Dey and Manas Ghosh, “Programming in C”, Second Edition, Oxford
University Press, 2011.
3. Kernighan,B.W and Ritchie,D.M, “The C Programming language”, Second Edition,
Pearson Education, 2006
4. Ashok N. Kamthane, “Computer programming”, Pearson Education, 2007.
5. Reema Thareja, “Programming in C”, Second Edition, Oxford University Press,
2011.
LAB COMPONENT CONTENTS
LIST OF EXPERIMENTS 30 Hours
1. Writing algorithms, flowcharts and pseudo codes for simple problems.
2. Programs on expressions and conversions
3. Programs using if, if-else, switch and nested if statements
4. Programs using while, do-while, for loops
5. Programs on one dimensional arrays, passing arrays to functions and array operations
6. Programs using two dimensional arrays, passing 2D arrays to functions
7. Programs using String functions
8. Programs using function calls, recursion, call by value
9. Programs on pointer operators, call by reference, pointers with arrays
10. Programs using structures and unions.

Theory: 0 Tutorial: 0 Practical: 30 Project: 0 Total: 30 Hours

REFERENCES
1. Byron S Gottfried and Jitendar Kumar Chhabra, “Programming with C”, Tata
McGraw Hill Publishing Company, Third Edition, New Delhi, 2011.
2. Pradip Dey and Manas Ghosh, “Programming in C”, Second Edition, Oxford
University Press, 2011.
3. Kernighan,B.W and Ritchie,D.M, “The C Programming language”, Second Edition,
Pearson Education, 2006
4. Ashok N. Kamthane, “Computer programming”, Pearson Education, 2007.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy