Water Jug Problem using DFS

by admin | Apr 7, 2010 | Algorithms, Computer Science, Programming

DFS Algorithm: Depth first search is another way of traversing graphs, which is closely related to preorder traversal of a tree. Recall that preorder traversal simply visits each node before its children. It is most easy to program as a recursive routine:...

The following is based on my interpretation. Yours might be different to mine.

The goal here is for you to realize that, depending on the situation, we may want to take readings more frequently. Today, we’re actually learning about how images are represented in computers, but let’s keep in mind these ideas about how often to take a reading or measurement.

ASCII Reference Table

Unit 6 Answer 1

Each item in the list represents a non-denominational holiday

01 01 – New Years Eve
26 01 – Republic Day
15 08 – Independence Day
02 10 – Gandhi Jayanti

Unit 6 Tip 1

The format of the list is two numbers

02 10

This list happens throughout the year and repeats every year

Unit 5 Task 5

32 + 16 + 8 + 4 + 2 + 1 + 0.50 + 0.25 = 63.75

With all of the bits flipped to 1, the largest number you can make is 63.75. Note that this is smaller than the largest you can make with a traditional Flippy Do, which is 255. This is because we have shifted two bits to represent smaller numbers (0.5 & 0.25)

Unit 5 Task 4

The only change values you can make with this Flippy Do Pro are 0.25, 0.50, and 0.75.

Can you make the binary number for 0.39 (decimal)? No!

Roundoff error occurs when an exact value cannot be made with available place values

Unit5 Task 3

Unit 5 Task 2

The next value, in binary: 000000.10
decimal (Base 10) equivalent = 0.50

Unit 5 - Task 1

BINARY VALUE = 000000.01

DECIMAL VALUE = 0.25