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 data type of each ____ depends on the specific application.
2
The element at the bottom
destructor
node

2. A derived class can directly access ____.
isFull & listSize
public members of a base class
8
end

3. Which element of a stack has been in the stack the longest?
one
The element at the bottom
first 1
protected

4. Which of the following notations requires the use of parentheses?
x y - v w + *
The element at the bottom
pop_back
infix

5. In a(n) ____ copy - two or more pointers of the same type point to the same memory
num
a or b
shallow
x y - v w + *

6. The _______ member function is common to all containers.
protected
isFull & listSize
one
destructor

7. 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
first 1
=
Returns a pointer to the last element in container ct
dynamic array

8. When initializing the object of a derived class - the ____ of the base class is executed first.
isFull & listSize
To manage objects of a given type
class templates
constructor

9. In a(n) ____ copy - each pointer refers to its own data.
address of p (1200)
O(1)
2nd book from the top
deep

10. The time complexity of the function isEmpty in an array list is
class templates
double-ended queue
memory
O(1)

11. In an array list the time complexity of the isEmpty function is identical to the time complexity of the ____ function.
8
is-a
isFull & listSize
reverse_iterator

12. Inheritance is an example of the ____ relationship.
first 1
is-a
2
O(n)

13. In a single inheritance - the derived class is derived from ____base class(es).
deep copy
25 21 18
one
deep

14. intStack.push(18); intStack.push(21); intStack.push(25); cout<<tempStack.top()<<"";
#include <deque>
nodes
constructor
25 21 18

15. An array created during the execution of a program is called a ____ array.
constructor
is-a
dynamic
end

16. The statement "q++" increments the value of q by ____ bytes. (double *q;)
O(1)
x y - v w + *
8
23

17. Building a linked list forward places the item to be added at the ____ of the linked list.
address of p (1200)
8
dynamic
end

18. A class that contains a pointer variable as one of its data members should contain a destructor to
20
The element at the bottom
deep
prevent shallow copying of data

19. What does the term deque stand for?
a pointer not in the list
double-ended queue
function template
=

20. If you don't want a pointer to point to anything you should initialize it by setting it to

first 1
23
pop_back

21. The increment operator ______ increments the value of a pointer variable by twice the size of the memory to which it is pointing.
does not
deep
20
double-ended queue

22. What is the effect of the following expression: rAccessIterator - n?
protected
node
Returns the iterator of the previous nth element
dynamic array

23. Each pointer refers to its own data
To manage objects of a given type
deep copy
class templates
deep

24. What is the time-complexity of the overloaded assignment operator?
shallow
=
O(n)
x y - v w + *

25. What is the equivalent postfix expression for the infix expression: (x - y) * (v + w)?
O(n)
memory
protected
x y - v w + *

26. What is the value of the postfix expression: 5 4 * 3 + ?
23
dynamic array
The element at the bottom
O(n)

27. Which answer most accurately completes the following sentence: A linked list is made up of ____.
nodes
reverse_iterator
Returns the iterator of the previous nth element
5 2 7

28. Like function templates - ____ are used to write a single code segment for a set of related classes.
a pointer not in the list
class templates
2nd book from the top
prevent memory leaks

29. A class that contains a pointer variable as one of its data members should contain an overloaded assignment operator to
address of p (1200)
prevent memory leaks
prevent shallow copying of data
25 21 18

30. With templates - you can write a single code segment for a set of related functions - called a ____.
dynamic
2nd book from the top
function template
node

31. Which function is common to all sequence containers but NOT all containers?
node
x y - v w + *
pop_back
deep

32. If you applied the operation pop to the stack above - which book would be left on top of the stack?
infix
2nd book from the top
public members of a base class
memory

33. 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
To manage objects of a given type
=
2nd book from the top

34. You can initialize a pointer variable by setting it to ____
class templates
a or b
memory
2nd book from the top

35. The function _____ can be used with any container type including arrays.
O(n)
copy
reverse_iterator
infix

36. What are containers used for?
To manage objects of a given type
class templates
23
5 2 7

37. If your class contains a pointer variable as one of its data members - having a destructor would prevent ____ leaks.
a pointer not in the list
To manage objects of a given type
x y - v w + *
memory

38. Which of the following should be used to traverse a list?
memory
double-ended queue
does not
a pointer not in the list

39. Given container ct - what is the effect of ct.rbegin()?
deep copy
Returns a pointer to the last element in container ct
To manage objects of a given type
25 21 18

40. &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 ____.
num
infix
nodes
address of p (1200)

41. The time complexity of the linear search function in an array list is ____.
O(n)
Returns the iterator of the previous nth element
To manage objects of a given type
Returns a pointer to the last element in container ct

42. 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.
reverse_iterator
is-a
protected
=

43. The assignment statement *p=78; changes the content of memory location 1800 and therefore also changes the content of ____.
5 2 7
address of p (1200)
num
end

44. vector<int> v (1 - 2); int value = v.back (); cout << value << endl; What is the output of the code fragment above?
Returns a pointer to the last element in container ct
2
O(n)
function template

45. 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?
20
num
=
does not

46. Every container contains the type
reverse_iterator
The element at the bottom
2nd book from the top
is-a

47. v[0] = 5; v[1] = 2; v[2] = 7; vector<int>::iterator first = v.begin(); vector<int>::iterator last = v.end();
deep copy
Returns a pointer to the last element in container ct
5 2 7
first 1

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

49. 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.
deep copy
=
deep
isFull & listSize

50. An array created during the execution of a program is called a
dynamic array
23
isFull & listSize
O(n)