Question 1

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

Accepted Answer

False

Question 2

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

Accepted Answer

True

Question 3

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

Accepted Answer

False

Question 4

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.

True
False

Accepted Answer

True

Question 5

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

Accepted Answer

False

Question 6

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

Accepted Answer

True

Question 7

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

Accepted Answer

True

Question 8

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

Accepted Answer

False

Question 9

Character is a primitive data structure.

True
False

Accepted Answer

True

Question 10

TRUE/FALSE: Program = Algorithms + Data Structures

True
False

Accepted Answer

True

Question 11

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

Accepted Answer

True

Question 12

TRUE/FALSE: Refer to ADT: The ADT is DYNAMIC.

True
False

Accepted Answer

True

Question 13

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

Accepted Answer

True

Question 14

The address of operator is a unary operator that returns the address of its operand.

@
&
->
~

Accepted Answer

&

Question 15

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.

False
True

Accepted Answer

True

Question 16

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

Accepted Answer

False

Question 17

The following are characteristics of non-primitive data types, except:

The non-primitive data structures emphasize on structuring of a group of homogeneous data items only.

They are more sophisticated data types.

Accepted Answer

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

Question 18

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

Accepted Answer

True

Question 19

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

Accepted Answer

True

Question 20

Abstraction is providing only essential information outside the world.

True
False

Accepted Answer

True

Question 21

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

Accepted Answer

False

Question 22

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

Accepted Answer

False

Question 23

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

Accepted Answer

True

Question 24

Typedef is declared within the main program.

True
False

Accepted Answer

False

Question 25

A circular linked list has 2 node pointers.

True
False

Accepted Answer

False

Question 26

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

Accepted Answer

False

Question 27

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.

True
False

Accepted Answer

True

Question 28

Array is an example of homogeneous data structures.

True
False

Accepted Answer

True

Question 29

The following are examples of primitive data structures, except.

Integer
Array
Character
Float

Accepted Answer

Array

Question 30

Which of the following is the proper way of declaring a pointer variables of type char?

char *p, *q;
.*char p, q;
&char p, q;
.char &p, &q;

Accepted Answer

char *p, *q;

Question 31

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

Accepted Answer

True

Question 32

You said:
This node is responsible to handle the data that will be added to the linked list.

nodePtr
newNode
previous
head

Accepted Answer

newNode

Question 33

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

Accepted Answer

True

Question 34

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

Accepted Answer

True

Question 35

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

Accepted Answer

True

Question 36

It is is a step by step procedure to solve a particular function.

Program
Data
Algorithm
Process

Accepted Answer

Algorithm

Question 37

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

Accepted Answer

False

Question 38

It is a memory address of a variable. 

Address of a Variable
Variable
Pointer
Pointer Variable

Accepted Answer

Address of a Variable

Question 39

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

Accepted Answer

True

Question 40

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

Accepted Answer

True

Question 41

Queue adds anywhere, removes the highest priority

True
False

Accepted Answer

False

Question 42

Abstraction means separating the logical properties from the implementation details.

True
False

Accepted Answer

True

Question 43

char &ch is  valid pointer declaration

True
False

Accepted Answer

False

Question 44

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

Accepted Answer

True

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.

True
False

Accepted Answer

True

Question 46

A linked list is a series of connected nodes, where each node is a data structure.

True
False

Accepted Answer

True

Question 47

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

Accepted Answer

False

Question 48

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.

True
False

Accepted Answer

True

Question 49

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

Accepted Answer

False

Question 50

Insertion and deletion of nodes is quicker with linked lists than with vectors.

True
False

Accepted Answer

True

Question 51

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

Accepted Answer

False

Question 52

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

Accepted Answer

True

Question 53

Pointer is a non-primitive data structure.

True
False

Accepted Answer

False

DSA FA1

DATA STRUCUTRES AND ALGORITHMS FORMATIVE ASSESSMENT 1

"Know" box contains:
Time elapsed:
Retries: