programming for problem solving notes pdf aktu

Programming for Problem Solving Notes

Download programming for problem solving notes aktu b-tech 1st year handwritten notes, introduction.

C programming is a fundamental skill for students pursuing a B.Tech degree from AKTU (Dr. A.P.J. Abdul Kalam Technical University) or any other university. This article aims to provide an overview of C programming for problem solving and offers the opportunity to download AKTU B.Tech 1st Year notes for C programming.

How to Download Programming for Problem Solving Notes for free?

It is very simple to download programming for problem solving notes, just click at the given link get pdf.

Get Other handwritten Notes for Aktu B-tech 1st year, Get Other Subjects Notes Pdf

Overview of C Programming

C programming is a powerful and popular programming language widely used in software development, system programming, and embedded systems. It was developed by Dennis Ritchie in the early 1970s and has since become one of the most widely used programming languages due to its efficiency, flexibility, and portability.

Importance of C Programming for Problem Solving

C programming plays a crucial role in developing problem-solving skills. It helps students think logically, break down complex problems into smaller tasks, and implement efficient solutions. By learning C programming, students gain a strong foundation in programming concepts and acquire the ability to write efficient and optimized code.

Benefits of Learning C Programming

Learning C programming offers several benefits to students. Firstly, it provides a solid foundation for learning other programming languages as C serves as the basis for many modern programming languages. Secondly, C programming helps in understanding low-level computer architecture, memory management, and system operations. Thirdly, it enhances problem-solving abilities and fosters a systematic approach to coding.

Structure of C Programming Language

The C programming language follows a structured approach with a clear syntax and set of rules. It consists of functions, variables, control structures, and data types. The structure allows programmers to organize their code into modules, making it easier to read, understand, and maintain.

Variables and Data Types in C

In C programming, variables are used to store data values that can be manipulated during program execution. C supports various data types such as integers, floating-point numbers, characters, and more. Understanding different data types and their limitations is crucial for effective programming.

Input and Output in C

Input and output operations are essential for any program to interact with the user or external devices. C provides functions like scanf and printf to handle input and output operations respectively. These functions enable users to input data and display results on the screen.

Control Structures in C

Control structures in C programming are used to control the flow of execution within a program. Common control structures include if-else statements, loops (for, while, and do-while), and switch-case statements. Mastering control structures helps in decision-making and looping scenarios.

Functions in C

Functions are an integral part of C programming as they allow code reuse and modularity. A function is a block of code that performs a specific task and can be called from anywhere within the program. Understanding function declaration, definition, and invocation is crucial for writing modular code.

Arrays and Strings in C

Arrays and strings are used to store multiple values of the same data type. Arrays allow storing a fixed number of elements, while strings are arrays of characters terminated by a null character. Knowledge of arrays and strings is essential for working with collections of data.

Pointers in C

Pointers are variables that store memory addresses. They provide the ability to manipulate memory directly, enabling efficient memory management and passing addresses as function arguments. Understanding pointers is crucial for advanced data structures, dynamic memory allocation, and interacting with hardware devices.

Structures and Unions in C

Structures and unions are used to define complex data structures that can hold multiple values of different data types. Structures group related data items into a single unit, while unions allow sharing memory locations for different variables. These concepts are essential for organizing and manipulating complex data.

File Handling in C

File handling operations allow reading from and writing to files on disk. C provides functions such as fopen , fclose , fread , and fwrite to perform file operations. Understanding file handling is crucial for applications that require persistent data storage.

Debugging and Testing in C

Debugging is an essential skill in programming to identify and fix errors in code. C provides debugging tools and techniques to locate and rectify logical, syntax, and runtime errors. Additionally, writing test cases and performing unit testing ensures the correctness and reliability of the code.

C programming is a crucial skill for B.Tech students, enabling them to develop problem-solving abilities and gain a solid foundation in programming concepts. By understanding the structure, variables, control structures, functions, arrays, pointers, structures, file handling, and debugging in C, students can write efficient and optimized code. Utilize the resources available to enhance your learning and excel in C programming.

1 thought on “Programming for Problem Solving Notes”

• Pingback: aktu notes B-tech 1st year - aktuwallah

Leave a comment Cancel reply

