CS222 Embry Riddle Aeronautical University Problems In Computer Science Paper the instructions provided inside the assignment ………………………..
CS222 Embry Riddle Aeronautical University Problems In Computer Science Paper the instructions provided inside the assignment …………………………….. CS 222 Extra Credit: People in Computer Science (5 pts)
Due by 5:00 pm, Last Day of Class
Prepare a one page report on one of the following people. You may do at most one report on
exactly one person. Include references as appropriate, but do not use web references. Save the file
as CS222 EC01 Lastname Firstname. Grading is based on content, referencing, and format.
1. Frances E. Allen
2. John W. Backus
3. Alonzo Church
4. Stephen A. Cook
5. Edsger W. Dijkstra
6. Paul Erdös
7. Kurt Godel
8. Richard Wesley Hamming
9. David Hilbert
10. C. A. R. Hoare
11. John E. Hopcroft
12. Donald Knuth
13. Leonardo of Pisa (Fibonacci)
14. Ada Lovelace
15. Marvin Minsky
16. Peter Naur
17. Allen Newell
18. John von Neumann
19. Herbert A. Simon
20. Dennis Ritchie
21. Robert Tarjan
22. Any Turing Award Winner not listed above ( ref: http://www.informatik.uni-trier.de/ ley/db/journals/cac
)
1
Your report must include the following sections:
Name
Dates of Birth and Death
Education: Degree type, year, and university.
Key Positions Held: Summary of important employment posts held throughout lifetime.
Key Contributions: Short summary of contributions made to Computer Science, Computer Engineering, or Software Engineering.
2
CS 222 Extra Credit: Important Problems in Comp. Sci. (5 pts)
Due by 5:00 pm, Last Day of Class
Prepare a one page report on one of the following problems. You may do at most one report
on exactly one problem. Your report must include the sections listed below. Include references
as appropriate, but do not use web references. Save the file as CS222 EC02 Lastname Firstname.
Grading is based on content, referencing, and format.
Your report must contain the following sections:
1. Problem Name
2. Hardness of the Problem: Is it P, NP, NP-Complete, or Hard?
3. Complexity of the Problem: Report on the computational complexity of the problem using
Big O notation. Is this an exact result or the best known estimate?
4. Complexity of Best Known Algorithms: Same as the previous section, but focusing on algorithms used to solve the problem, not the problem itself.
5. Importance of the Problem: Why is the problem studied and where is it used?
List of Problems:
1. The Byzantine Generals Problem (also called the Two Generals Problem)
2. The Convex Hull Problem
3. Depth First Search
4. The Eight Queens Problem
5. Heap Sort
6. The Graph Coloring Problem
7. Knapsack Problem
8. Maximal Clique Problem
9. Minimum Cut Problem
10. Minimum Spanning Tree
11. The Nearest Neighbor Problem (also called Nearest Neighbor Query)
12. SAT (also called Satisfiability)
13. Set Covering Problem
14. The Towers of Hanoi Problem
1
CS 222 Extra Credit: Google of the Day (GOTD) (5 pts)
Due by 5:00 pm, Last Day of Class
For each Google of the Day term, provide a “one liner” definition of the term, and provide one
web URL that provides information on the topic. Save the file as CS222 EC03 Lastname Firstname.
1. Formal Systems
2. Combinatorial Proof
3. Binomial Theorem
4. Randomness
5. Game Theory
6. Boolean Logic
7. Vacuous Truth
8. Cooks Satisfiability Problem
9. Theorem Proving Software
10. Proof by Cases
11. Proof by Exhaustion
12. Begging the Question Fallacy
13. Contrapositive Proof
14. Diagonalization Proof
15. Computational Complexity
16. NP-Complete
17. Russells Paradox
18. Ramsey Numbers
19. Recursively Enumerable Sets
20. Tuples
21. Set Partition
22. Multi-Variable Functions
23. Chomsky Hierarchy
24. Backus-Naur Form (BNF)
25. Right Linear Grammar
26. Strong Induction
1
Purchase answer to see full
attachment
