Question 1

The operation of removing a structure from a dynamically linked list is called a(n) ____.

Accepted Answer

A)  POP 
B)  SERVE 
C)  REMOVE 
D)  DELETE 
A)  POP 
B)  SERVE 
C)  REMOVE 
D)  DELETE D

Question 2

The function prototype for malloc() is contained in the stdio.h header file.

Accepted Answer

A) True 
 B)False  False

Question 3

The function call ____ requests enough memory to store 10 characters.

Accepted Answer

A) realloc(10,sizeof(char)) 
B) calloc(sizeof(char),10) 
C) malloc(sizeof(char)) 
D) malloc(10 sizeof(char)) 
A) realloc(10,sizeof(char)) 
B) calloc(sizeof(char),10) 
C) malloc(sizeof(char)) 
D) malloc(10 sizeof(char)) D

Question 4

The advantage to the calloc() function is that it initializes all newly allocated numeric memory to 0 and character allocated memory to NULL.

Accepted Answer

A) True 
 B)False

Question 5

____ reserves the number of bytes requested by the argument passed to the function.

Accepted Answer

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

Question 6

Placing a new item on top of the queue is formally referred to as ____.

Accepted Answer

A) enqueueing 
B) serving 
C) pushing 
D) inserting 
A) enqueueing 
B) serving 
C) pushing 
D) inserting

Question 7

All programming languages that support pointers provide a special pointer value, known as both NULL and ____, that acts as a sentinel or flag to indicate when the last structure has been processed.

Accepted Answer

A) FALSE 
B) VOID 
C) NIL 
D) INVALID 
A) FALSE 
B) VOID 
C) NIL 
D) INVALID

Question 8

____ changes the size of previously allocated memory to a new size.

Accepted Answer

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

Question 9

The operation of placing a new structure on the top of a stack is called a ____.

Accepted Answer

A) PUSH 
B) POP 
C) INSERT 
D) PUT 
A) PUSH 
B) POP 
C) INSERT 
D) PUT

Question 10

In computer programming, stacks are used in all function calls to store and retrieve data input to and retrieved from the function, respectively.

Accepted Answer

A) True 
 B)False

Question 11

The operation of adding a new structure to a dynamically linked list is called a(n) ____.

Accepted Answer

A)  PUSH 
B)  ENQUEUE 
C)  INSERT 
D)  ADD 
A)  PUSH 
B)  ENQUEUE 
C)  INSERT 
D)  ADD

Question 12

The expression t1.nextaddr->name is evaluated as ____.

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 13

A linked list provides a convenient method for maintaining a constantly changing list without the need to reorder and restructure the complete list continually.

Accepted Answer

A) True 
 B)False

Question 14

Dynamic memory allocation is also known as ____ allocation.

Accepted Answer

A) partial 
B) static 
C) run-time 
D) advanced 
A) partial 
B) static 
C) run-time 
D) advanced

Question 15

The structure pointer operator is evaluated from left to right.

Accepted Answer

A) True 
 B)False

Question 16

Structures that are "linked" together by including the address of the next structure in the structure immediately preceding it are known as ____ structures.

Accepted Answer

A) linked 
B) self-referencing 
C) dynamic 
D) sequential 
A) linked 
B) self-referencing 
C) dynamic 
D) sequential

Question 17

Each structure in a linked list has the same format.

Accepted Answer

A) True 
 B)False

Question 18

The following function cycles through a linked list and displays its contents. Line 3 can be replaced with ____.
1 void display(struct myStruct *contents)
2 {
3 while (contents != NULL)
4 {
5 printf("%-30s
",contents->name, contents->phoneNum);
6 contents = contents->nextaddr;
7 }
8 }

Accepted Answer

A) while (isValid(contents)) 
B) while (contents != EOF) 
C) while (!contents) 
D) while (contents != NIL) 
A) while (isValid(contents)) 
B) while (contents != EOF) 
C) while (!contents) 
D) while (contents != NIL)

Question 19

