Problem Sloving Technics Chapterwise Important Questions
Problem Sloving Technics Chapterwise Important Questions
Important Questions
1. Write an algorithm to exchange the values of two variables using temporary variable.
2. Write an algorithm for summation of n numbers or to find sum of n numbers.
3. Write an algorithm to find factorial of ‘n’ where ‘n’ is a given number.
4. Write an algorithm to find first ‘n’ terms of Fibonacci sequence or series.
5. Write an algorithm to find reverse of a given number.
Page | 1
[SUBJECT: PROBLEM SOLVING TECHNIQUES] BCA I SEM – NEP SCHEME
1. What is a program?
2. Who developed C Programming language? Which operating system was written in C
3. Differentiate between function overloading and overriding.
4. What are preprocessor directives?
5. What are global and local variables?
6. What are high level and low level programming languages?
7. What are header files?
Chapter 4: C Language Basic Concepts, Character Set, Tokens, Constants, Variables, Data types
Page | 2
[SUBJECT: PROBLEM SOLVING TECHNIQUES] BCA I SEM – NEP SCHEME
1. What is an operand?
2. What are logical and relational operators?
3. What do you mean by unary operator? Give an example.
4. What is the difference between = and = = operators?
5. Write the general syntax of conditional operator or ternary operator.
Page | 3
[SUBJECT: PROBLEM SOLVING TECHNIQUES] BCA I SEM – NEP SCHEME
Chapter 8: Arrays
Chapter 9: Strings
1. What is a string?
2. Which character is terminating character of strings?
3. What is concatenation?
4. How strings are declared? Give example. Which header file is used for strings?
5. Which format specifier is used for strings?
6. What is the use of strlen( )?
Page | 4
[SUBJECT: PROBLEM SOLVING TECHNIQUES] BCA I SEM – NEP SCHEME
Page | 5
[SUBJECT: PROBLEM SOLVING TECHNIQUES] BCA I SEM – NEP SCHEME
1. What is histogram?
2. What is frequency histogram?
Page | 6
[SUBJECT: PROBLEM SOLVING TECHNIQUES] BCA I SEM – NEP SCHEME
1. Write an algorithm or program to merge two arrays or Explain two way merge with example.
2. Write an algorithm or program to sort n elements using quick sort. Explain with an example.
3. Write an algorithm or program to sort n elements using insertion sort. Explain with an example.
4. Write an algorithm or program to sort n elements using selection sort. Explain with an example.
5. Write an algorithm or program to sort n elements using bubble sort. Explain with an example.
6. Write an algorithm or program to search an element using linear search. Explain with an example.
7. Write an algorithm or program to search an element using binary search. Explain with an example.
8. Explain hash function and hash table.
Page | 7