From 38e7956b537f1cc676d9bca7c2bff7028ac92dca Mon Sep 17 00:00:00 2001 From: Platt Thompson Date: Fri, 4 Oct 2019 21:15:31 -0700 Subject: [PATCH] css styling --- programming_problems.html | 82 ++++++++------------ stylesheets/programming_problems.css | 109 +++++++++++++++++++++++++++ 2 files changed, 142 insertions(+), 49 deletions(-) create mode 100644 stylesheets/programming_problems.css diff --git a/programming_problems.html b/programming_problems.html index d4813f2..f44d286 100644 --- a/programming_problems.html +++ b/programming_problems.html @@ -2,60 +2,43 @@ + Simple Programming Problems - - +
-

Whenever I’m TA for a introductory CS class where students learn some programming language, I have trouble coming up with good exercises. Problems from Project Euler and the like are usually much too difficult for beginners, especially if they don’t have a strong background in mathematics.

+

Whenever I’m TA for a introductory CS class where students learn some programming language, I have trouble coming up with good exercises. Problems from Project Euler and the like are usually much too difficult for beginners, especially if they don’t have a strong background in mathematics.

This page is a collection of progressively more difficult exercises that are suitable for people who just started learning. It will be extended as I come up with new exercises. Except for the GUI questions, exercises are generally algorithmic and should be solvable without learning any libraries. The difficulty of the exercises of course somewhat depends on the programming language you use. The List exercises for example are more complicated in languages like C that don’t have build-in support for lists.

I suppose they are also useful, although much easier, whenever an experienced person wants to learn a new language.

-

This guide has been translated to Chinese by yifeitao Simple Programming Problems in Chinese

+

This guide has been translated to Chinese by yifeitao Simple Programming Problems in Chinese

Before you begin

Learning to program means learning how to solve problems using code. Conceptually it is not very difficult to write a program that solves a problem that you can solve yourself. The skill you need to acquire is thinking very precisely about how you solve the problem and breaking it down into steps that are so simple that a computer can execute them. I encourage you to first solve a few instances of a problem by hand and think about what you did to find the solution. For example if the task is sorting lists, sort some short lists yourself. A reasonable method would be to find the smallest element, write it down and cross it out of the original list and repeat this process until you have sorted the whole list. Then you have to teach the computer 1) how to find the smallest element, 2) how to write it down, 3) how to cross it out, and wrap this in a loop. Then continue this task breakdown process until you’re confident you know how to write the necessary program.

To make good progress in your programming task, you need to test your work as early and as thoroughly as possible. Everybody makes mistakes while programming and finding mistakes in programs consumes a very large part of a programmer’s work-day. Finding a problem in a small and easy piece of code is much simpler than trying to spot it in a large program. This is why you should try to test each sub task you identified during your task-breakdown by itself. Only after you’re confident that each part works as you expect you can attempt to plug them together. Make sure you test the complete program as well, errors can creep in in the way the different parts interact. You should try to automate your tests. The easier it is to test your program, the freer you are in experimenting with changes.

The last important point is how you express your thoughts as code. In the same way that you can express the same argument in different ways in a normal English essay, you can express the same problem-solving method in different ways in code. Try for brevity. The lines that you don’t write are the lines where you can be sure that the don’t have bugs. Don’t be afraid to Google for idiomatic ways of doing the things you’d like to do (after you tried doing them yourself!). Remember that you don’t write the program for the computer, you write it for other humans (maybe a future you!). Choose names that explain things, add comments where these names don’t suffice. Never comment on what the code is doing, only write comments that explain why.

This is a bad example:

-

-// This function checks whether a number is even
+
// This function checks whether a number is even
 def f(x):
-  // compute x modulo 2 and check whether it is zero
+  // compute x modulo 2 and check whether it is zero
   if modulo(x,2) == 0:
-    // the number is even
+    // the number is even
     return True
   else:
-    // the number is odd
-    return False
-

+    // the number is odd
+    return False

The exact same idea is much easier to understand if you write it like this:

-

-def is_divisible(number, divisor):
+
def is_divisible(number, divisor):
   return modulo(number, divisor) == 0
 
 def is_even(number):
-  return is_divisible(number, 2)
-

+  return is_divisible(number, 2)

Better naming and a better task breakdown make the comments obsolete. Revise your code just as you would revise an essay. Sketch, write, delete, reformulate, ask others what they think. Repeat until only the crispest possible expression of your idea remains. Revisit code you’ve written a while ago to see whether you can improve it with things you’ve learned since.

Elementary

    @@ -88,11 +71,11 @@

    Lists, Strings

  1. Write a function that rotates a list by k elements. For example [1,2,3,4,5,6] rotated by two becomes [3,4,5,6,1,2]. Try solving this without creating a copy of the list. How many swap or move operations do you need?
  2. Write a function that computes the list of the first 100 Fibonacci numbers. The first two Fibonacci numbers are 1 and 1. The n+1-st Fibonacci number can be computed by adding the n-th and the n-1-th Fibonacci number. The first few are therefore 1, 1, 1+1=2, 1+2=3, 2+3=5, 3+5=8.
  3. Write a function that takes a number and returns a list of its digits. So for 2342 it should return [2,3,4,2].
    4. -
  4. Write functions that add, subtract, and multiply two numbers in their digit-list representation (and return a new digit list). If you’re ambitious you can implement Karatsuba multiplication. Try different bases. What is the best base if you care about speed? If you couldn’t completely solve the prime number exercise above due to the lack of large numbers in your language, you can now use your own library for this task.
    5. +
  5. Write functions that add, subtract, and multiply two numbers in their digit-list representation (and return a new digit list). If you’re ambitious you can implement Karatsuba multiplication. Try different bases. What is the best base if you care about speed? If you couldn’t completely solve the prime number exercise above due to the lack of large numbers in your language, you can now use your own library for this task.
  6. Write a function that takes a list of numbers, a starting base b1 and a target base b2 and interprets the list as a number in base b1 and converts it into a number in base b2 (in the form of a list-of-digits). So for example [2,1,0] in base 3 gets converted to base 10 as [2,1].
  7. Implement the following sorting algorithms: Selection sort, Insertion sort, Merge sort, Quick sort, Stooge Sort. Check Wikipedia for descriptions.
  8. Implement binary search.
    9. -

  9. Write a function that takes a list of strings an prints them, one per line, in a rectangular frame. For example the list ["Hello", "World", "in", "a", "frame"] gets printed as:

    +
  10. Write a function that takes a list of strings an prints them, one per line, in a rectangular frame. For example the list ["Hello", "World", "in", "a", "frame"] gets printed as: 
    *********
 * Hello *
 * World *