Save my name, email, and website in this browser for the next time I comment.

Quantum books

Past Year papers

Youtube channels

(for each subject), quantum books.

Engineering Physics

Quantum book

Engineering Chemistry

Engineering Mathematics-I

Fundamentals of Electronics Engineering

Engineering Mathematics-II

Fundamentals of Electrical Engineering

Programming for Problem Solving

Fundamentals of Mechanical Engineering

Soft skills

Past year papers, previous year papers.

These are previous year question papers for solutions prefer last pages of quantum and some youtube channels

• ENGINEERING-CHEMISTRY-BAS-102
• ENGINEERING-MATHEMATICS-I-BAS-103
• ENGINEERING-PHYSICS-BAS-101
• ENVIRONMENT-AND-ECOLOGY-BAS-104
• Fundamentals-of-Electrical-Engineering-BEE-101
• FUNDAMENTALS-OF-ELECTRONICS-ENGINEERING-BEC-101
• Fundamentals-of-Mechanical-Engineering-BME-101
• PROGRAMMING-FOR-PROBLEM-SOLVING-BCS-101
• SOFT-SKILLS-BAS-105
• PHYSICS-KAS-101-1
• ENGINEERING-MATHEMATICS-I-KAS-103T-1
• ENGINEERING-CHEMISTRY-KAS-102T-1
• FUNDAMENTALS-OF-MECHANICAL-ENGINEERING-MECHATRONICS-KME-101T-1
• AI-FOR-ENGINEERING-KMC101
• BASIC-ELECTRICAL-ENGG-KEE-101
• BASIC-ELECTRICAL-ENGINEERING-KEE-101T
• MATHEMATICS-I-KAS-103-2
• PROGRAMMING-FOR-PROBLEM-SOLVING-KCS-101-2
• SOFT-SKILL-I-KNC-101
• ARTIFICIAL-INTELLIGENCE-FOR-ENGINEERS-KMC-101
• BASIC-OF-ELECTRICAL-ENGINEERING-KEE-101T
• ENGINEERING-MATHEMATICS-I-KAS-103T
• EMERGING-DOMAIN-IN-ELECTRONICS-ENGINEERING-KEC-101T
• EMERGING-TECHNOLOGY-FOR-ENGINEERING-KMC-102
• ENGINEERING-CHEMISTRY-KAS-102T
• ENGINEERING-PHYSICS-KAS-101T-1
• PROGRAMMING-FOR-PROBLEM-SOLVING-KCS-101T-1
• SOFT-SKILLS-I-KNC-101
• BASIC-ELECTRICAL-ENGG.-KEE-101
• CHEMISTRY-KAS-102-1
• MATHEMATICS-I-KAS-103-1
• PHYSICS-KAS-101-
• PROGRAMMING-FOR-PROBLEM-SOLVING-KCS-101-1
• BASIC-ELECTRICAL-ENGINEERING-KEE-101
• CHEMISTRY-KAS-102
• MATHEMATICS-I-KAS-103
• PHYSICS-KAS-101
• PROGRAMMING-FOR-PROBLEM-SOLVING-KCS-101

For notes prefer this site: click here

Youtube channels.

FEARLESS INNOCENT MATH

Vaibhav Jain (For ECE )

Chemistry by Dr. Anjali Ssaxena

University Academy (For FEE)

gatewayclasses (For all subjects)

• Trending Now
• Foundational Courses
• Data Science
• Practice Problem
• Machine Learning
• System Design
• DevOps Tutorial
• AKTU 1st Year Sem 1 Solved Paper 2017-18 | COMP. SYSTEM & C PROGRAMMING | Sec A
• AKTU 1st Year Sem 1 Solved Paper 2017-18 | COMP. SYSTEM & C PROGRAMMING | Sec B

AKTU 1st Year Sem 1 Solved Paper 2017-18 | COMP. SYSTEM & C PROGRAMMING | Sec C

