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. If your class contains a pointer variable as one of its data members - having a destructor would prevent ____ leaks.
O(n)
memory
O(n)
infix

2. 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.
isFull & listSize
O(1)
protected
20

3. What are containers used for?
pop_back
To manage objects of a given type
deep copy
address of p (1200)

4. Which statement must be included in a program in order to use a deque container?
20
#include <deque>
=
x y - v w + *

5. If you don't want a pointer to point to anything you should initialize it by setting it to
node
prevent memory leaks

=

6. The time complexity of the linear search function in an array list is ____.
20
O(n)
prevent shallow copying of data
num

7. In a(n) ____ copy - each pointer refers to its own data.
To manage objects of a given type
deep
25 21 18
copy

8. With templates - you can write a single code segment for a set of related functions - called a ____.
nodes
20
function template
double-ended queue

9. The _______ member function is common to all containers.
Returns the iterator of the previous nth element
constructor
pop_back
destructor

10. Like function templates - ____ are used to write a single code segment for a set of related classes.
#include <deque>
x y - v w + *
end
class templates

11. What is the equivalent postfix expression for the infix expression: (x - y) * (v + w)?
=
x y - v w + *
constructor
2nd book from the top

12. 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
prevent shallow copying of data
first 1
a or b
The element at the bottom

13. The data type of each ____ depends on the specific application.
deep copy
node
25 21 18
#include <deque>

14. Which answer most accurately completes the following sentence: A linked list is made up of ____.
a pointer not in the list
num
2nd book from the top
nodes

15. The increment operator ______ increments the value of a pointer variable by twice the size of the memory to which it is pointing.
dynamic array
memory
does not
=

16. A derived class can directly access ____.
constructor
public members of a base class
pop_back
=

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

18. 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.
To manage objects of a given type
deep
public members of a base class
=

19. Which function is common to all sequence containers but NOT all containers?
2nd book from the top
memory
pop_back
=

20. Every container contains the type
reverse_iterator
a or b
O(n)
end

21. What is the effect of the following expression: rAccessIterator - n?
Returns the iterator of the previous nth element
deep copy
one
20

22. Which element of a stack has been in the stack the longest?
reverse_iterator
The element at the bottom
8
shallow

23. Inheritance is an example of the ____ relationship.
20
is-a
The element at the bottom
pop_back

24. What does the term deque stand for?
x y - v w + *
a pointer not in the list
dynamic array
double-ended queue

25. In a(n) ____ copy - two or more pointers of the same type point to the same memory
shallow
memory
Returns the iterator of the previous nth element
first 1

26. The function _____ can be used with any container type including arrays.
copy
prevent shallow copying of data
#include <deque>
20

27. 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.
memory
deep copy
=
address of p (1200)

28. In an array list the time complexity of the isEmpty function is identical to the time complexity of the ____ function.
protected
dynamic array
isFull & listSize
node

29. An array created during the execution of a program is called a
end
dynamic array
dynamic
2

30. Which of the following notations requires the use of parentheses?
node
infix
public members of a base class
prevent shallow copying of data

31. You can initialize a pointer variable by setting it to ____
function template
a or b
20
2

32. An array created during the execution of a program is called a ____ array.
shallow
=
public members of a base class
dynamic

33. What is the time-complexity of the overloaded assignment operator?
Returns a pointer to the last element in container ct
O(n)
20
nodes

34. The statement "q++" increments the value of q by ____ bytes. (double *q;)
8
To manage objects of a given type
2nd book from the top
memory

35. 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?
#include <deque>
20
=
O(n)

36. What is the value of the postfix expression: 5 4 * 3 + ?
O(1)
pop_back
double-ended queue
23

37. &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 ____.
shallow
O(1)
=
address of p (1200)

38. Given container ct - what is the effect of ct.rbegin()?
memory
Returns a pointer to the last element in container ct
reverse_iterator
nodes

39. The assignment statement *p=78; changes the content of memory location 1800 and therefore also changes the content of ____.
nodes
dynamic
num
prevent memory leaks

40. In a single inheritance - the derived class is derived from ____base class(es).
double-ended queue
one
first 1
2

41. Which of the following should be used to traverse a list?
23
a pointer not in the list
protected
O(1)

42. The time complexity of the function isEmpty in an array list is
O(1)
destructor
shallow
To manage objects of a given type

43. vector<int> v (1 - 2); int value = v.back (); cout << value << endl; What is the output of the code fragment above?
2
a pointer not in the list
O(1)
destructor

44. intStack.push(18); intStack.push(21); intStack.push(25); cout<<tempStack.top()<<"";
double-ended queue
public members of a base class
protected
25 21 18

45. When initializing the object of a derived class - the ____ of the base class is executed first.
=
constructor
#include <deque>
2

46. Building a linked list forward places the item to be added at the ____ of the linked list.
does not
pop_back
20
end

47. A class that contains a pointer variable as one of its data members should contain a destructor to
first 1
public members of a base class
prevent shallow copying of data
num

48. v[0] = 5; v[1] = 2; v[2] = 7; vector<int>::iterator first = v.begin(); vector<int>::iterator last = v.end();
prevent shallow copying of data
Returns a pointer to the last element in container ct
5 2 7
23

49. Each pointer refers to its own data
8
deep copy
copy
#include <deque>

50. A class that contains a pointer variable as one of its data members should contain an overloaded assignment operator to
prevent memory leaks
class templates
constructor
public members of a base class