Title Programming For Problem Solving All Unit Notes.pdf ✅

Programming for Problem Solving (KCS-101/KCS-201) || S.K. Swarnakar@IT-GCET 6 Lecture Notes || Unit -1 || Lecture Number-1 Topic Introduction of subject, Syllabus, COs, Teaching-learning strategy. Lecture Objective To know about subject, Syllabus, COs and Teaching Learning Strategy. Lecture structure  What do you mean by the term “Programming for Problem solving”?  Syllabus  What is NBA?  Course Outcome Vs Programme Outcome  Teaching Learning Strategy Related Questions a) State COs of PPS. b) What is NBA? c) Differentiate PO and CO. What do you mean by the term “Programming for Problem Solving”?  Solving problems is the core of computer science. Programmers must first understand how a human solves a problem, then understand how to translate this "algorithm" into something a computer can do, and finally how to "write" the specific syntax (required by a computer) to get the job done. It is sometimes the case that a machine will solve a problem in a completely different way than a human.  Especially when it comes to programming, problem-solving is the must. If you do not develop sound problem-solving skills, you will end up messing around with a given problem, and you would not be able to obtain a solution for ages.  Computer Programmers are problem solvers. In order to solve a problem on a computer you must: Know how to represent the information (data) describing the problem &Determine the steps to transform the information from one representation into another.
Programming for Problem Solving (KCS-101/KCS-201) || S.K. Swarnakar@IT-GCET 7 Syllabus Unit Wise Unit – 1 : (Introduction to Programming) Introduction to components of a computer system: Memory, processor, I/O Devices, storage, operating system, Concept of assembler, compiler, interpreter, loader and linker. Idea of Algorithm: Representation of Algorithm, Flowchart, Pseudo code with examples, From algorithms to programs, source code. Programming Basics: Structure of C program, writing and executing the first C program, Syntax and logical errors in compilation, object and executable code. Components of C language. Standard I/O in C, Fundamental data types, Variables and memory locations, Storage classes. Unit – 2 : (Arithmetic expressions & Conditional Branching) Arithmetic expressions and precedence: Operators and expression using numeric and relational operators, mixed operands, type conversion, logical operators, bit operations, assignment operator, operator precedence and associativity. Conditional Branching: Applying if and switch statements, nesting if and else, use of break and default with switch. Unit– 3 : (Loops ) Iteration and loops: use of while, do while and for loops, multiple loop variables, use of break and continue statements. Functions Functions: Introduction, types of functions, functions with array, passing parameters to functions, call by value, call by reference, recursive functions. Unit – 4 : (Arrays & Basic Algorithms) Arrays: Array notation and representation, manipulating array elements, using multi- dimensional arrays. Character arrays and strings, Structure, union, enumerated data types, Array of structures, passing arrays to functions. Basic Algorithms: Searching &Basic Sorting Algorithms (Bubble, Insertion and Selection), Finding roots of equations, Notion of order of complexity. Unit– 5 :( Pointer& File Handling) Pointers: Introduction, declaration, applications, Introduction to dynamic memory allocation (malloc, calloc, realloc, free), Use of pointers in self-referential structures, notion of linked list (no implementation) File handling: File I/O functions, Standard C preprocessors, defining and calling macros, command-line arguments.
Programming for Problem Solving (KCS-101/KCS-201) || S.K. Swarnakar@IT-GCET 8 Syllabus CO Wise CO-1: To develop simple algorithms for arithmetic and logical problems. Introduction of subject, Syllabus, CO, PO, teaching-learning strategy. Introduction to components of a computer system: Memory, processor I/O Devices, storage operating system Concept of assembler, compiler, interpreter, loader and linker. Idea of Algorithm: Representation of Algorithm Flowchart, Pseudo code with examples, From algorithms to programs, source code. CO-2:To translate the algorithms to programs & execution (in C language). Programming Basics: Structure of C Program Writing and executing the first C program, Syntax and logical errors in compilation, object and executable code. Components of C language. Standard I/O in C, Fundamental data types, Variables and memory locations, Storage classes Operators and expression using numeric and relational operators, mixed operands, Type conversion Logical operators, bit operations, assignment operator, Operator precedence and associativity. CO-3: To implement conditional branching, iteration and recursion. Applying if statement Applying switch statement Nesting if and else Use of break and default with switch. Use of while, do while Use of for loops Multiple loop variables, use of break and continue statements. CO-4: To decompose a problem into functions and synthesize a complete program using divide and conquer approach. Functions: Introduction, Types of functions Passing parameters to functions, call by value Call by reference Recursive functions. Functions with array CO-5: To use arrays, pointers and structures to develop algorithms and programs. Arrays: Array notation and representation, manipulating array elements Using multi- dimensional arrays passing arrays to functions Character arrays and strings Structure Array of structures Union, enumerated data types Basic Algorithms: Searching Basic Sorting Algorithms (Bubble, Insertion) Selection Sorting Finding roots of equations, Notion of order of complexity Pointers: Introduction, declaration, applications Introduction to dynamic memory allocation (malloc, calloc, realloc, free) Use of pointers in self-referential structures Notion of linked list (no implementation) File handling: File I/O functions File handling: File I/O functions Standard C preprocessors Defining and calling macros, command-line arguments
Programming for Problem Solving (KCS-101/KCS-201) || S.K. Swarnakar@IT-GCET 9 What is NBA?  The National Board of Accreditation (NBA) is one of the two major bodies responsible for accreditation of higher education institutions in India, along with the National Assessment and Accreditation Council (NAAC).  NBA accredits technical programmes, such engineering and management programmes, while NAAC accredits general colleges and universities.  NBA was established by the All India Council for Technical Education (AICTE) in 1994 and operated as an autonomous body since 2010.  In 2014 it was granted a full membership status in the Washington Accord.  The NBA accredits programmes and not institutes.