• AKTU 1st Year Sem 2 Solved Paper 2017-18 | COMP. SYSTEM & C PROGRAMMING | Sec A
• AKTU 1st Year Sem 2 Solved Paper 2017-18 | COMP. SYSTEM & C PROGRAMMING | Sec B
• AKTU 1st Year Sem 2 Solved Paper 2017-18 | COMP. SYSTEM & C PROGRAMMING | Sec C
• AKTU 1st Year Sem 1 Solved Paper 2016-17 | COMP. SYSTEM & C PROGRAMMING | Sec A
• AKTU 1st Year Sem 1 Solved Paper 2016-17 | COMP. SYSTEM & C PROGRAMMING | Sec B
• AKTU 1st Year Sem 1 Solved Paper 2016-17 | COMP. SYSTEM & C PROGRAMMING | Sec C
• AKTU 1st Year Sem 2 Solved Paper 2016-17 | COMP. SYSTEM & C PROGRAMMING | Sec A
• AKTU 1st Year Sem 2 Solved Paper 2016-17 | COMP. SYSTEM & C PROGRAMMING | Sec B
• AKTU 1st Year Sem 2 Solved Paper 2016-17 | COMP. SYSTEM & C PROGRAMMING | Sec C
• AKTU 1st Year Sem 1 Solved Paper 2015-16 | COMP. SYSTEM & C PROGRAMMING | Sec A
• AKTU 1st Year Sem 1 Solved Paper 2015-16 | COMP. SYSTEM & C PROGRAMMING | Sec B
• AKTU 1st Year Sem 1 Solved Paper 2015-16 | COMP. SYSTEM & C PROGRAMMING | Sec C
• AKTU 1st Year Sem 2 Solved Paper 2015-16 | COMP. SYSTEM & C PROGRAMMING | Sec A
• AKTU 1st Year Sem 2 Solved Paper 2015-16 | COMP. SYSTEM & C PROGRAMMING | Sec B
• AKTU 1st Year Sem 2 Solved Paper 2015-16 | COMP. SYSTEM & C PROGRAMMING | Sec C
• AKTU 1st Year Sem 1 Solved Paper 2014-15 | COMP. SYSTEM & C PROGRAMMING | Sec A
• AKTU 1st Year Sem 1 Solved Paper 2014-15 | COMP. SYSTEM & C PROGRAMMING | Sec B
• AKTU 1st Year Sem 2 Solved Paper 2014-15 | COMP. SYSTEM & C PROGRAMMING | Sec A
• AKTU 1st Year Sem 2 Solved Paper 2014-15 | COMP. SYSTEM & C PROGRAMMING | Sec B

Paper download link : Paper | Sem 1 | 2017-18

B.Tech. (SEM-I) THEORY EXAMINATION 2017-18 COMPUTER SYSTEM & PROGRAMMING IN C

Time: 3hrs Total Marks : 100 Note :-

• There are three sections. Section A carries 20 marks, Section B carries 30 marks and Section C carries 50 marks.
• Attempt all questions. Marks are indicated against each question.
• Assume suitable data wherever necessary.

Section – C

3. Attempt any two of the following: (2*5 = 10)

• auto : This is the default storage class for all the variables declared inside a function or a block. Hence, the keyword auto is rarely used while writing programs in C language. Auto variables can be only accessed within the block/function they have been declared and not outside them (which defines their scope). Of course, these can be accessed within nested blocks within the parent block/function in which the auto variable was declared. However, they can be accessed outside their scope as well using the concept of pointers given here by pointing to the very exact memory location where the variables resides. They are assigned a garbage value by default whenever they are declared.
• extern : Extern storage class simply tells us that the variable is defined elsewhere and not within the same block where it is used. Basically, the value is assigned to it in a different block and this can be overwritten/changed in a different block as well. So an extern variable is nothing but a global variable initialized with a legal value where it is declared in order to be used elsewhere. It can be accessed within any function/block. Also, a normal global variable can be made extern as well by placing the ‘extern’ keyword before its declaration/definition in any function/block. This basically signifies that we are not initializing a new variable but instead we are using/accessing the global variable only. The main purpose of using extern variables is that they can be accessed between two different files which are part of a large program. For more information on how extern variables work, have a look at this link .
• static : This storage class is used to declare static variables which are popularly used while writing programs in C language. Static variables have a property of preserving their value even after they are out of their scope! Hence, static variables preserve the value of their last use in their scope. So we can say that they are initialized only once and exist till the termination of the program. Thus, no new memory is allocated because they are not re-declared. Their scope is local to the function to which they were defined. Global static variables can be accessed anywhere in the program. By default, they are assigned the value 0 by the compiler.
• register : This storage class declares register variables which have the same functionality as that of the auto variables. The only difference is that the compiler tries to store these variables in the register of the microprocessor if a free register is available. This makes the use of register variables to be much faster than that of the variables stored in the memory during the runtime of the program. If a free register is not available, these are then stored in the memory only. Usually few variables which are to be accessed very frequently in a program are declared with the register keyword which improves the running time of the program. An important and interesting point to be noted here is that we cannot obtain the address of a register variable using pointers.
• Write a program to multiply two matrices ( read size and number of element of matrices from the keyboard).  
• char: The most basic data type in C. It stores a single character and requires a single byte of memory in almost all compilers.
• int: As the name suggests, an int variable is used to store an integer.
• float: It is used to store decimal numbers (numbers with floating point value) with single precision.
• double: It is used to store decimal numbers (numbers with floating point value) with double precision.

