0% found this document useful (0 votes)
18 views2 pages

R24-CPS LAB Syllabus AU

The document outlines the course structure for the Computational Problem Solving Lab at Annamacharya University, detailing objectives, exercises, and learning outcomes for first-year B.Tech students. It covers essential programming concepts using C, including data types, control statements, functions, pointers, and file handling. The course aims to develop programming skills and problem-solving abilities through practical exercises and assessments.

Uploaded by

gt60022006
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
18 views2 pages

R24-CPS LAB Syllabus AU

The document outlines the course structure for the Computational Problem Solving Lab at Annamacharya University, detailing objectives, exercises, and learning outcomes for first-year B.Tech students. It covers essential programming concepts using C, including data types, control statements, functions, pointers, and file handling. The course aims to develop programming skills and problem-solving abilities through practical exercises and assessments.

Uploaded by

gt60022006
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

ANNAMACHARYA UNIVERSITY

EXCELLENCE IN EDUCATION; SERVICE TO SOCIETY


(ESTD, UNDER AP PRIVATE UNIVERSITIES (ESTABLISHMENT AND REGULATION) ACT, 2016)

Title of the Course Computational Problem Solving Lab


Category ESC(LAB)
Course Code 24ACSE11L

Year I B. Tech.
Semester I Semester
Branch Common to all branches

Lecture Hours Tutorial Hours Practice Hours Credits


0 0 3 1.5

Course Objectives:
 Setting up programming environment.
 Develop Programming skills to solve problems.
 Use of appropriate C programming constructs to implement algorithms.
 Identification and rectification of coding errors in program
 Develop applications using a modular programming and Manage data using files.

Minimum number of FOUR programs from each exercise is to be done students


Data Types, Constants, Input and Output and expressions
Exercise 1: Data types, Variables, Constants and Input and Output.
Exercise 2: Operators, Expressions and Type Conversions. Learning Outcomes
At the end of this module, the student will be able to:
 Identify situations where computational methods and computers would be useful. (L2)
 Approach the programming tasks using techniques learned and write pseudo-code. (L2)
 Write the program on a computer, edit, compile, debug, correct, recompile and run it. (L4)

Decision Control Statements and Arrays


Exercise 3: Conditional Statements [two way and multipath].
Exercise 4: Loop Control Statements. [for, while and do-While]
Exercise 5: Unconditioned JUMP Statements- break, continue, goto.
Exercise 6: Declaring Arrays, Referencing Arrays, Array Subscripts. Using for loop for sequential Access.
Exercise 7: Multidimensional Arrays
Learning Outcomes
At the end of this module, the student will be able to:
 Choose the right data representation formats based on the requirements of the problem. (L3)
 Use the comparisons and limitations of the various programming constructs and choose the right one for the
task in hand. (L3)
 Identify tasks in arrays with different techniques that are applicable and apply them to write programs. (L2)
 Design and implement operations on both single and Multidimensional arrays. (L6)

Strings and Functions


Exercise 8: String Basics, String Library Functions and Array of Strings.
Exercise 9: Simple user defined functions, Parameter passing methods- pass by value, pass by reference.
Exercise 10: Storage classes- Auto, Register, Static and Extern
Exercise 11: Recursive Functions, Preprocessor commands.
Exercise 12: Array Elements as Function Arguments. Learning
Outcomes:
At the end of this module, the student will be able to:
 Implement and test the programs on strings using string manipulation functions. (L5)
 Analyze programming problems to choose when regular loops should be used and when recursion will
produce a better program (L4)
ANNAMACHARYA UNIVERSITY
EXCELLENCE IN EDUCATION; SERVICE TO SOCIETY
(ESTD, UNDER AP PRIVATE UNIVERSITIES (ESTABLISHMENT AND REGULATION) ACT, 2016)

Pointers
Exercise 13: Pointers, Dynamic memory allocation and error handling
Learning Outcomes:
At the end of this module, the student will be able to:
 Design and develop Computer programs, analyzes, and interprets the concept of pointers and their
usage. (L6)
 Identify tasks in which the dynamic memory allocation techniques learned are applicable and apply them to
write programs, and hence use computers effectively to solve the task. (L2)

Structures and Files


Exercise 14: Structures
Exercise 15: File handling
Learning Outcomes:
At the end of this module, the student will be able to:
 Define structure data types and use them in simple data processing applications. (L2)
 Develop and test C programs for simple applications using files. (L6)

Prescribed Text Books:


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

Reference Books:
1. Let Us C, YeswanthKanitkar, Ninth Edition, BPB Publication
2. A K Sharma ―Computer Fundamentals and Programming‖, 2nd Edition, University Press, 2018.
3. PradeepDey and Manas Ghosh, ―Programming in C‖, Oxford Press, 2ndEdition, 2017
4. ReemaTharaja ―Introduction to C Programming‖, Second Edition, OXFORD Press, 2015
5. https://www.cprogramming.com/
6. https://www.mycplus.com/tutorials/c-programming-tutorials

Course Outcomes:
At the end of the course, the student will be able to Blooms Level of Learning
1. Identify and setup program development environment L2
2. Implement the algorithms using C programming language constructs L5
3. Identify and rectify the syntax errors and debug program for semantic errors L3
4. Solve problems in a modular approach using functions L5
5. Implement file operations with simple text data L5

COs-POs-PSOs Mapping Table:


PSO1

PSO2

PSO3
PO10

PO11

PO12
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9

CO

20A511L.1 3 3 - 3 3 - - - 3 1 1 - 3 - -
20A511L.2 3 3 - - - - - - 3 - - - 3 - -
20A511L.3 3 3 3 3 - - - - 3 - - 3 3 - -
20A511L.4 3 3 3 3 - - - - - - - 3 3 - -
20A511L.5 3 3 3 3 - - - - - - - 3 3 - -

You might also like