Concepts Of Programming Languages
12th Edition
ISBN: 9780134997186
Author: Sebesta, Robert W.
Publisher: Pearson,
expand_more
expand_more
format_list_bulleted
Textbook Question
Chapter 9, Problem 7PS
Consider the following program written in C syntax:
void fun (int first, int second) {
first += first;
second += second;
}
Void main () {
int list [2] = {1, 3};
fun (list [0], list[1]);
}
For each of the following parameter-passing methods, what are the values of the list array after execution?
- a. Passed by value
- b. Passed by reference
- c. Passed by value-result
Expert Solution & Answer
Trending nowThis is a popular solution!
Students have asked these similar questions
Using java, write an easier version of a linked list with only a couple of the normal linked list functions and the ability to generate and utilize a list of ints. The data type of the connection to the following node can be just Node, and the data element can be just an int. You will need a reference like (Java) or either a reference to the first node, as well as one to the last node.
(Answer the following questions)
1) Create a method or function that accepts an integer, constructs a node with that integer as its data value, and then includes the node to the end of the list. If the new node is the first one, this function will also need to update the reference to the first node. This function will need to update the reference to the final node. Consider how to insert the new node following the previous last node, and keep in mind that the next reference for the list's last node should be null.
2) Create a different method or function that iteratively explores the list, printing…
What would be a way in implementing the Josephus problem in C++ using a vector or a list? That takes in three parameters, one the number of knights for the knight parameter. The second parameter, "skip", is the number of knights to skip and to execute the next night. Then the third parameter "start", is the index of the knight to execute first.
in c++
Suppose we implement a doubly linked list class template LinkedList with template type T. LinkedList has fields Node *headPtr, Node *tailPtr and int length, where the struct type Node has fields prev and next of type Node* along with data of type T. The prev and next pointers of each Node point to the previous and next Nodes in the list (or are respectively null in the case of the list’s head or tail node). headPtr and tailPtr should always point respectively to the first and last Nodes in the list (or be null if the list is empty) .
Implement a member function
void insertAtEnd(const T & d) that allocates a new Node with data equal to d and inserts it at the end of the linked list.
ONLY type the function code, not the whole class . Do not call any other member functions of the LinkedList class.
Linked list class:
#ifndef LINKED_LIST_H
#define LINKED_LIST_H
#include "pch.h"
template <class T>
class Node {
public:
T data;
Node<T> * next;…
Chapter 9 Solutions
Concepts Of Programming Languages
Additional Engineering Textbook Solutions
Find more solutions based on key concepts
Suppose the classes PartTimeEmployee and FullTimeEmployee inherited the properties of the class Employee. What ...
Computer Science: An Overview (13th Edition) (What's New in Computer Science)
What is a keyword? List some Java keywords.
Introduction to Java Programming and Data Structures, Comprehensive Version (11th Edition)
Suppose savings and expenses are variables of type double that have been given values. Write an if-else stateme...
Problem Solving with C++ (10th Edition)
Rewrite the definition of the method writeoutput for the class Undergraduate in Listing 8.4, using getName and ...
Java: An Introduction to Problem Solving and Programming (7th Edition)
Knowledge Booster
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
- Suppose we have a singly linked list implemented with the structure below and a function that takes in the head of the list.typedef struct node{int num;struct node* next;} node;int whatDoesItDo (node * head){struct node * current = head;struct node * other, *temp;if (current == NULL)return head;other = current->next;if (other == NULL)return head;other = other->next;temp = current->next;current->next = other->next;current = other->next;if (current == NULL){head->next = temp;return head;}other->next = current->next;current->next = temp;return head;}If we call whatDoesItDo(head) on the following list, show the list after the function has finished.head -> 1 -> 2 -> 3 -> 4 -> 5 -> 6 -> 7arrow_forwardPlease implement the following problem in C++: Although a queue is "best" implemented with a list, it can be implemented with a vector if you take into account the starting position of the queue. For example, if five elements are pushed onto the queue, the start of the queue is at position zero and the end is at position 4. If we, then, pop two elements, the start would be at position 2 and the end at position 4. The two "popped" elements are not really removed from the vector, and that avoids the O(N) time problem for the pop function.Implement a class which uses a vector to store the queue. Be mindful of performance, such that if the queue is empty, the size of the underlying vector is "reset."arrow_forwardIn Haskell, use list comprehension to return all the numbers greater than 18 and divisible by 2 in the list [12, 24, 25, 28, 30, 33, 35] Write a Haskell function that takes a list and an integer n as parameters and returns the nth item in the list. EX. [1,2,3,4] 2 gives 3 and [1,2,3,4] 1 gives 2arrow_forward
- Implement in C Programming 8.18.1: LAB: Simple linked list Given an IntNode struct and the operating functions for a linked list, complete the following functions to extend the functionality of the linked list: IntNode* IntNode_GetNth(IntNode* firstNode, int n)- Return a pointer to the nth node of the list starting at firstNode. void IntNode_PrintList(IntNode* firstNode) - Call IntNode_PrintNodeData() to output values of the list starting at firstNode. Do not add extra space characters in between values. int IntNode_SumList(IntNode* firstNode) - Return the sum of the values of all nodes starting at firstNode. Note: The code for IntNode_Create() provided here differs from the code shown in the book. The given main() performs various actions to test IntNode_GetNth(), IntNode_PrintList(), and IntNode_SumList(). main() reads 5 integers from a user: The number of nodes to be added to a new list The value of the first node of the list An increment between the values of two consecutive…arrow_forwardWrite a Java program which stores three values by using singly linked list.- Node class1. stuID, stuName, stuScore, //data fields2. constructor3. update and accessor methods- Singly linked list class which must has following methods:1. head, tail, size// data fields2. constructor3. update and accessor methodsa. getSize() //Returns the number of elements in the list.b. isEmpty( ) //Returns true if the list is empty, and false otherwise.c. getFirstStuID( ), getStuName( ), getFirstStuScore( )d. addFirst(stuID, stuName, stuScore)e. addLast(stuID, stuName, stuScore)f. removeFirst ( ) //Removes and returns the first element of the list.g. displayList( ) //Displays all elements of the list by traversing the linked list.- Test class – initialize a singly linked list instance. Test all methods of singly linked list classarrow_forwardWrite a program in c++ and make sure it works, that reads a list of students (first names only) from a file. It is possible for the names to be in unsorted order in the file but they have to be placed in sorted order within the linked list.The program should use a doubly linked list.Each node in the doubly linked list should have the student’s name, a pointer to the next student, and a pointer to the previous student. Here is a sample visual. The head points to the beginning of the list. The tail points to the end of the list. When inserting consider all the following conditions:if(!head){ //no other nodes}else if (strcmp(data, head->name)<0){ //smaller than head}else if (strcmp(data, tail->name)>0){ //larger than tail}else{ //somewhere in the middle} When deleting a student consider all the following conditions:student may be at the head, the tail or in the middleBelow, you will find a sample of what the file looks like. Notice the names are in…arrow_forward
- in java, Two abstract data types are the ordered list and the unordered list. Explain how these two ADTs are similar and how they differ. To answer this question, assume that you do not know how they are implemented (that is, whether they are implemented using an array or a linked list).arrow_forwardFortran, C++ and other languages use the assignment operator form like this: variable := expressions, but ALGOL 58 and Plankalkul used: used expression => variable form. Demonstrate using pseudo code how a C++ "linked" (link list) object would have to be modified to revert to the ALGOL 58 standard. HINT: think private member data, accessors and mutators etc. A. &Next <= alpha(A) B. alpha A &A=>&Next C. alpha * A; alpha B; A = new alpha; A->setnext(&B); D. alpha * Next; void setNext(alpha A) { &A => Next; }arrow_forwardWrite a program in Java to manipulate a Double Linked List: Count the number of nodes Insert a new node before the value 7 of Double Linked List Search an existing element in a Double linked list (the element of search is given by the user) Suppose List contained the following Test Data: Input the number of nodes : 4Input data for node 1 : 5Input data for node 2 : 6 Input data for node 3 : 7 Input data for node 4: 9arrow_forward
- In C++, how do I read a file with numbers Such as 1,2 3,4 5,6 and place it into a linked list with x,y values Without stringstream or sstream and vectorsarrow_forwardWrite a program in c++ which will concatenate two single linked lists. The structure is defined below. Assume that head1 contains the starting address of the first list and head2contains the starting address of the second list. You need to join them together so that allthe students’ roll number and name of both the lists will display together with the help of head1pointer.struct link{int rollno;char name[20];struct link *next;};typedef struct link node;node *head1=NULL, *head2=NULL; //global declarationarrow_forwardPlease code this in Java Or C or C++ Given two numbers represented by a linked list, where each node contains a single digit. The digits are stored in reverse order, such that the 1's digit is at the head of the list. Write a function that adds the two numbers and return the sum as linked list: Example : Input : (7-> 1 -> 6) + (5-> 9-> 2). That is 617 + 295 = 912 Output : 2-> 1 -> 9 Expected time complexity : O(m+n), where m and n are no. of nodes in first and second linked list respectively.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
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)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education
Introduction to Linked List; Author: Neso Academy;https://www.youtube.com/watch?v=R9PTBwOzceo;License: Standard YouTube License, CC-BY
Linked list | Single, Double & Circular | Data Structures | Lec-23 | Bhanu Priya; Author: Education 4u;https://www.youtube.com/watch?v=IiL_wwFIuaA;License: Standard Youtube License