4. Attempt any two of the following: (2*5 = 10)

• What is recursion? Write a recursive program to find factorial of a number.   Recursion : The process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called as recursive function. Using recursive algorithm, certain problems can be solved quite easily. Examples of such problems are Towers of Hanoi (TOH) , Inorder/Preorder/Postorder Tree Traversals , DFS of Graph , etc. Base condition in recursion : In recursive program, the solution to base case is provided and solution of bigger problem is expressed in terms of smaller problems. Program to find factorial of a number:  
• Explain the difference between parameter passing mechanism call by value and call by reference. Which is more efficient and why? There are different ways in which parameter data can be passed into and out of methods and functions. Let us assume that a function B() is called from another function A() . In this case A is called the “caller function” and B is called the “called function or callee function” . Also, the arguments which A sends to B are called actual arguments and the parameters of B are called formal arguments .

Terminology

• Formal Parameter : A variable and its type as they appear in the prototype of the function or method.
• Actual Parameter : The variable or expression corresponding to a formal parameter that appears in the function or method call in the calling environment.
• IN: Passes info from caller to callee.
• OUT: Callee writes values in caller.
• IN/OUT: Caller tells callee value of variable, which may be updated by callee.

• Inefficiency in storage allocation
• For objects and arrays, the copy semantics are costly

• Many potential scenarios can occur
• Programs are difficult to understand sometimes
• Write a program to check a number is prime number or not.   Program to check a number is prime or not:  

5. Attempt any two of the following: (2*5 = 10)

• Creating areaperi.h : Write the below code and then save the file as areaperi.h . The extension should be .h indicating its a header file. 
• Including the areaperi.h file in other program : Now as we need to include stdio.h as #include in order to use printf() function. We will also need to include the above header file areaperi.h as #include”areaperi.h” . The ” ” here are used to instructs the preprocessor to look into the present folder and into the standard folder of all header files if not found in present folder. So, if you wish to use angular brackets instead of ” ” to include your header file you can save it in the standard folder of header files otherwise. If you are using ” ” you need to ensure that the header file you created is saved in the same folder in which you will save the C file using this header file.
• Using the created header file : 
• “r” – Searches file. If the file is opened successfully fopen( ) loads it into memory and sets up a pointer which points to the first character in it. If the file cannot be opened fopen( ) returns NULL.
• “w” – Searches file. If the file exists, its contents are overwritten. If the file doesn’t exist, a new file is created. Returns NULL, if unable to open file.
• “a” – Searches file. If the file is opened successfully fopen( ) loads it into memory and sets up a pointer that points to the last character in it. If the file doesn’t exist, a new file is created. Returns NULL, if unable to open file.
• “r+” – Searches file. If is opened successfully fopen( ) loads it into memory and sets up a pointer which points to the first character in it. Returns NULL, if unable to open the file.
• “w+” – Searches file. If the file exists, its contents are overwritten. If the file doesn’t exist a new file is created. Returns NULL, if unable to open file.
• “a+” – Searches file. If the file is opened successfully fopen( ) loads it into memory and sets up a pointer which points to the last character in it. If the file doesn’t exist, a new file is created. Returns NULL, if unable to open file.

