Test your basic knowledge |

Data Structures Using C++

Subject : it-skills

Instructions:

Answer 50 questions in 15 minutes.
If you are not ready to take this test, you can study here.
Match each statement with the correct term.
Don't refresh. All questions and answers are randomly picked and ordered every time you load a test.

This is a study tool. The 3 wrong answers for each question are randomly chosen from answers to other questions. So, you might find at times the answers obvious, but you will see it re-enforces your understanding as you take the test each time.

1. The assignment statement *p=78; changes the content of memory location 1800 and therefore also changes the content of ____.
nodes
num
x y - v w + *
isFull & listSize

2. In a(n) ____ copy - each pointer refers to its own data.
prevent memory leaks
20
deep
=

3. Building a linked list forward places the item to be added at the ____ of the linked list.
nodes
double-ended queue
end
address of p (1200)

4. A base class wants to allow a derived class to access one of its data members. However - the base class does not want this member to be directly accessed outside the class. The base class should declare the member using the ____ access specifier.
protected
O(n)
does not
5 2 7

5. template<class inputIterator -class outputIterator>outputItr copy(inputIteratorfirst1 - inputIterator last - outputIterator first2); From the function prototype copy above - which parameter specifies the position from which to begin copying the eleme
2nd book from the top
first 1
To manage objects of a given type
2

6. With templates - you can write a single code segment for a set of related functions - called a ____.
function template
dynamic
8
pop_back

7. What are containers used for?
does not
a or b
Returns a pointer to the last element in container ct
To manage objects of a given type

8. The increment operator ______ increments the value of a pointer variable by twice the size of the memory to which it is pointing.
Returns a pointer to the last element in container ct
does not
prevent shallow copying of data
O(n)

9. The data type of each ____ depends on the specific application.
O(1)
8
Returns a pointer to the last element in container ct
node

10. &p is equivalent to: 1200 *p means the content of the memory location 1800 - pointed to by p; that is - pointed to by the content of memory location ____.
To manage objects of a given type
address of p (1200)
copy
a or b

11. Each pointer refers to its own data
num
deep copy
protected
reverse_iterator

12. A class that contains a pointer variable as one of its data members should contain an overloaded assignment operator to
prevent memory leaks
memory
To manage objects of a given type
constructor

13. If your class contains a pointer variable as one of its data members - having a destructor would prevent ____ leaks.
Returns a pointer to the last element in container ct
memory
O(1)
2

14. Every container contains the type
reverse_iterator
To manage objects of a given type
num
O(n)

15. An array created during the execution of a program is called a ____ array.
prevent shallow copying of data
isFull & listSize
memory
dynamic

16. In a(n) ____ copy - two or more pointers of the same type point to the same memory
protected
deep copy
shallow
=

17. Which statement must be included in a program in order to use a deque container?
2nd book from the top
dynamic
constructor
#include <deque>

18. v[0] = 5; v[1] = 2; v[2] = 7; vector<int>::iterator first = v.begin(); vector<int>::iterator last = v.end();
5 2 7
25 21 18
nodes
a pointer not in the list

19. Which of the following should be used to traverse a list?
5 2 7
a pointer not in the list
25 21 18
public members of a base class

20. Which of the following notations requires the use of parentheses?
constructor
infix
a pointer not in the list
node

21. In a single inheritance - the derived class is derived from ____base class(es).
a pointer not in the list
one
2nd book from the top
To manage objects of a given type

22. Suppose your class contains a pointer variable as one of its data members. When performing member-wise copies between two objects of the same class - its important to have an overloaded ____ operator to prevent shallow copying of data.
does not
shallow
prevent memory leaks
=

23. What is the equivalent postfix expression for the infix expression: (x - y) * (v + w)?
x y - v w + *
nodes
infix
deep

24. Given container ct - what is the effect of ct.rbegin()?
Returns a pointer to the last element in container ct
8
constructor
shallow

25. intStack.push(18); intStack.push(21); intStack.push(25); cout<<tempStack.top()<<"";
copy
node
=
25 21 18

26. The time complexity of the linear search function in an array list is ____.
=
copy
O(n)
double-ended queue

27. In an array list the time complexity of the isEmpty function is identical to the time complexity of the ____ function.
23
isFull & listSize
constructor
shallow

28. If you applied the operation pop to the stack above - which book would be left on top of the stack?
2nd book from the top
nodes
infix
destructor

29. The _______ member function is common to all containers.
destructor
dynamic array
copy
23

30. Suppose your class contains a pointer variable as one of its data members. When performing member-wise copies between two objects of the same class - its important to have an overloaded ____ operator to prevent shallow copying of data.
25 21 18
shallow
=
prevent memory leaks

31. When initializing the object of a derived class - the ____ of the base class is executed first.
public members of a base class
dynamic
constructor
double-ended queue

32. You can initialize a pointer variable by setting it to ____
class templates
a or b
shallow
double-ended queue

33. vector<int> v (1 - 2); int value = v.back (); cout << value << endl; What is the output of the code fragment above?
O(1)
2
20
prevent shallow copying of data

34. What is the value of the postfix expression: 5 4 * 3 + ?
deep copy
23
=
20

35. Inheritance is an example of the ____ relationship.
Returns a pointer to the last element in container ct
deep
is-a
prevent shallow copying of data

36. What is the time-complexity of the overloaded assignment operator?
double-ended queue
deep
pop_back
O(n)

37. The statement "q++" increments the value of q by ____ bytes. (double *q;)
public members of a base class
one
8
reverse_iterator

38. If you don't want a pointer to point to anything you should initialize it by setting it to
class templates
O(n)

address of p (1200)

39. A class that contains a pointer variable as one of its data members should contain a destructor to
prevent shallow copying of data
dynamic
#include <deque>
Returns a pointer to the last element in container ct

40. An array created during the execution of a program is called a
prevent memory leaks
reverse_iterator
is-a
dynamic array

41. A derived class can directly access ____.
public members of a base class
class templates
prevent shallow copying of data
O(n)

42. Which answer most accurately completes the following sentence: A linked list is made up of ____.
2
=
nodes
2nd book from the top

43. What is the effect of the following expression: rAccessIterator - n?
infix
copy
protected
Returns the iterator of the previous nth element

44. vector<int> v (1 - 10); vector<int> w (1 -20); v.swap (w); cout << v[0]; What is the output of the code fragment above?
infix
address of p (1200)
num
20

45. Which function is common to all sequence containers but NOT all containers?
23
pop_back
O(n)
num

46. What does the term deque stand for?
address of p (1200)
2
shallow
double-ended queue

47. Which element of a stack has been in the stack the longest?
To manage objects of a given type
23
num
The element at the bottom

48. The function _____ can be used with any container type including arrays.
function template
copy
The element at the bottom
num

49. Like function templates - ____ are used to write a single code segment for a set of related classes.
class templates
Returns the iterator of the previous nth element
a or b
does not

50. The time complexity of the function isEmpty in an array list is
O(1)
deep
double-ended queue
prevent shallow copying of data