theory

public class A { public void f1(String str) { System.out.println("A.f1(String)"); this.f1(1, str); } public void f1(int i, String str) { System.out.println("A.f1(int, String)"); } } public class B extends A { @Override public void f1(String str) { System.out.println("B.f1(String)"); super.f1(str); } @Override public void f1(int i, String str) { System.out.println("B.f1(int, String)"); super.f1(i, str); } } public class Main { public static void main(String[] args) { B b = new B(); b.f1("Hello"); } } I'm seeking that this code would output: B.f1(String) A.f1(String) A.f1(int, String) Yet I'm

Is it impossible to know if two functions are equivalent? For example, a compiler writer wants to determine if two functions that the developer has written perform the same operation, what methods can he use to figure that one out? Or can what can we do to find out that two TMs are identical? Is there a way to normalize the machines? Edit: If the general case is undecidable, how much information do you need to have before you can correctly say that two functions are equivalent? Given an arbitrary function, f , we define a function f' which returns 1 on input n if f halts on input n . Now, for

Summer Project - 2019 Graph Theory: Representation and Algorithms 1 Introduction In order to complete this project successfully, the student should be familiar with many basic notions of graph theory. The questions below whose answers should be included in the project report will force the student to go over these necessary background notions about graphs. Most of the background can be studied in the following references, specially Cormen textbook where graph definitions can be found in Appendix B.4 and the Graph Algorithms can be read in chapters 22 to 26. 1. Introduction to Algorithms, T.H.