•   How to declare structure variables? A structure variable can either be declared with structure declaration or as a separate declaration like basic types. 
• Note: In C++, the struct keyword is optional before in declaration of a variable. In C, it is mandatory. Program that compares two given dates:  

6. Attempt any two of the following: (2*5 = 10)

• Suppose a file contains student’s records with each record containing name and age of a student. Write a C program to read these records and display them in sorted order by name.  
• Write a program to sort a set of names stored in an array in alphabetical order .  
• Write a user define function to compare two strings where they are identical or not.  

7. Attempt any two of the following: (2*5 = 10)

• Define the concept of pointer> Also define the dynamic memory allocation and various functions for dynamic memory allocation, with suitable examples.   Pointers are symbolic representation of addresses. They enable programs to simulate call-by-reference as well as to create and manipulate dynamic data structures. It’s general declaration in C/C++ has the format:  Syntax:

• Define a pointer variable
• Assigning the address of a variable to a pointer using unary operator (&) which returns the address of that variable.
• Accessing the value stored in the address using unary operator (*) which returns the value of the variable located at the address specified by its operand.
• malloc() “malloc” or “memory allocation” method is used to dynamically allocate a single large block of memory with the specified size. It returns a pointer of type void which can be cast into a pointer of any form. Syntax:

• calloc() “calloc” or “contiguous allocation” method is used to dynamically allocate the specified number of blocks of memory of the specified type. It initializes each block with a default value ‘0’. Syntax:

• free() “free” method is used to dynamically de-allocate the memory. The memory allocated using functions malloc() and calloc() are not de-allocated on their own. Hence the free() method is used, whenever the dynamic memory allocation takes place. It helps to reduce wastage of memory by freeing it. Syntax:

• realloc() “realloc” or “re-allocation” method is used to dynamically change the memory allocation of a previously allocated memory. In other words, if the memory previously allocated with the help of malloc or calloc is insufficient, realloc can be used to dynamically re-allocate memory . Syntax:

• strcat : The strcat() function will append a copy of the source string to the end of destination string. The strcat() function takes two arguments: 1) dest 2) src It will append copy of the source string in the destination string. The terminating character at the end of dest is replaced by the first character of src . Return value: The strcat() function returns dest, the pointer to the destination string.
• strchr : In C/C++, strrchr() is a predefined function used for string handling. cstring is the header file required for string functions. This function Returns a pointer to the last occurrence of a character in a string. The character whose last occurrence we want to find in passed as the second argument to the function and the string in which we have to find the character is passed as the first argument to the function. Syntax
• Here, str is the string and c is the character to be located. It is passed as its int promotion, but it is internally converted back to char.
• strcmp : strcmp() is a built-in library function and is declared in <string.h> header file. This function takes two strings as arguments and compare these two strings lexicographically. Syntax: :
• strcmp() compares the two strings lexicographically means it starts comparison character by character starting from the first character until the characters in both strings are equal or a NULL character is encountered.
• If first character in both strings are equal, then this function will check the second character, if this is also equal then it will check the third and so on
• This process will be continued until a character in either string is NULL or the characters are unequal.
• strcpy : strcpy() is a standard library function in C/C++ and is used to copy one string to another. In C it is present in string.h header file and in C++ it is present in cstring header file. Syntax:
• dest : Pointer to the destination array where the content is to be copied.
• src: string which will be copied.
• strlen : The strlen() function calculates the length of a given string.The strlen() function is defined in string.h header file. It doesn’t count null character ‘\0’. Syntax:
• str: It represents the string variable whose length we have to find.
• the strings overlap.
• the dest array is not large enough to append the contents of src.
• dest : the string where we want to append.
• src : the string from which ‘n’ characters are going to append.
• n : represents maximum number of character to be appended. size_t is an unsigned integral type.
• This function takes two strings and a number num as arguments and compare at most first num bytes of both the strings.
• num should be at most equal to the length of the longest string. If num is defined greater than the string length then comparison is done till the null-character(‘\0’) of either string.
• This function compares the two strings lexicographically. It starts comparison from the first character of each string. If they are equal to each other, it continues and compare the next character of each string and so on.
• This process of comparison stops until a terminating null-character of either string is reached or num characters of both the strings matches.
• strncpy : The strncpy() function is similar to strcpy() function, except that at most n bytes of src are copied. If there is no NULL character among the first n character of src, the string placed in dest will not be NULL-terminated. If the length of src is less than n, strncpy() writes additional NULL character to dest to ensure that a total of n character are written. Syntax:
• src: The string which will be copied.
• dest: Pointer to the destination array where the content is to be copied.
• n: The first n character copied from src to dest.
• strrchr : The strrchr() function in C/C++ locates the last occurrence of a character in a string. It returns a pointer to the last occurrence in the string. The terminating null character is considered part of the C string. Therefore, it can also be located to retrieve a pointer to the end of a string. It is defined in cstring header file. Syntax :
• str : specifies the pointer to the null terminated string to be searched for.
• ch: specifies the character to be search for.
• (i) Stack with push and pop operation : Stack is a linear data structure which follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out).

