Answered: Q2: a) Create a function void print()… | bartleby

C++ Programming: From Problem Analysis to Program Design

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter17: Linked Lists

Section: Chapter Questions

Problem 5PE

See similar textbooks

Related questions

Question

In c++

Q2: a) Create a function void print() in QueueArray class that prints the elements from first to last.
b) Create a function void reverseK(QueueArray<int> q, int k) that reverse the first k elements in
the q. if k = 0, it does nothing (return ;) else it reverses the first k element as:
If the q [1,2,3,4] reverse(q,3) makes the q to be [3,2,1,4]
If the q [7,8,2,14,5] reverse(q,4) makes the q to be [14,2,8,7,5]
Test your functions in the main driver

Expert Solution

Step by step

Solved in 2 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Blurred answer

Similar questions

Java Programming : A party has been organised on cruise. The party is organised for a limited time (T). The number of guests entering (E[i]) and leaving (L[i]) the party at every hour is represented as elements of the array. The task is to find the maximum number of guests present on the cruise at any given instance within T hours. Example 1: Input : 5 > Value of T [7,0,5,1,3] -> E[], Element of E[0] to E[N-1], where input each element is separated by new line [1,2,1,3,4] -> L[], Element of L[0] to L[N-1], while input each element is separate by new line. Output : 8 -> Maximum number of guests on cruise at an instance. Explanation: 1st hour: Entry 7 Exit: 1 No. of guests on ship : 6 2nd hour : Entry Exit : 2 No. of guests on ship: 6-2=4 Hour 3: Entry: 5 Exit: 1 No. of guests on ship : 4+5-1-8 Hour 4: Entry 1 Exit 3 No. of guests on ship: 8+1-3=6 Hour 5: Entry 3 Exit: 4 No. of guests on ship: 6+3-4-5 Hence, the maximum number of guests within 5 hours is 8.
python assignment Matrix class Implement a matrix class (in matrix.py). a) The initializer should take a list of lists as an argument, where each outer list is a row, and each value in an inner list is a value in the corresponding row. b) Implement the __str__ method to nicely format the string representation of the matrix: one line per row, two characters per number (%2d) and a space between numbers. For example: m = Matrix([[1,0,0],[0,1,0],[0,0,1]]) print(m)> 1 0 0> 0 1 0> 0 0 1 c) Implement a method scale(factor) that returns a new matrix where each value is multiplied by scale. For example: m = Matrix([[1,2,3],[4,5,6],[7,8,9]])n = m.scale(2)print(n)> 2 4 6> 8 10 12>14 16 18print(m)> 1 2 3> 4 5 6> 7 8 9 d) Implement a method transpose() that returns a new matrix that has been transposed. Transposing flips a matrix over its diagonal: it switches rows and columns. m = Matrix([[1,2,3],[4,5,6],[7,8,9]])print(m)> 1 2 3> 4 5 6> 7 8…
JAVA Problem Create a function that determines whether elements in an array can be re-arranged to form a consecutive list of numbers where each number appears exactly once. Examples cons([5, 1, 4, 3, 2]) → true // Can be re-arranged to form [1, 2, 3, 4, 5] cons([5, 1, 4, 3, 2, 8]) → false cons([5, 6, 7, 8, 9, 9]) → false //9 appears twice
Duplicate Set This function will receive a list of elements with duplicate elements. It should add all of the duplicate elements to a set and return the set containing the duplicate elements. A duplicate element is an element found more than one time in the specified list. The order of the set does not matter. Signature: public static HashSet<Object> duplicateSet(ArrayList<Object> list) Example: INPUT: [2, 4, 5, 3, 3, 5] OUTPUT: {5, 3}
Course: Data Structurre and algorithms Language: Java Make a Program in java. Read the properly its easy but explained in theory. You have to solve ( make program ) the question by properly as you can error and ommisions will be accepted please. Kindly make it unque dont copy paste. <You have to solve this question as you can kindly dont excusses> Implement a global function“CompareNumbers”which is passed twoSlinkedListobjects as parametersnamed list1, and list2. The function will compare both the numbers corresponding to the lists and will return 0 if both the numbers are equal, return 1 if number corresponding to list1 is greater and will return 2 if number corresponding to list2 is greater. For this task you have to choose an appropriate data structure that will help you do this task in the most efficient manner with regard to time and space complexity.You are allowed to reverse the linked lists for this task. intCompareNumbers(SlinkedList list1, SlinkedList list2)
1- Persistent variables cannot be accessed from outside the function. (True or False 2- Define a 5*1 empty cell array and then fill it with ones. 3- If A=[5 2] and B-[8; 9; 6] then create 3*3 matrix by concatenating A and B. 4- If S=struct([1), then the size(S)= 5- What is the value of I= any([1, 0, 3]&&[0, 8, 0]) in Matlab? I= 6- If K=[2 5 7], then max(K, 5.5)= matlab
8Consider the following ANSI C function: int SimpleFunction (int Y[ ], int n, int rx) { int total = Y[0], looplndex; for (looplndex = 1; looplndex <= n - 1; looplndex++) total = x x total + Y[looplndex]; return total; Let Z be an array of 10 elements with Z[i] = 1, for all i such that 0 sis 9. The value returned by SimpleFunction (Z, 10, 2) is (100 01
data structures in java
rewite usung for loop
struct insert_at_back_of_sll { // Function takes a constant Book as a parameter, inserts that book at the // back of a singly linked list, and returns nothing. void operator()(const Book& book) { /// TO-DO (3) /// // Write the lines of code to insert "book" at the back of "my_sll". Since // the SLL has no size() function and no tail pointer, you must walk the // list looking for the last node. // // HINT: Do not attempt to insert after "my_sll.end()". // ///// END-T0-DO (3) ||||// } std::forward_list& my_sll; };
Complete the following function definition to recursively print the index of a unique value in an array or -1 if the value is not found:1 int getIndex(int *a, int s, int v) {2 if( ) { // if no values are found3 4 }5 if(a[s-1] == v) { // if a value is found6 7 }8 return getIndex( ); // recurse to check next value9 }Hint:Recurse through the array by counting down from size. 1. Complete the one line of code for line 2:2. Write one line of code for line 3:3. Write one line of code for line 6:4. Complete the one line of code for line 8: please send an atom code. not other software
Unordered Sets |As explained in this chapter, a set is a collection of distinct elements of the same type. Design the class unorderedSetType, derived from the class unorderedArrayListType, to manipulate sets. Note that you need to redefine only the functions insertAt, insertEnd, and replaceAt. If the item to be inserted is already in the list, the functions insertAt and insertEnd output an appropriate message, such as 13 is already in the set. Similarly, if the item to be replaced is already in the list, the function replaceAt outputs an appropriate message. Also, write a program to test your class.

SEE MORE QUESTIONS

Recommended textbooks for you

C++ Programming: From Problem Analysis to Program…

C++ Programming: From Problem Analysis to Program…

Computer Science

ISBN:

9781337102087

Author:

D. S. Malik

Publisher:

Cengage Learning

C++ Programming: From Problem Analysis to Program…

C++ Programming: From Problem Analysis to Program…

Computer Science

ISBN:

9781337102087

Author:

D. S. Malik

Publisher:

Cengage Learning

SEE MORE TEXTBOOKS