💻
B.Tech CSE PPS

Programming for Problem Solving Important Questions

Unit-wise important 2-mark, 5-mark and 10-mark questions based on the B.Tech CSE syllabus for semester examination preparation.

No questions found Try searching for another topic, unit or question.
Unit I

Overview of C, Selection Structures & Loops

C Fundamentals, Operators, Selection and Repetition

2-Mark Questions

15
  1. What are the basic elements of the C language?
  2. What is a variable? How is a variable declared in C?
  3. List the fundamental data types available in C.
  4. What is the general form of a C program?
  5. What is an operator? Name the different categories of operators in C.
  6. What is operator precedence?
  7. What is an expression in C?
  8. What is the purpose of the if statement?
  9. What is a compound statement?
  10. What is a decision step in an algorithm?
  11. What is repetition in a program?
  12. What is a counting loop?
  13. What is the difference between while and do-while loops?
  14. What is the purpose of the for statement?
  15. What is a nested loop?

5-Mark Questions

12
  1. Explain the basic elements of the C language with suitable examples.
  2. Explain variable declarations and data types in C.
  3. Explain the general structure of a C program with an example.
  4. Explain different types of operators and expressions in C.
  5. Explain operator precedence and its importance in evaluating expressions.
  6. Explain the if statement and if statement with compound statements.
  7. Explain how decision steps are represented while designing an algorithm.
  8. Explain the while statement with a suitable example.
  9. Explain the for statement and its components.
  10. Explain the do-while statement with an example.
  11. Explain nested loops and their applications.
  12. Explain how a loop can be designed to compute a sum or product.

10-Mark Questions

6
  1. Explain the fundamental elements of C and the general structure of a C program with a suitable example.
  2. Explain variables, data types, operators, expressions and operator precedence in C with examples.
  3. Explain selection structures in C, including conditions, if statements and compound statements.
  4. Explain repetition and loop statements in C. Discuss while, for and do-while loops with examples.
  5. Explain loop design, counting loops, conditional loops and nested loops with suitable examples.
  6. Develop an algorithm and C program to demonstrate selection and repetition structures.
Unit II

Functions, Pointers & Modular Programming

Top-Down Design, Functions, Pointers and Scope

2-Mark Questions

15
  1. What is top-down design?
  2. What is a structure chart?
  3. What is a function in C?
  4. What is a library function?
  5. What is a function without arguments?
  6. What is a function with input arguments?
  7. What is a pointer?
  8. What is the indirection operator?
  9. What is an output parameter?
  10. What is modular programming?
  11. What is the scope of a name?
  12. What is meant by passing an argument to a function?
  13. What are input/output parameters?
  14. What is the difference between actual and formal parameters?
  15. Why are functions used in program development?

5-Mark Questions

12
  1. Explain top-down design with a suitable example.
  2. Explain structure charts and their role in program design.
  3. Explain library functions in C with examples.
  4. Explain functions without arguments with a suitable C program.
  5. Explain functions with input arguments with an example.
  6. Explain pointers and the indirection operator.
  7. Explain how pointers can be used as output parameters.
  8. Explain modular programming using functions.
  9. Explain scope of names in C.
  10. Explain the difference between formal parameters and actual arguments.
  11. Explain multiple calls to a function using input/output parameters.
  12. Explain how functions improve program modularity and reusability.

10-Mark Questions

6
  1. Explain top-down program design, structure charts and the process of building programs from existing information.
  2. Explain functions in C, including library functions, functions without arguments and functions with input arguments.
  3. Explain pointers and the indirection operator. Demonstrate their use with functions.
  4. Explain functions with output parameters and multiple calls using input/output parameters with suitable programs.
  5. Explain scope of names, formal parameters and actual arguments in C with examples.
  6. Explain modular programming in C and demonstrate how a problem can be divided into reusable functions.
Unit III

Arrays & Strings

Arrays, Searching, Sorting, Strings and Multidimensional Arrays

2-Mark Questions

15
  1. What is an array?
  2. How is a one-dimensional array declared in C?
  3. What is an array subscript?
  4. How are array elements accessed sequentially?
  5. How can an array element be passed to a function?
  6. What is an array argument?
  7. What is a parallel array?
  8. What is an enumerated type?
  9. What is a multidimensional array?
  10. What is a string in C?
  11. How is a string represented in C?
  12. What is string concatenation?
  13. What is string comparison?
  14. Name any four string library functions.
  15. What is an array of pointers?

5-Mark Questions