The following is an example of the creation of a(n) ____ in C.
First = &t1;
T1)nextaddr = &t2;
T2)nextaddr = &t3;
T3)nextaddr = NULL;

Accepted Answer

A) array 
B) stack 
C) linked list 
D) queue 
A) array 
B) stack 
C) linked list 
D) queue

Question 20

A stack requires a separate stack pointer that contains the address of the first structure added to the stack.

Accepted Answer

A) True 
 B)False

The operation of removing a structure from a dynamically linked list is called a(n) ____.

The function prototype for malloc() is contained in the stdio.h header file.

The function call ____ requests enough memory to store 10 characters.

The advantage to the calloc() function is that it initializes all newly allocated numeric memory to 0 and character allocated memory to NULL.

____ reserves the number of bytes requested by the argument passed to the function.

Placing a new item on top of the queue is formally referred to as ____.

All programming languages that support pointers provide a special pointer value, known as both NULL and ____, that acts as a sentinel or flag to indicate when the last structure has been processed.

____ changes the size of previously allocated memory to a new size.

The operation of placing a new structure on the top of a stack is called a ____.

In computer programming, stacks are used in all function calls to store and retrieve data input to and retrieved from the function, respectively.

The operation of adding a new structure to a dynamically linked list is called a(n) ____.

The expression t1.nextaddr->name is evaluated as ____.

A linked list provides a convenient method for maintaining a constantly changing list without the need to reorder and restructure the complete list continually.

Dynamic memory allocation is also known as ____ allocation.

The structure pointer operator is evaluated from left to right.

Structures that are "linked" together by including the address of the next structure in the structure immediately preceding it are known as ____ structures.

Each structure in a linked list has the same format.

The following function cycles through a linked list and displays its contents. Line 3 can be replaced with ____. 1 void display(struct myStruct *contents) 2 { 3 while (contents != NULL) 4 { 5 printf("%-30s\n",contents->name, contents->phoneNum); 6 contents = contents->nextaddr; 7 } 8 }

The following is an example of the creation of a(n) ____ in C. First = &t1; T1)nextaddr = &t2; T2)nextaddr = &t3; T3)nextaddr = NULL;

A stack requires a separate stack pointer that contains the address of the first structure added to the stack.

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

The operation of removing a structure from a dynamically linked list is called a(n) ____.

The function prototype for malloc() is contained in the stdio.h header file.

The function call ____ requests enough memory to store 10 characters.

The advantage to the calloc() function is that it initializes all newly allocated numeric memory to 0 and character allocated memory to NULL.

____ reserves the number of bytes requested by the argument passed to the function.

Placing a new item on top of the queue is formally referred to as ____.

All programming languages that support pointers provide a special pointer value, known as both NULL and ____, that acts as a sentinel or flag to indicate when the last structure has been processed.

____ changes the size of previously allocated memory to a new size.

The operation of placing a new structure on the top of a stack is called a ____.

In computer programming, stacks are used in all function calls to store and retrieve data input to and retrieved from the function, respectively.

The operation of adding a new structure to a dynamically linked list is called a(n) ____.

The expression t1.nextaddr->name is evaluated as ____.

A linked list provides a convenient method for maintaining a constantly changing list without the need to reorder and restructure the complete list continually.

Dynamic memory allocation is also known as ____ allocation.

The structure pointer operator is evaluated from left to right.

Structures that are "linked" together by including the address of the next structure in the structure immediately preceding it are known as ____ structures.

Each structure in a linked list has the same format.

The following function cycles through a linked list and displays its contents. Line 3 can be replaced with ____. 1 void display(struct myStruct *contents) 2 { 3 while (contents != NULL) 4 { 5 printf("%-30s\n",contents->name, contents->phoneNum); 6 contents = contents->nextaddr; 7 } 8 }

The following is an example of the creation of a(n) ____ in C. First = &t1; T1)nextaddr = &t2; T2)nextaddr = &t3; T3)nextaddr = NULL;

A stack requires a separate stack pointer that contains the address of the first structure added to the stack.

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