Mainly the following three basic operations are performed in the stack:

• Push: Adds an item in the stack. If the stack is full, then it is said to be an Overflow condition.
• Pop: Removes an item from the stack. The items are popped in the reversed order in which they are pushed. If the stack is empty, then it is said to be an Underflow condition.
• Peek or Top: Returns top element of stack.
• isEmpty: Returns true if stack is empty, else false.
• Balancing of symbols
• Infix to Postfix /Prefix conversion
• Redo-undo features at many places like editors, photoshop.
• Forward and backward feature in web browsers
• Used in many algorithms like Tower of Hanoi, tree traversals , stock span problem , histogram problem .
• Other applications can be Backtracking, Knight tour problem , rat in a maze , N queen problem and sudoku solver
• In Graph Algorithms like Topological Sorting and Strongly Connected Components
• Using array
• Using linked list

• Command line argument : The most important function of C/C++ is main() function. It is mostly defined with a return type of int and without parameters :
• We can also give command-line arguments in C and C++. Command-line arguments are given after the name of the program in command-line shell of Operating Systems. To pass command line arguments, we typically define main() with two arguments : first argument is the number of command line arguments and second is list of command-line arguments.
• argc (ARGument Count) is int and stores number of command-line arguments passed by the user including the name of the program. So if we pass a value to a program, value of argc would be 2 (one for argument and one for program name)
• The value of argc should be non negative.
• argv(ARGument Vector) is array of character pointers listing all the arguments.
• If argc is greater than zero, the array elements from argv[0] to argv[argc-1] will contain pointers to strings.
• Argv[0] is the name of the program, After that till argv[argc-1] every element is command -line arguments.

Please Login to comment...

Similar reads.

• AKTU-question-papers

Improve your Coding Skills with Practice

What kind of Experience do you want to share?

AKTU Question Paper

Download btech 1 sem computer concepts and programming in c ecs101 2019, question paper links, important links, examination links.

B.Tech Programming for Problem Solving (PPS) Notes

Programming for Problem Solving(PPS)  is one of the important and intresting subject of B.tech engineering student of 1 st Year.

In this subject we study about Introduction to components of a computer system: disks, primary and secondary memory, processor, operating system, compilers, creating, compiling and executing a program etc., Number systems Introduction to Algorithms: steps to solve logical and numerical problems. Representation of Algorithm, Flowchart/Pseudo code with examples, Program design and structured programming Introduction to C Programming Language: variables (with data types and space requirements), Syntax and Logical Errors in compilation, object and executable code, Operators, expressions and precedence, Expression evaluation, Storage classes (auto, extern, static and register), type conversion.

Topperworld  provides you the best notes of  Programming for Problem Solving(PPS)  for the student of  Kurukshetra University (KUK) according to the University syllabus. This notes are prepared with the help of best books as well as with the help of google.This notes has been designed for students pursuing a degree in any computer science, engineering and related fields. It attempts to help students to grasp the essential concepts involved in algorithm design, basically this notes is prepared for the student of KUK pursuing the B.tech 1 st Year.

Here, you can easily see as well as download the notes of Programming for Problem Solving (PPS) , hope it will help in your academic exam as well as in your future.

Leave a Comment Cancel Reply

Your email address will not be published. Required fields are marked *

Save my name, email, and website in this browser for the next time I comment.