@@ -100,7 +83,7 @@ 
    Lists, Strings
    
 * a     *
 * frame *
 *********
    11. -

  11. Write function that translates a text to Pig Latin and back. English is translated to Pig Latin by taking the first letter of every word, moving it to the end of the word and adding ‘ay’. “The quick brown fox” becomes “Hetay uickqay rownbay oxfay”.

    12. +
  12. Write function that translates a text to Pig Latin and back. English is translated to Pig Latin by taking the first letter of every word, moving it to the end of the word and adding ‘ay’. “The quick brown fox” becomes “Hetay uickqay rownbay oxfay”.

Intermediate

    @@ -129,42 +112,43 @@

    Advanced

  1. Given two strings, write a program that efficiently finds the longest common subsequence.
  2. Given an array with numbers, write a program that efficiently answers queries of the form: “Which is the nearest larger value for the number at position i?”, where distance is the difference in array indices. For example in the array [1,4,3,2,5,7], the nearest larger value for 4 is 5. After linear time preprocessing you should be able to answer queries in constant time.
  3. Given two strings, write a program that outputs the shortest sequence of character insertions and deletions that turn one string into the other.
    4. -
  4. Write a function that multiplies two matrices together. Make it as efficient as you can and compare the performance to a polished linear algebra library for your language. You might want to read about Strassen’s algorithm and the effects CPU caches have. Try out different matrix layouts and see what happens.
    5. -
  5. Implement a van Emde Boas tree. Compare it with your previous search tree implementations.
    6. +
  6. Write a function that multiplies two matrices together. Make it as efficient as you can and compare the performance to a polished linear algebra library for your language. You might want to read about Strassen’s algorithm and the effects CPU caches have. Try out different matrix layouts and see what happens.
    7. +
  7. Implement a van Emde Boas tree. Compare it with your previous search tree implementations.
  8. Given a set of d-dimensional rectangular boxes, write a program that computes the volume of their union. Start with 2D and work your way up.

GUI

Open Ended

    -
  1. Write a program that plays Hangman as good as possible. For example you can use a large dictionary like this and select the letter that excludes most words that are still possible solutions. Try to make the program as efficient as possible, i.e. don’t scan the whole dictionary in every turn.
    2. +
  2. Write a program that plays Hangman as good as possible. For example you can use a large dictionary like this and select the letter that excludes most words that are still possible solutions. Try to make the program as efficient as possible, i.e. don’t scan the whole dictionary in every turn.
  3. Write a program that plays Rock, Paper, Scissors better than random against a human. Try to exploit that humans are very bad at generating random numbers.
  4. Write a program that plays Battle Ship against human opponents. It takes coordinates as input and outputs whether that was a hit or not and its own shot’s coordinates.

Other Collections

Of course I’m not the first person to come up with the idea of having a list like this.

-
-

CC-BY-SA Adrian Neumann (PGP Key A0A8BC98)

-

adriann.github.io

-

RSS

+
- + \ No newline at end of file diff --git a/stylesheets/programming_problems.css b/stylesheets/programming_problems.css new file mode 100644 index 0000000..e5cde7b --- /dev/null +++ b/stylesheets/programming_problems.css @@ -0,0 +1,109 @@ +html, body { + margin: 0; + padding: 0; + font-family: sans-serif; + color: #333333; +} + +li { + padding: 0.25em; +} + +a { + color: #0A3CAE; + transition: 0.2s; +} + +a:hover { + color: #0A3CAE; + text-shadow: 0 0 5px; + transition: 0.2s; +} + +.flex { + margin: 0 21% 0 21%; + display: flex; + flex-direction: column; + justify-content: center; +} + +h1 { + text-align: center; +} + +h2 { + text-align: center; +} + +pre { + padding: 30px; + background-color: #171717; + color: lightgreen; + border-radius: 10px; +} + +pre > code > span { + color: #888888; +} + +hr { + width: 100%; +} + +footer { + font-size: 66%; + display: flex; + justify-content: space-around; + align-items: center; +} + +footer > p { + margin: 30px; +} + +/*MEDIA QUERIES*/ + +/*TABLETS*/ + +@media (max-width: 800px) and (min-width: 600px) { + + .flex { + margin: 10px; + } + + h1, h2 { + font-size: 3em; + } + + p, li { + font-size: 1.5em; + } + + li > ol > li { + font-size: 1em; + } + + li > ul > li { + font-size: 1em; + } + + pre > code { + font-size: 2em; + white-space: pre-wrap; + } + +} + +/*PHONES*/ + +@media (max-width: 599px) { + + .flex { + margin: 10px; + } + + pre > code { + white-space: pre-wrap; + } + +} \ No newline at end of file