Data Structure and Algorithms

Question 1 Implement an array-based abstract data type 'stack' specified in class and do the following: Write a procedure called read_and_evaluate_expression that reads in and evaluates a postfix expression (defined below) and writes out its value. (JAVA) Your procedure must follow the algorithm sketched below, and it must use your implementation of abstract `stacks'. But the procedure should not depend on the details of your particular implementation -the procedure should depend only on the specification of abstract `stacks' and therefore should work with any implementation of the specification (The TAs might check this by using their own stack implementation instead of yours). The m... click for more

Java data structures and alg.

1. QUESTION 1a Write a recursive "Merge" method meeting this specification: Inputs: a sorted list L1 and a sorted list L2. Outputs: a sorted list that is the merging of L1 and L2, and, the number of times two list elements were compared during the merging process (call it C). The recursive Merge method returns the merging of L1 and L2 as its result. Thus, after executing L1 = Merge(L1,L2,Nc,Njs), L1 contains the result of the merge and the 'other' list has been destroyed. In other words, at this point, (1) either L2 has been destroyed, or (2) the old L1 has been destroyed and now L1==L2. (Note: Nc is the total number of times two list elements were... click for more

Matrix Identity in C++

Write a function in c++ Isidentity (t) t is two dimensional array. (int t[rwos] [columns] return true, if it is an identity matrix, return false if it is not like example square tolls colum all 1's on principal diagonal, otherwise 0's 1 0 0 0 1 0 0 0 1 Note: This is a c++ question. This is not a math questions.

Divide a group of people into two disjoint subgroups (of arbitrary size) such that the difference in the total ages of the members of the two subgroups is as large as possible.

Reword the question below so it's less ambiguous so I can understand the question and answer it on my own. maybe give example diagram/inputs/outputs (primitives if possible) but don't show any algorithms in the answer. I know big theta notation/sorting algorithms etc.. This question has been answered at brainmass but I don't want the answer just the question being less ambiguous to me. Question: Sometimes a slight change in a problem can significantly alter the form of its solution. For example, find a simple algorithm for solving the following problem and classify it using big-theta notation: Divide a group of people into two disjoint subgroups (of arbitrary size) such that the d... click for more

Arrays in java

Write the definition of a method, isReverse , whose two parameters are arrays of integers of equal size. The method returns true if and only if one array is the reverse of the other. ("Reverse" here means same elements but in reverse order.) So, suppose you had two int arrays, forward and backward, each with 4 elements. Now suppose that forward had these elements: 1, 2, 3, 4 and that backward had these: values 4, 3, 2, 1. Then if your isReverse method were invoked, passing it forward and backward, it would return true. Please explain in detail to aid learning process