Assume s1,s2 are two stacks and we write s1=s2 , if the class stack based on linked list then إختر أحد الخيارات: a. This statement is good when s2 has small number of items and s1 has large number of items b. This statement is good when s2 has small number of items and s1 has small number of items c. This statement is good when s2 has large number of items and s1 has small number of items d. This statement is good when s2 has large number of items and s1 has large number of items أخلِ اختياري

Assume s1,s2 are two stacks and we write s1=s2 , if the class stack based on linked list then إختر أحد الخيارات: a. This statement is good when s2 has small number of items and s1 has large number of items b. This statement is good when s2 has small number of items and s1 has small number of items c. This statement is good when s2 has large number of items and s1 has small number of items d. This statement is good when s2 has large number of items and s1 has large number of items أخلِ اختياري

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 9PE

See similar textbooks

Similar questions

Assume s1,s2 are two stacks and we write s1=s2 , if the class stack based on linked list then Select one: a. This statement is good when s2 has large number of items and s1 has small number of items b. This statement is good when s2 has small number of items and s1 has small number of items c. This statement is good when s2 has large number of items and s1 has large number of items d. This statement is good when s2 has small number of items and s1 has large number of items
You will create two programs. The first one will use the data structure Stack and the other program will use the data structure Queue. Keep in mind that you should already know from your video and free textbook that Java uses a LinkedList integration for Queue. Stack Program Create a deck of cards using an array (Array size 15). Each card is an object. So you will have to create a Card class that has a value (1 - 10, Jack, Queen, King, Ace) and suit (clubs, diamonds, heart, spade). You will create a stack and randomly pick a card from the deck to put be pushed onto the stack. You will repeat this 5 times. Then you will take cards off the top of the stack (pop) and reveal the values of the cards in the output. As a challenge, you may have the user guess the value and suit of the card at the bottom of the stack. Queue Program There is a new concert coming to town. This concert is popular and has a long line. The line uses the data structure Queue. The people in the line are objects…
Stacks are useful in situations where: sorting is required. elements must be processed immediately. we must deal with postponed obligations. items are processed in the order they are encountered.
Stack: Stacks are a type of container with LIFO (Last In First Out) type of working, where a new element is added at one end and (top) an element is removed from that end only. Your Stack should not be of the fixed sized. It should be able to grow itself. So using the class made in task 1, make a class named as Stack, having following additional functionalities: bool empty() : Returns whether the Stack is empty or not. Time Complexity should be: O(1) bool full() : Returns whether the Stack is full or not. Time Complexity should be: O(1)int size() : Returns the current size of the Stack. Time Complexity should be: O(1)Type top () : Returns the last element of the Stack. Time Complexity should be: O(1) void push(Type) : Adds the element of type Type at the top of the stack. Time Complexity should be: O(1) Type pop() : Deletes the top most element of the stack and returns it. Time Complexity should be: O(1) Write non-parameterized constructor for the above class. Write Copy…
Student should be able to develop the programs for queue using arrays and linked list By Using C++ software. Exercise 1: Implementation of Queue using Array or Linked list Consider a real life situation. Formulate a question and then design a simulation that can help to answer it. Choose one of the following situations: • Cars lined up at a car wash • Customers at a grocery store check-out • Airplanes taking off and landing on a runway • A bank teller Be sure to state any assumptions that you make and provide any probabilistic data that must be considered as part of the scenario.
In this assignment, you will create a Linked List data structure variant called a “Circular Linked List”. The Node structure is the same as discussed in the slides and defined as follows (we will use integers for data elements): public class Node { public int data; public Node next; } For the Circular Linked List, its class definition is as follows: public class CircularLinkedList { public int currentSize; public Node current; } In this Circular Linked List (CLL), each node has a reference to an existing next node. When Node elements are added to the CLL, the structure looks like a standard linked list with the last node’s next pointer always pointing to the first. In this way, there is no Node with a “next” pointer in the CLL that is ever pointing to null. For example, if a CLL has elements “5”, “3” and “4” and “current” is pointing to “3”, the CLL should look like: Key observations with this structure: The currentSize is 3 meaning there…
JAVA PROGRAMMING Assume you are trying to implement a stack, and have already implemented a singly- linked list with just a head reference. When implementing the stack using a linked list, you realize you don't need to write very much code at all, because you can just call the linked list methods you have already completed. Match the linked list method you would call in the implementation of each stack operation. 1. addFront 2. addBack isEmpty 3. removeFront push 4. removeBack top 5. getAtlndex 6. contains dod 7. size 8. toString
You are given the address of the two nodes of a linked list and you have to swap the values stored in the nodes. Complete the function definition given below. The structure of the node is also given. // class node{ // public: // int val; // node *next = NULL; // }; void swapNodes (node *n1, node *n2){ //write your code here }
3- Write a program that randomly generates 10 numbers (between 1 and 8), inserts into queue and then finds how many distinct elements exist in the queue. Example 1: Example 2: Queue: 2 40 3 3 2 18 4 18 18 3 Queue: 1 1 4 33 16 16 4 16 4 Output: 5 Output: 4 Notes: • You must use ONLY queue data structure. Don't use other different data structures like string or normal (pure) array or stack or array list. • Don't write any other method in the Qeueu class. All methods must be written in the main program.
Question 20 A list is a collection with additional index- and iteration- related operations. True False Question 21 O(N) is the order of growth execution time of the size operation when using the SortedArrayCollection class, assuming a collection size of N. True False Question 22 If N represents the number of elements in the list, then the index-based set method of the ABList class is O(1). True False Question 23 O(N) is the order of growth execution time of the remove operation when using the LinkedCollection class, assuming a collection size of N. True False Question 24 It is not possible to use an array to implement a linked list. True False Question 25 O(N) is the order of growth execution time of the remove operation when using the ArrayCollection class, assuming a collection size of N. True False Question 26 Our linked implementation of lists implements a bounded list. True False Question 27 O(N) is the order of growth execution time of the contains operation…
Write java code for a member function insertSorted(int d) for a linked list. The function traverses the list until it finds the correct location, then it inserts a node in that location. You may use the function given the class.
in c++ Write a function that takes a queue with 20 integer values and deletes the elements thatare between 15 and 20. In other words, only the elements less than 15 or greater than 20remain in the queue. This means that you need to have an auxiliary queue to store theelements between 15 and 20 and restore them back to the original queue.