Question 1

Character is a primitive data structure.

Accepted Answer

True

Question 2

A Tree is unordered lists which use a ‘hash function’ to insert and search.

Accepted Answer

False

Question 3

Dynamic Array Is an array whose size is not specified when you write the program, but is determined while the program is running.

Accepted Answer

True

Question 4

True/False: ADTs support abstraction, encapsulation, and information binding.

Accepted Answer

False

Question 5

Given:

     int *q;

     * q = 10;

 The statement cout << *q will have an output of 10.

Accepted Answer

True

Question 6

char &ch is  valid pointer declaration

Accepted Answer

False

Question 7

It is a memory address of a variable.

Accepted Answer

Pointer

Question 8

If pointer variable pointing to the dynamic variable that was destroyed and becomes undefined is called dangling pointers.

Accepted Answer

True

Question 9

A linked list is variable in size.

Accepted Answer

True

Question 10

Queue adds anywhere, removes the highest priority

Accepted Answer

False

Question 11

Abstraction is providing only essential information outside the world.

Accepted Answer

True

Question 12

The new operator creates a new dynamic variable of a specified type and returns a pointer that points to this new variable.

Accepted Answer

True

Question 13

The following are characteristics of non-primitive data types, except:

Accepted Answer

The non-primitive data structures emphasize on structuring of a group of homogeneous data items only.

Question 14

Graphs & Trees are non-linear lists.

Accepted Answer

True

Question 15

Pointer Variable is the content that is stored in the memory address.

Accepted Answer

False

Question 16

If there is insufficient available memory to create the new variable, then new returned a special value named NIL.

Accepted Answer

False

Question 17

In many programming languages, including C and C++, it is possible to pass a struct (

Accepted Answer

True

Question 18

TRUE/FALSE: Program = Algorithms + Data Structures

Accepted Answer

True

Question 19

The following are examples of primitive data structures, except.

Accepted Answer

Integer
Character
Float
(Array)

Question 20

True/False:  Abstract Data Type (ADT) stores data and allow various operations on the data to access and change it.

Accepted Answer

True

Question 21

Given:

    int *p;

    int x;

     x = 10;

 p = x  is a valid statement.

Accepted Answer

False

Question 22

You can assign a name definition and then use the type name to declare variables using typedef keyword.

Accepted Answer

True

Question 23

Pointers can be used as parameter to accept an array from outside.

Accepted Answer

True

Question 24

cout << list.back() << endl; 

The back member function returns a reference to the last element in the list.

Accepted Answer

True

Question 25

The list container, found in the Standard Template Library, is a template version of a doubly linked list.

Accepted Answer

True

Question 26

list [int]  myList;  // is a valid declaration

Accepted Answer

False

Question 27

What is the value of TOP when the STATIC STACK is FULL?

Accepted Answer

= to the (stack size-1)

Question 28

What happens to the value of the TOP during a PUSH operation in a STATIC STACK?

Accepted Answer

increments by 1

Question 29

In a DYNAMIC STACK the pointer TOP stays at the HEAD after a PUSH operation.

Accepted Answer

False

Question 30

In a dynamic stack, the pointer TOP is like the HEAD which always point to the first element of the linked list.

Accepted Answer

True

Question 31

In a DYNAMIC STACK the pointer TOP stays at the HEAD after a PUSH operation.

Accepted Answer

False

Question 32

In a dynamic implementation of stack, the pointer TOP has an initial value of NULL.

Accepted Answer

True

Question 33

Below is a valid declaration of a dynamic stack implemented as a list: stack< int, list > iStack;

Accepted Answer

True

Question 34

The STL function push retrieves an element at the top of the stack.

Accepted Answer

False

Question 35

Below is a valid declaration of a dynamic stack implemented as a vector:

stack< int > iStack

Accepted Answer

False

Question 36

In inserting a node, finding its proper location and following a certain order is necessary.

Accepted Answer

True

Question 37

TRUE/FALSE: Each node in a linked list contains one or more members that represent data and a pointer which can point to another node.

Accepted Answer

True

Question 38

The algorithm for displaying the elements of a linked list would require traversal.

Accepted Answer

True

Question 39

cout << list.front() << endl;
front returns a reference to the last element of the list.

Accepted Answer

False

Question 40

The following are stack operations except:

Accepted Answer

IsEmpty
Push
Pop
(Clear)

Question 41

The initial value of index top in the static implementation of  a stack is 0.

Accepted Answer

False

Question 42

Pop function will always retrieve the top.

Accepted Answer

True

Question 43

The STL stack container may be implemented as a vector, a list, or a deque.

Accepted Answer

True

Question 44

Below is a valid declaration of a dynamic stack implemented as a vector:

stack< int > iStack

Accepted Answer

False

Question 45

Appending a node means adding a node at the start of the list.

Accepted Answer

False

Question 46

list.unique(); 

unique removes any element that has the same value as the element

Accepted Answer

True

Question 47

The STL list function push_back is equivalent to inserting a node in a list.

Accepted Answer

False

Question 48

Which of the following is an application of a stack?

Accepted Answer

Sending of Network Packets
CPU Scheduling
Printer Spooler
(Calculator)

Question 49

The manner in which a stack behaves?

Accepted Answer

LIFO

Question 50

Dynamic Stacks can be implemented using linked list.

Accepted Answer

True

Question 51

In a static stack, the variable stackSize will handle the total capacity of the stack.

Accepted Answer

True

Question 52

A stack container that is used to adapt to different containers, it is often referred to as a container adapter.

Accepted Answer

True

Question 53

The delete operation only involves the removing of the node from the list without breaking the links created by the next pointers.

Accepted Answer

False

Question 54

You need an array to represent each node in a linked list.

Accepted Answer

False

Question 55

In inserting a node, finding its proper location and following a certain order is necessary.

Accepted Answer

True

Question 56

Use of template will make the ADT flexible in terms of accepting values of different data types.

Accepted Answer

True

Question 57

STL lists are also efficient at adding elements at their back because they have a built-in pointer to the last element in the list.

Accepted Answer

True

Question 58

In a dynamic stack, pointer TOP points to a fixed value in the linked list and does not move.

Accepted Answer

False

"Know" box contains:
Time elapsed:
Retries:

Stack #3867195