Q2.1According to C++ recommended practice, in which section of the class should we find thedeclarations of int stack [MAX_SIZE]; and int size; ?PublicPrivateQ2.2When we put the method body (e.g. { return size == 0; } for isEmpty inside theclass declaration (i.e. in the IntStack.h file) that makes isEmpty a special type ofmember function (three word phrase with initials IMF). What does IMF stand for?Enter your answer hereQ2.3What is one thing that is different about IMF from the perspective of how they are treatedby the compiler?Enter your answer here Suppose we implement a class for a stack of integers, called IntStack. Our implementationuses a variable int stack [MAX_SIZE] and a variable int size. The constant MAX_SIZE maybe declared as const int MAX_SIZE=100, for example. I will have methods push, pop,isEmpty and since our implementation has a max size, isFull.If we declare a method with the function prototype bool isEmpty() const, I have the optionof putting the function body either in a separate IntStack.cpp file, or directly inside theIntStack.h file like this:// If this is in the header file, it should be declared// `inline`. Otherwise, we get multiple definitions!bool isEmpty() const { return size==0; }

“Since you have posted a question with multiple sub-parts, we will solve first three subparts for…

Q2.1 According to C++ recommended practice, in which section of the class should we find the declarations of int stack [MAX_SIZE]; and int size; ? O Public O Private Q2.2 When we put the method body (e.g. { return size == 0; } for isEmpty inside the class declaration (i.e. in the IntStack.h file) that makes isEmpty a special type of member function (three word phrase with initials IMF). What does IMF stand for? Enter your answer here Q2.3 What is one thing that is different about IMF from the perspective of how they are treated by the compiler? Enter your answer here

Q2.1 According to C++ recommended practice, in which section of the class should we find the declarations of int stack [MAX_SIZE]; and int size; ? O Public O Private Q2.2 When we put the method body (e.g. { return size == 0; } for isEmpty inside the class declaration (i.e. in the IntStack.h file) that makes isEmpty a special type of member function (three word phrase with initials IMF). What does IMF stand for? Enter your answer here Q2.3 What is one thing that is different about IMF from the perspective of how they are treated by the compiler? Enter your answer here

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 16PE: The implementation of a queue in an array, as given in this chapter, uses the variable count to...

See similar textbooks

Similar questions

The implementation of a queue in an array, as given in this chapter, uses the variable count to determine whether the queue is empty or full. You can also use the variable count to return the number of elements in the queue. On the other hand, class linkedQueueType does not use such a variable to keep track of the number of elements in the queue. Redefine the class linkedQueueType by adding the variable count to keep track of the number of elements in the queue. Modify the definitions of the functions addQueue and deleteQueue as necessary. Add the function queueCount to return the number of elements in the queue. Also, write a program to test various operations of the class you defined.
Please do this in JAVA PROGRAMMING. Given: List L of pairs of charactersString SOutput: TRUE if S is a valid string, FALSE otherwise. A string is considered valid if each character in the string can be paired with another character in the string, where the pair belongs to the input list L. Furthermore, two pairs cannot cross each other. In other words, a pair most completely enclose another, or be completely separate. Design and implement an efficient dynamic programming solution to this problem. Examples: Input L: (a b) (b c) (c d) (a a) Input S: aaba Output: True (pairs shown color-coded: aaba, "aa" fully encloses "ab") Input L: (a b) (b c) (c d) (a a) Input S: abcaad Output: True (pairs shown color-coded: abcaad, "ab" is separate from the other pairs) Input L: (a b) (b c) (c d) (a a) Input S: acbd Output: False (acbd is not valid because the pairs cross each other.) Input L: (a b) (b c) (c d) (a a) Input S: aaac Output: False
Q# In Java, if you see a class name followed by “<T>”, as in List<T>, what does this mean?Group of answer choices 1.It is what is called a lambda-function. 2.It’s for making collections of objects of many types at the same time. For example, if I make List<T> myList = new List<T> I can put a String as one item, an int as another, and a Random as a third item. 3.You must specify an object type in place of the T; eg. List<Shape> will make a list of Shape objects. 4. It means that the object is of type Time.
IN JAVA Suppose that in the array-based stack, the array doubles in size after multiple push operations. But later on, fewer than half of the array’s locations might actually be used by the stack due to pop operations. Revise the implementation so that its array also can shrink in size as objects are removed from the stack. Accomplishing this task will require two new private methods, as follows: The first new method checks whether we should reduce the size of the array: private boolean isTooBig() This method returns true if the number of entries in the stack is less than half the size of the array and the size of the array is greater than 20. The second new method creates a new array that is three quarters the size of the current array and then copies the objects in the bag to the new array: private void reduceArray() Implement each of these two methods, and then use them in the definition of pop()
Write a method called samePosition in a class called StackExt that receives two parameters stl and st2 of type ArrayStack and a third parameter pos of type int. The method returns true, if stack stl and st2 contains the same value in position pos. Otherwise, the method returns false. Assume that both stacks stl and st2 contain same number of elements. Assume that the position of the top element is O and increases by 1 for each subsequent element. The elements of both stacks stl and st2 must remain in the original relative positions in the stacks at the end of the method. Use common stack operations only such as push, pop, peek, isEmpty, constructor and copy constructor. You can create temporary objects of type ArrayStack in your method. Example: top 4 5 3 10 8 stl: stl: 5 9 4 10 1 If the pos is 3, then both stacks contain 10 in position 3. The method returns true. If the pos is 1, then st1 Contains 5 and st2 contains 9 in position 1. The method returns false. public class StackExt {…
The String class implements Comparable, which means that two strings can be compared to each other. However, the default implementation orders strings based on the ASCII values of their characters, which means that strings that begin with an uppercase letter are always ordered before strings that begin with a lowercase letter. This means that the string “Zoo” would be ordered before the string “aardvark”. Write a Comparator that compares two strings alphabetically so that “aardvark” is ordered before “Zoo”. Hint: convert both strings to upper or lowercase before comparing them.
Write a method called samePosition in a class called stackExt that receives two parameters st1 and st2 of type Arraystack and a third parameter pos of type int. The method returns true, if stack stl and st2 contains the same value in position pos. Otherwise, the method returns false. Assume that both stacks stl and st2 contain same number of elements. Assume that the position of the top element is 0 and increases by 1 for each subsequent element. The elements of both stacks stl and st2 must remain in the original relative positions in the stacks at the end of the method. Use common stack operations only such as push, pop, peek, isEmpty, constructor and copy constructor. You can create temporary objects of type Arraystack in your method. Example: top stl: 4 5 3 10 8 stl: 5 9 4 10 1 If the pos is 3, then both stacks contain 10 in position 3. The method returns true. If the pos is 1, then st1 contains 5 and st2 contains 9 in position 1. The method returns false. public class StackExt {…
Java. Implement a method that will return a String with an array's elements separated by spaces. The mehod will recieve three parameters: the integer array, a start index, and an end index. Both start and end are includive. The method's signature is as follows: public static String printRange(int [], int, int) - make the method public to faciliate testing - If the indexes are outside the bounds of the array, the method should return "Invalid Range." Otherwise, the method will return a String containing one integer after the other on the same line separated by one space. Example 1: Given {4,1,2,36,6}, 1, 3 as the parameters; the method should return "1 2 36" Example 2: Given {4,1,2,36,6}, 0, 7 as the parameters; the method should return "Invalid Range"
Given an JavaScript object list of books that each have a pages attribute to define the number of pages in the book, find the sum of all the pages in the object list of books using recursion. Keep in mind: The input list object may be completely empty (ex. {}) The next attribute may not be defined function getPageCount(list) {// your code here// returns an integer}Example test case:Input: {"book":"A","pages":1,"next":{"book":"B","pages":2,"next":{"book":"C","pages":3,"next": null}}}Output: 6Reasoning: 1 + 2 + 3 pages
Implement a simple stack in java using the scenario below. A company wishes to keep track of the order in which it employed staff. Users can enter either "f" to fire, "h" to hire or "e" to end the program. When a member of staff is employed, their employee number is added to the top of a stack when someone has to be made redundant, the last person to join the company is removed from the top of the stack. Hint: Use ArrayList
Implement the Solver class. The point of the solver class is the solve method which takes a board/puzzle configuration represented as a 2D array of bytes and returns a byte array containing a minimal sequence of moves that will lead to the solved board. The 2D array of bytes is “triangular” and represents a valid board configuration. Namely, the 2D array has 5 rows (0 – 4) and the size of every row is 1 more than its index. (e.g. Row 0 has length 1). The array contains one 0, five 1s, four 2s and five 3s. The solve method then returns an array of bytes representing a minimal sequence of moves that solves the puzzle. In other words, if the numbers from the returned array are used in order as inputs to the move method on the Board object representing the initial configuration, the resulting board configuration represents the solved board. Furthermore, the solution must be minimal in the sense that there are no solutions that use fewer moves (although there could be other solutions that…
in Java Implement a method public static double[] add(double[] a, double[] b) for the component-wise sum of vectors: given vectors (a1, a2, . . . , an) and (b1, b2, . . . , bn) of the same length, the sum is the vector (a1 + b1, a2 + b2, . . . , an + bn). For example, the result of applying add to (0, 3, −1) and (2, −5, 1) should be (0 + 2, 3 + (−5), −1 + 1) = (2, −2, 0). Important: add should NOT change the given arrays and should return a new array instead.