COMPUTER SCIENCE ILLUMIN.-TEXT
COMPUTER SCIENCE ILLUMIN.-TEXT
7th Edition
ISBN: 9781284156010
Author: Dale
Publisher: Jones & Barlett
Expert Solution & Answer
Book Icon
Chapter 18, Problem 34E

a.

Explanation of Solution

Representing the numbers in a linked list:

  • The numbers can be represented in a linked list by representing each digit in a node.
  • Then, the digits in the number 1066 is 1, 0, 6, and 6 which can be represented separately in a linked list as shown:

b.

Explanation of Solution

Addition of two numbers in two different lists and storing the results in another list:

  • To add the numbers present in two linked lists, the values present in each node should be added from right to left.
    • The carry should be added with the previous node values...

c.

Explanation of Solution

Algorithm to add two numbers in two different lists and storing the results in another list:

// Set the current pointer of first linked list to point

// the last node of the first linked list.

Set ptr1 to last

// Set the current pointer of second linked list to point

// the last node of the second linked list.

Set ptr2 to last

// Set the value 0 to the variable “remainder”

Set remainder to 0

// Continue the following set of statements until the first // linked list and second linked list becomes empty.

While (ptr1 <> NULL and ptr2 <> NULL)

  // Create a new node.

  Get a node_new

// Add the value of the node where the current pointer

  // of first linked list points with the value of the

// node where the current pointer of second linked

// list points.

// Then by using the MOD function perform the division

// to get the remainder of the additional values and

  // set it to new node.

Set info(node_new) to (info(ptr1) + info(ptr2) + remainder) MOD 10

// Add the value of the node where the current pointer

  // of first linked list points with the value of the

// node where the current pointer of second linked

// list points.

// Then by using the DIV function perform the division // to get the quotient of the additional values and

// set it to new node

Set remainder to (info(ptr1) + info(ptr2) + remainder)DIV 10

// Set the current pointer of first linked list to

  // point the previous node of the current node of the

  // first linked list...

Blurred answer
Knowledge Booster
Background pattern image
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education