Question 1

C provides the four functions, malloc(), calloc(), realloc(), and free() to control the dynamic allocation and release of memory space.

Accepted Answer

A) True 
 B)False

Question 2

In making requests for dynamic memory allocation, it is extremely important to always check the return value; otherwise, the program will crash when a subsequent access to nonexistent memory is made.

Accepted Answer

A) True 
 B)False

Question 3

Items are removed from a queue in the order in which they were entered.

Accepted Answer

A) True 
 B)False

Question 4

Which of the following statements is correct with respect to the TeleType structure declaration?
Struct TeleType
{
Char name[30];
Char phoneNum[15];
Struct TeleType *nextaddr;
};

Accepted Answer

A) It is not valid in C 
B) Can be used to create a linked list of TeleType structures 
C) May be valid depending on the compiler 
D) Generates a "self-referencing" compiler warning 
A) It is not valid in C 
B) Can be used to create a linked list of TeleType structures 
C) May be valid depending on the compiler 
D) Generates a "self-referencing" compiler warning

Question 5

You should never forget to restore the allocated block of storage back to the operating system using free(); otherwise, the allocated storage will be lost until you reboot the computer.

Accepted Answer

A) True 
 B)False

Question 6

The indirection operator in C is ____.

Accepted Answer

A) ")" 
B) -> 
C) & 
D) * 
A) ")" 
B) -> 
C) & 
D) *

Question 7

The expression *emp.ptPay is equivalent to the expression ____.

Accepted Answer

A) *(emp.ptPay) 
B) (*emp).ptPay 
C) *emp->ptPay 
D) *(emp.)ptPay 
A) *(emp.ptPay) 
B) (*emp).ptPay 
C) *emp->ptPay 
D) *(emp.)ptPay

Question 8

Deleting a structure in a linked list is essentially the reverse process of inserting a structure.

Accepted Answer

A) True 
 B)False

Question 9

The dot operator has a lower precedence than the indirection operator.

Accepted Answer

A) True 
 B)False

Question 10

____ reserves space for an array of n elements of the specified size.

Accepted Answer

A) malloc() 
B) calloc() 
C) realloc() 
D) nalloc() 
A) malloc() 
B) calloc() 
C) realloc() 
D) nalloc()

Question 11

The expression t1.nextaddr->name can be replaced by the equivalent expression ____.

Accepted Answer

A) (*t1.nextaddr).name 
B) (&t1.nextaddr).name 
C) *(*t1.nextaddr).name 
D) *((*t1.nextaddr).name) 
A) (*t1.nextaddr).name 
B) (&t1.nextaddr).name 
C) *(*t1.nextaddr).name 
D) *((*t1.nextaddr).name)

Question 12

The member operator is evaluated from right to left.

Accepted Answer

A) True 
 B)False

Question 13

The structure pointer operator is ____.

Accepted Answer

A) ")" 
B) -> 
C) & 
D) * 
A) ")" 
B) -> 
C) & 
D) *

Question 14

A dynamically linked list permits adding or deleting a structure from anywhere within the list.

Accepted Answer

A) True 
 B)False

Question 15

A queue is a LIFO structure.

Accepted Answer

A) True 
 B)False

Question 16

In addition to an end-of-list sentinel value in a linked list, we must provide a special pointer for storing the address of the last structure in the list.

Accepted Answer

A) True 
 B)False

Question 17

____ memory allocation makes it unnecessary to reserve a fixed amount of memory for a scalar, array, or structure variable in advance.

Accepted Answer

A) Dynamic 
B) Static 
C) Partial 
D) Advanced 
A) Dynamic 
B) Static 
C) Partial 
D) Advanced

Question 18

A ____ is a special type of linked list in which objects can only be added to and removed from the top of the list.

Accepted Answer

A) heap 
B) stack 
C) queue 
D) set 
A) heap 
B) stack 
C) queue 
D) set

Question 19

malloc() returns the address of the first reserved location, as an address of a void data type, or the program exits if sufficient memory is not available.

Accepted Answer

A) True 
 B)False