13
  1. Explain declaration and referencing of arrays with examples.
  2. Explain array subscripts and sequential access using for loops.
  3. Explain how array elements can be passed to functions.
  4. Explain array arguments with a suitable C program.
  5. Explain searching an array.
  6. Explain sorting an array.
  7. Explain parallel arrays and enumerated types.
  8. Explain multidimensional arrays with an example.
  9. Explain string basics and string representation in C.
  10. Explain string library functions used for string operations.
  11. Explain string concatenation and whole-line input.
  12. Explain string comparison with examples.
  13. Explain arrays of pointers.

10-Mark Questions

8
  1. Explain one-dimensional arrays in C, including declaration, referencing, subscripts and sequential access.
  2. Explain passing arrays to functions and demonstrate array arguments with a suitable program.
  3. Explain searching and sorting of arrays with suitable examples.
  4. Explain multidimensional arrays with declaration, initialization and accessing elements.
  5. Explain strings in C and discuss string assignment, concatenation, input and comparison.
  6. Explain important string library functions with suitable examples.
  7. Explain parallel arrays, enumerated types and arrays of pointers.
  8. Develop a C program to perform searching and sorting operations on an array.
Unit IV

Recursion, Structures & Unions

Recursive Functions and User-Defined Data Types

2-Mark Questions

15
  1. What is recursion?
  2. What is a recursive function?
  3. What is the base condition in recursion?
  4. What is meant by tracing a recursive function?
  5. Give two examples of recursive mathematical functions.
  6. What are recursive array functions?
  7. What are recursive string functions?
  8. What is a structure in C?
  9. What is a user-defined structure type?
  10. How is structure data passed to a function?
  11. What is a structured result value?
  12. What is a union?
  13. What is the difference between a structure and a union?
  14. Why are user-defined data types useful?
  15. What is a structure type data parameter?

5-Mark Questions

11
  1. Explain the nature of recursion with an example.
  2. Explain how a recursive function is traced.
  3. Explain recursive mathematical functions with examples.
  4. Explain recursive functions with array parameters.
  5. Explain recursive functions with string parameters.
  6. Explain user-defined structure types.
  7. Explain passing structure data as input and output parameters.
  8. Explain functions with structured result values.
  9. Explain union types in C.
  10. Differentiate between structures and unions.
  11. Explain the advantages of user-defined data types.

10-Mark Questions

7
  1. Explain recursion in detail and demonstrate the execution of a recursive function using tracing.
  2. Explain recursive mathematical functions with suitable C programs.
  3. Explain recursive functions with array and string parameters.
  4. Explain user-defined structures, structure parameters and structured result values with examples.
  5. Explain union types in C and compare them with structures.
  6. Develop a C program using structures and functions to process structured data.
  7. Explain how recursion and user-defined data types can be used to solve complex programming problems.
Unit V

Files, Searching & Sorting

Text Files, Binary Files, Searching and Sorting Algorithms

2-Mark Questions

15
  1. What is a file in C?
  2. What is a file pointer?
  3. What is file input/output?
  4. What is a text file?
  5. What is a binary file?
  6. What is the purpose of a file pointer?
  7. What is meant by searching a database?
  8. What is linear search?
  9. What is binary search?
  10. What is sorting?
  11. What is bubble sort?
  12. What is insertion sort?
  13. What is selection sort?
  14. What is the basic idea of linear search?
  15. What is the basic idea of binary search?

5-Mark Questions

12
  1. Explain text file input/output in C.
  2. Explain file pointers and their role in file operations.
  3. Explain binary files.
  4. Explain the process of searching a database using files.
  5. Explain linear search with an example.
  6. Explain binary search with an example.
  7. Explain the bubble sort algorithm.
  8. Explain the insertion sort algorithm.
  9. Explain the selection sort algorithm.
  10. Compare linear search and binary search.
  11. Explain the basic steps involved in sorting an array.
  12. Explain the working principle of bubble, insertion and selection sorting.

10-Mark Questions

8
  1. Explain text and binary file operations in C with suitable examples.
  2. Explain file pointers and input/output operations on files.
  3. Explain searching a database using file operations.
  4. Explain linear and binary search algorithms with algorithms and suitable C programs.
  5. Explain bubble sort, insertion sort and selection sort with algorithms and examples.
  6. Compare linear search and binary search and discuss their applications.
  7. Develop a C program to implement searching and sorting operations on an array.
  8. Explain fundamental searching and sorting techniques used for processing data efficiently.
💡

Exam Preparation Tip

Begin with the 2-mark questions to revise important definitions and concepts. Then practice the 5-mark questions for conceptual understanding and use the 10-mark questions to prepare detailed answers and programming-based questions.