COP3014 Final Exam – Gaitros   1)The &, also known as the address operator, returns the memory address of a variable

COP3014 Final Exam – Gaitros

1)The &, also known as the address operator, returns the memory address of a variable.

2. Array items can be used as pointers.

3. When this is placed in front of a variable name, it returns the address of that variable.

4. What’s the output when you use the & operator?

5. A pointer variables store addresses

6. What is the output when you put a indirection operator(*) in front of a pointer?

7. Use of the ++ and -- for pointers and what arithmetic operators can be used on pointers.

8. Not all arithmetic operations may be performed on pointers

9. Dynamic memory occurs during runtime and how it is done with the “new” operator

10. What is the null terminator

11. What do strcpy, strcat, and strcmp do with C-Strings?

12. How atoi and atol work with C-Strings.

13. Declaring C-Strings, how many you have to set aside including the null terminator

14. Use and application of tolower, toupper, isupper, and islower.

15. Format using a struct where braces {} and semicolons

16. Accessing struct members using the .(dot) notation

17. Accessing struct when it is a pointer using the struct pointer (->) operator

18. Using structs and passing them as parameters and return them as function types

19. Declaring and using enumeration types. What happens when you try to print one (enum)

20. What do private and public mean in class definitions and how they are used to protect data

21. The use of #ifndef, #define, #endif

22. The use of constructors, default constructors, and when they are called

23. When and where public and private data items can be called

24. How the data members are called in a class (the .(dot) operator)

25. How can you identify a constructor and how many default constructors can you have

26. Basic C++ syntax, use of the semicolon, declaring constants, declaring an array.

27. How do you know a function is a recursive function

28. What makes a well defined recursive function

29. The drawbacks of using a recursive function

30. How many times might a recursive function be called given an example