Scribd
Upload
34 views3 pages

PST Syllabus - SEP

The document outlines a course on Problem Solving Techniques using C programming, with a total of 48 teaching hours. It includes objectives such as learning data types, algorithms, flowcharts, and programming features of C, along with specific units covering fundamental algorithms, C programming, factoring methods, and sorting and searching techniques. The course also features a variety of textbooks, reference materials, and a course articulation matrix mapping outcomes to program outcomes.

Uploaded by

jadugark80
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
34 views3 pages

PST Syllabus - SEP

The document outlines a course on Problem Solving Techniques using C programming, with a total of 48 teaching hours. It includes objectives such as learning data types, algorithms, flowcharts, and programming features of C, along with specific units covering fundamental algorithms, C programming, factoring methods, and sorting and searching techniques. The course also features a variety of textbooks, reference materials, and a course articulation matrix mapping outcomes to program outcomes.

Uploaded by

jadugark80
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/ 3

CA-C2T: PROBLEM SOLVING TECHNIQUES

Total Teaching Hours: 48 No of Hours / Week: 03

COURSE OBJECTIVES

Learn data types, keywords and control structures of C


Learn to write algorithms for the given Problems.
Learn to write Flowcharts for the given Problems.
Learn to map problems to programming features of C.
Learn the looping and functions concept.
Learn to write C programs.

COURSE OUTCOMES [COs]

CO1 To understand algorithmic strategies for enhancing problem solving proficiency.


CO2 Demonstrate problem solving tools and techniques using C.
CO3 To analyze the given problems and use appropriate algorithms.
CO4 To implement sorting and searching techniques to develop programs.

UNIT 1: INTRODUCTION [12 HOURS]

Introduction: The Role of Algorithms in computing, Algorithms as a technology, analyzing


algorithms, Designing algorithms, Flow charts.

Fundamental Algorithms: Exchanging the values of two variables, Counting, Summation of a


set of numbers, Factorial Computation, Generating of Fibonacci sequence Reversing the digits of
an integer, Character to number conversion.

UNIT 2: C PROGRAMMING [12 HOURS]

C Programming: Getting Started, Variables, Operators and Arithmetic expressions.

Input and Output: Standard input and output, formatted input and output.

Selection statements: Statements and Blocks, If, If else, if else if ladder, nested if, switch.

Control Structure: while loop, for loop, do while loop, break and continue, goto and labels.

Pointers and Arrays: Pointers and address, Pointers and function arguments, One Dimensional
array, Two-Dimensional array, Structures and Union, Command line arguments.

UNIT 3: FACTORING METHODS [12 HOURS]

Factoring Methods: Finding the square root of a number, the smallest Divisor of an integer, the
greatest common divisor of two integers, computing the prime factor of an integer, raising a
number to a large power.

Array Techniques: Array order reversal, Array counting, Finding the maximum number in a set,
removal of duplicates from an ordered array, partitioning an array, finding the kth smallest
element, and multiplication of two matrices.

UNIT 4: SORTING & SEARCHING [12 HOURS]

Sorting: Sorting by selection, sorting by exchange, sorting by insertion, sorting by diminishing


increment, sorting by partitioning.
Searching: Linear Search, Binary search. Text processing and Pattern searching: Text line length
adjustment, keyboard searching in text, text line editing, linear pattern searching.

TEXTBOOK:

1. R.G.Dromey, “How to Solve it by Computer”, Pearson Education India, 2008.


2. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, “Introduction to
Algorithms”, 3rd Edition, The MIT Press Cambridge, Massachusetts London, England, 2008
3. Brain M. Kernighan, and Dennis M. Ritchie, “The C Programming Language”, 2nd edition,
Princeton Hall Software Series, 2012.

REFERENCE BOOKS

1. E. Balaguruswamy, “Programming In ANSI C”, 4 th edition, TMH Publications, 2007


2. Greg Perry and Dean Miller, “C programming Absolute Beginner’s Guide”, 3 rd edition, Pearson
Education, Inc, 2014.
3. Donald E. Knuth, The Art of Computer Programming”, Volume 2: Semi numerical Algorithms,
3rd Edition Addison Wesley Longman, 1998.
WEB RESOURCES

1. http://algorithmsforinterviews.com “Algorithms for Interviews”.


2. https://cppinstitute.org/cle
3. https://www.coursera.org/specializations/c-programming
Course Articulation Matrix: Mapping of Course Outcomes (COs) with Program Outcomes (POs)

Course Program Outcomes [Pos]


Outcome
(COs) 1 2 3 4 5 6 7 8 9 10 11 12

CO1 3 3 1 1 1 1 2 1 1 1 2 1

CO2 3 3 3 2 1 1 1 1 1 1 2 1

CO3 3 3 1 1 1 1 1 1 1 1 2 1

CO4 3 3 2 2 1 1 1 1 1 1 2 1

Formative Assessment for Theory


Assessment Occasion Type Marks
C1 Sessional Tests 5
C-1Seminars/Presentations 5
C-2SessionalTests 5
Case Study/Assignment/Project work
etc. 5

Total 20
Formative Assessments as per SEP guidelines are compulsory

You might also like