Question 1

Heap is a special area of memory that is reserved for dynamically allocated variables.

Accepted Answer

True

Question 2

Pointer is a non-primitive data structure.

Accepted Answer

False

Question 3

Character is a primitive data structure.

Accepted Answer

True

Question 4

The new operator eliminates a dynamic variable and returns the memory that the dynamic variable occupied to the freestore manager so that the memory can be reused.

Accepted Answer

False

Question 5

True/False: The & in front of an ordinary variable produces the address of that variable; that is, it produces a pointer that points to the variable.

Accepted Answer

True

Question 6

Given:

      int *p, *q;

      int x, y;

      x = 2;

      y = 7;

      p = &y;

     q = p;

The statment cout << *q will have an output of memory address.

Accepted Answer

False

Question 7

TRUE/FALSE: There is a name associated with a pointer data type in C++.

Accepted Answer

False

Question 8

Remove operator eliminates a dynamic variable and returns the memory that the dynamic variable occupied to the freestore manager so that the memory can be reused.

Accepted Answer

False

Question 9

Stack is a special area of memory that is reserved for dynamically allocated variables.

Accepted Answer

False

Question 10

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

Accepted Answer

False

Question 11

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

Accepted Answer

False

Question 12

A circular linked list has 2 node pointers.

Accepted Answer

False

Question 13

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

Accepted Answer

True

Question 14

A doubly linked list has both a next and previous node pointers.

Accepted Answer

True

Question 15

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 16

Primitive data structures are derived from non-primitive data structures.

Accepted Answer

False

Question 17

It is is a step by step procedure to solve a particular function.

Accepted Answer

Algorithm

Question 18

An ADT is a relational model, together with the various operations defined on the model.

Accepted Answer

False
 

should be conceptual

Question 19

Abstraction is providing only essential information outside the world.

Accepted Answer

True

Question 20

It is a memory address of a variable.

Accepted Answer

Pointer

Question 21

The address of operator is a unary operator that returns the address of its operand.

Accepted Answer

&

Question 22

TRUE/FALSE: The * operator in front of a pointer variable produces the variable to which it points. When used this way, the * operator is called the dereferencing operator.

Accepted Answer

True

Question 23

When you apply delete to a pointer variable, the dynamic variable to which it is pointing is destroyed.

Accepted Answer

True

Question 24

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

Accepted Answer

True

Question 25

This node is responsible to handle the data that will be added to the linked list.

Accepted Answer

newNode

Question 26

In addition to the data, each node contains a pointer, which can point to another node.

Accepted Answer

True

Question 27

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

Accepted Answer

True

Question 28

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

Accepted Answer

False

Question 29

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

Accepted Answer

True

Question 30

It is is representation of the logical relationship existing between individual elements of data.

Accepted Answer

Data Structure

Question 31

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

Accepted Answer

True

Question 32

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

Accepted Answer

True

Question 33

In the declaration, int *p,  q, only p is a pointer variable.

Accepted Answer

True

Question 34

This operation means to add the node to the end of the list.

Accepted Answer

Append

Question 35

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

Accepted Answer

True

Question 36

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 37

Array is an example of homogeneous data structures.

Accepted Answer

True

Question 38

TRUE/FALSE: Program = Algorithms + Data Structures

Accepted Answer

True

Question 39

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 40

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

Accepted Answer

True

Question 41

TRUE/FALSE: The * operator in front of a pointer variable produces the variable to which it points. When used this way, the * operator is called the dereferencing operator.

Accepted Answer

True

Question 42

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

Accepted Answer

False

Question 43

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 44

Any new dynamic variable created by a program consumes some of the memory in the freespace

Accepted Answer

False

Question 45

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 46

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

Accepted Answer

True

Question 47

The following are examples of non-linear list, except:

Accepted Answer

Stack

Question 48

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

Accepted Answer

False

Question 49

When you apply delete to a pointer variable, the dynamic variable to which it is pointing is destroyed.

Accepted Answer

True

Question 50

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 51

A linked list is variable in size.

Accepted Answer

True

Question 52

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

Accepted Answer

True

Question 53

A linked list can grow or shrink in size as the program runs.

Accepted Answer

True

Question 54

char &ch is  valid pointer declaration

Accepted Answer

False

Question 55

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

Accepted Answer

True

"Know" box contains:
Time elapsed:
Retries:

DATA STRUCT MOD 1&2