1. A function is invoked with a    a. Function Definition    b. Function Declaration    c . Function Call    d. Function Return   2. What is the only function all C++ programs must contain? a. start()     b. system()     c. main()     d. program()                     3. A function that calls itself either directly or indirectly is a(n) function. a. Infinite Function b. Recursive Function c. Prototype Function   4. Structures may not be compared by using operators == and !=.   True   False 5. Structures are always passed to functions by call by reference method.   True False   6. Same names can be used for different functions without any conflict.   True   False   7. A recursive function typically has two components: one that provides a means for the recursion to terminate by testing for a case, and one that expresses the problem as a recursive call for a slightly simpler problem than the original call. True   False 8. Members of different structures must have unique names.   True   False   9. a Structure    Function   Prototype       10. Keyword is used in a function header to indicate that a function does not return a value or to indicate that a function contains no parameters. True   False

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
100%

                                                   Mcq’s

 

1. A function is invoked with a

   a. Function Definition

   b. Function Declaration

   c . Function Call

   d. Function Return

 

2. What is the only function all C++ programs must contain?

a. start()

 

 

b. system()

 

 

c. main()

 

 

d. program()

 

 

 

 

 

         

3. A function that calls itself either directly or indirectly is a(n) function.

a. Infinite Function

b. Recursive Function

c. Prototype Function

 

4. Structures may not be compared by using operators == and !=.

 

True

 

False

5. Structures are always passed to functions by call by reference method.

 

True

False

 

6. Same names can be used for different functions without any conflict.

 

True

 

False

 

7. A recursive function typically has two components: one that provides a means for the recursion to terminate by testing for a case, and one that expresses the problem as a recursive call for a slightly simpler problem than the original call.

True

 

False

8. Members of different structures must have unique names.

 

True

 

False

 

9. a Structure

 

 Function

 

Prototype

 

 

 

10. Keyword is used in a function header to indicate that a function does not return a value or to indicate that a function contains no parameters.

True

 

False

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 10 steps with 1 images

Blurred answer
Knowledge Booster
Events
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education