This document contains multiple choice questions about databases, programming, and data analysis and design. Some key points:
- Default values in programming can include global variables, functions calls, constants, or all of the above.
- Return statements are used to return a value calling the function.
- Inline functions have their prototype omitted.
- Local variables are known as automatic variables. When a program terminates, global variables are not destroyed.
- Data shared among functions is done with static variables or global variables.
- Common functions in the "math.h" file include log and log().
- Sequential search in C++ is called linear search.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0 ratings0% found this document useful (0 votes)
123 views
Database Multiple Choice Questions
This document contains multiple choice questions about databases, programming, and data analysis and design. Some key points:
- Default values in programming can include global variables, functions calls, constants, or all of the above.
- Return statements are used to return a value calling the function.
- Inline functions have their prototype omitted.
- Local variables are known as automatic variables. When a program terminates, global variables are not destroyed.
- Data shared among functions is done with static variables or global variables.
- Common functions in the "math.h" file include log and log().
- Sequential search in C++ is called linear search.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4
DATABASE MULTIPLE CHOICE QUESTIONS – Solved
1. Default values in programming are
a) global variables b) functions calls c) constants d) all of the above Answer - Click Here: D 2. We use return statement to return a) numeric value b) a value calling function c) single value d) none Answer - Click Here: B 3. Which statement is true about inline functions? a) it is not a user-defined function b) with this function , the size of program becomes small c) prototype is omitted d) none Answer - Click Here: C 4. The local variables are known as a) external variables b) static variables c) dynamic variables d) automatic variables Answer - Click Here: D 5. When a program is terminated which variable isdestroyed? a) auto variables b) global variables c) register d) local variables Answer - Click Here: B 6. Data shared among the functions is done with the help of a) register variable b) static variables c) local variables d) global variables Answer - Click Here: D 7. Which functions are the part of ” math.h” file? a) log b) log() c) tan d) tan(10) Answer - Click Here: B 8. Which one is not included in “conio.h” file? a) kbhit(10) b) getche() c) gotoxy() d) none Answer - Click Here: A 9. Which fuction is used by the programmars to convert lowercase letters to uppercase letters? a) isupper() b) toascii() c) tolower() d) toupper() Answer - Click Here: D 10. The sequential search in C++ is caleed to be a) binary search b) table search c) linear search d) none of these Answer - Click Here: C 11. An array has a starting address that is known as a) original address b) base address c) memory address d) all of the above Answer - Click Here: B 12. Each index is ——-,when the multidimensional array is being accessed a) separated by commas b) surronded by brackets c) separated by colon d) none Answer - Click Here: B Data Analysis And Design Multiple Choice Questions 1. Heap is a … a) binary tree b) ordinary tree c) complete binary tree d) none of these Answer - Click Here: C 2. IPO stands for a) Input Processing Output b) Input Programming Option c) Input Program Ordinary d) none of these Answer - Click Here: A 3. The time complexity of binary search is a) O (log n) b) O (n) c) O(2 log n) d) none of these Answer - Click Here: A 4. How many passes are required to sort a file of size n by using the bubble sort method? a) N/2 b) N-1 c) N-n d) 2N Answer - Click Here: B 5. The running time for insertion sort is … a) O(n^2) b) O(log n) c) O(n) d) O(2 log n) Answer - Click Here: A 6. In stack, insertion operation is known as … a) push operation b) insertion operation c) push operation d) none of these Answer - Click Here: C 7. Which branch deal with the heuristic type of computer problems ? a) artficial intelligence b) real time software c) system sofware d) none of these Answer - Click Here: A 8. Last step in the problem solving is … a) evaluate the solution b) identify the problem c) understand the problem d) all of these Answer - Click Here: A 9. Straight selection is a method of a) repeated searching b) repeated position adjustment c) repeated interchange d) all of these Answer - Click Here: B