Question 20

The operation of removing an item from a queue is formally referred to as serving.

Accepted Answer

A) True 
 B)False

C provides the four functions, malloc(), calloc(), realloc(), and free() to control the dynamic allocation and release of memory space.

In making requests for dynamic memory allocation, it is extremely important to always check the return value; otherwise, the program will crash when a subsequent access to nonexistent memory is made.

Items are removed from a queue in the order in which they were entered.

Which of the following statements is correct with respect to the TeleType structure declaration? Struct TeleType { Char name[30]; Char phoneNum[15]; Struct TeleType *nextaddr; };

You should never forget to restore the allocated block of storage back to the operating system using free(); otherwise, the allocated storage will be lost until you reboot the computer.

The indirection operator in C is ____.

The expression *emp.ptPay is equivalent to the expression ____.

Deleting a structure in a linked list is essentially the reverse process of inserting a structure.

The dot operator has a lower precedence than the indirection operator.

____ reserves space for an array of n elements of the specified size.

The expression t1.nextaddr->name can be replaced by the equivalent expression ____.

The member operator is evaluated from right to left.

The structure pointer operator is ____.

A dynamically linked list permits adding or deleting a structure from anywhere within the list.

A queue is a LIFO structure.

In addition to an end-of-list sentinel value in a linked list, we must provide a special pointer for storing the address of the last structure in the list.

____ memory allocation makes it unnecessary to reserve a fixed amount of memory for a scalar, array, or structure variable in advance.

A ____ is a special type of linked list in which objects can only be added to and removed from the top of the list.

malloc() returns the address of the first reserved location, as an address of a void data type, or the program exits if sufficient memory is not available.

The operation of removing an item from a queue is formally referred to as serving.

Introduction to Computer Programming

Getting Started in C Programming

Processing and Interactive Input

Selection

Repetition

Modularity Using Functions: Part I

Modularity Using Functions: Part II

Arrays

Character Strings

Data Files

Arrays, Addresses, and Pointers

Structures

Additional Capabilities

A Brief Introduction to C++

Filters

Exam 13: Dynamic Data Structures

C provides the four functions, malloc(), calloc(), realloc(), and free() to control the dynamic allocation and release of memory space.

In making requests for dynamic memory allocation, it is extremely important to always check the return value; otherwise, the program will crash when a subsequent access to nonexistent memory is made.

Items are removed from a queue in the order in which they were entered.

Which of the following statements is correct with respect to the TeleType structure declaration? Struct TeleType { Char name[30]; Char phoneNum[15]; Struct TeleType *nextaddr; };

You should never forget to restore the allocated block of storage back to the operating system using free(); otherwise, the allocated storage will be lost until you reboot the computer.

The indirection operator in C is ____.

The expression *emp.ptPay is equivalent to the expression ____.

Deleting a structure in a linked list is essentially the reverse process of inserting a structure.

The dot operator has a lower precedence than the indirection operator.

____ reserves space for an array of n elements of the specified size.

The expression t1.nextaddr->name can be replaced by the equivalent expression ____.

The member operator is evaluated from right to left.

The structure pointer operator is ____.

A dynamically linked list permits adding or deleting a structure from anywhere within the list.

A queue is a LIFO structure.

In addition to an end-of-list sentinel value in a linked list, we must provide a special pointer for storing the address of the last structure in the list.

____ memory allocation makes it unnecessary to reserve a fixed amount of memory for a scalar, array, or structure variable in advance.

A ____ is a special type of linked list in which objects can only be added to and removed from the top of the list.

malloc() returns the address of the first reserved location, as an address of a void data type, or the program exits if sufficient memory is not available.

The operation of removing an item from a queue is formally referred to as serving.

Introduction to Computer Programming

Getting Started in C Programming

Processing and Interactive Input

Selection

Repetition

Modularity Using Functions: Part I

Modularity Using Functions: Part II

Arrays

Character Strings

Data Files

Arrays, Addresses, and Pointers

Structures

Additional Capabilities

A Brief Introduction to C++

Filters