22. A pointer variable whose sole purpose is to locate the first node in a linked list is called a. the list's top c. the list's link b. the node's link d. the list's head

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
22. A pointer variable whose sole purpose is to locate the first node in a linked list is called
b. the node's link
a. the list's top
c. the list's link
d. the list's head
23. Which of the following will be true when the pointer variable cur references the last node in
a linear linked list?
c. head == NULL
a. cur == NULL
b. cur->next == NULL
d. head->next == NULL
24. Which of the following statements deletes the first node of a linear linked list that has 10
nodes?
a. head->next - cur->next;
b. head - head->next;
c. prev->next - cur->next;
d. head NULL;
25. An array-based implementation of an linked list
a. requires less memory to store an item than a pointer-based implementation
b. is not a good choice for a small list
d. has items which explicitly point to the next items
c. has a variable access time
26. In a pointer-based implementation of an linked list,.
a. increasing the size of the list can waste storage and time
b. less memory is required to store an item than in an array-based implementation
c. an item explicitly points to the next item
d. items can be accessed directly with equal access time
27. Which of the following statements inserts a new node, pointed to by newPtr, at the end of a
linear linked list?
a. newPtr->next = cur;
prev->next = newPtr;
b. newPtr->next = head;
head - newPtr;
c. newPtr->next - NULL;
d. prev->next = cur;
newPtr->next = cur;
28. In a linear linked list,.
a. the next pointer of each node has the value NULL
b. the last node points to the first node
c. the precede pointer of the dummy head node points to the last node
d. the next pointer of the last node has the value NULL
Transcribed Image Text:22. A pointer variable whose sole purpose is to locate the first node in a linked list is called b. the node's link a. the list's top c. the list's link d. the list's head 23. Which of the following will be true when the pointer variable cur references the last node in a linear linked list? c. head == NULL a. cur == NULL b. cur->next == NULL d. head->next == NULL 24. Which of the following statements deletes the first node of a linear linked list that has 10 nodes? a. head->next - cur->next; b. head - head->next; c. prev->next - cur->next; d. head NULL; 25. An array-based implementation of an linked list a. requires less memory to store an item than a pointer-based implementation b. is not a good choice for a small list d. has items which explicitly point to the next items c. has a variable access time 26. In a pointer-based implementation of an linked list,. a. increasing the size of the list can waste storage and time b. less memory is required to store an item than in an array-based implementation c. an item explicitly points to the next item d. items can be accessed directly with equal access time 27. Which of the following statements inserts a new node, pointed to by newPtr, at the end of a linear linked list? a. newPtr->next = cur; prev->next = newPtr; b. newPtr->next = head; head - newPtr; c. newPtr->next - NULL; d. prev->next = cur; newPtr->next = cur; 28. In a linear linked list,. a. the next pointer of each node has the value NULL b. the last node points to the first node c. the precede pointer of the dummy head node points to the last node d. the next pointer of the last node has the value NULL
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps

Blurred answer
Knowledge Booster
Lists
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education