CSC1200:  LAB 10
Exercises in Concentration Areas
Description
In this lab we will do a basic exercise in each of three sub-fields of computer 
science we covered in class: cybersecurity, high performance computing, and artificial 
intelligence.
section ONE:  cryptography
One of the major areas in cybersecurity is cryptography, which makes data harder to 
access for people who don’t have access to interpret that data. This exercise uses 
one of the most basic methods of encrypting and decrypting data. A Caesar cypher will 
map every letter in the alphabet to another letter based on a number offset, so an 
offset of 1 maps A to B, B to C, C to D, and so on. This offset is referred to as a 
key. If we encode the word “cat” with a key of 1, it’s encoded as “DBU”, which we can 
decode by shifting each letter back one position. First, decode this message Gjb svfu 
ner va n gnax. Bar fnlf, ‘Ubj qb lbh qevir guvf guvat?’ using a key of 13. Then, 
encode your own secret message using a key of your choice (make sure to list the key).
section two:  parallel processing
The main focus of high performance computing is parallel processing, performing multiple 
operations at the same time. This exercise breaks up operations for a basic algorithm 
to be performed concurrently to produce a result. If we add up all the numbers from 1 
to ten we typically need to do one operation after another like so: 

how would you represent the same process (adding the numbers one through ten) with two 
operations being performed at the same time?
section three:  pathfinding
Many applications in AI are based on graph theory from mathematics. A graph has a set 
of nodes and connections between those nodes. Some graphs have a cost to moving across 
a connection, such as this one. That means moving from one node to another has a cost, 
for example moving from node E to node D has a cost of 2 and moving from node C to node 
F has a cost of 11 (through node E, which has a cost of 6, plus E to F, which has a cost 
of 5). In the pictured graph, what is the smallest cost that it takes to start from node 
A and move to any other node (list every node and the value associated). How did you 
determine the shortest value to reach each node?
What to Turn In
Either edit this document inserting your answers to these exercises or write your answers 
onto a piece of paper and take a picture (or some other format if you feel so inclined), 
and upload that document to ilearn.
                                            
                                        
                                    

                                        
Create a calendar app in android studio (in java code) that can see each month and record notes
when selecting a day
Calendar app should be able to take notes when selecting on a day
Tutorial for Help if needed: https://www.youtube.com/watch?v=IdTRhFkC1Po