Behnam Azizi-C++ programs and projects

Student Information System
Word Frequencies
Secret Decoder
Matrix Operations

These are some of the programs that I developed in assignments and projects using C++:

Student Infromation System

We did parts of this program as an assignment in the course CMPT 128. Later I developed the program further and added more features to it. This is a program that stores information of the students in a class and enables user to manipulate the data regarding each student. The program has the following features:

Each student in class has these attributes:

Last name
First name
Student number
Grade for midterm #1
Grade for midterm #1
Grade for final

Prints the list of all students in the class on screen
Prints the list of students in alphabetical order of their last names using MergeSort
Enables the user to add more students to the list
Calculate the letter grades of all students based on the following rule:

A: For an average higher than 90%
B: For an average between 80%-90%
C: For an average between 70%-80%
D: For an average between 60%-70%
F: For an average below 60%

User can set the percentage that each of the midterm and final grades contribute to the average grade of students

User can search for a student (using Binary Search) and change student's information or remove the student (or all students) from the system

The information of the students is stored on the hard-drive so even after closing the program/turning off the computer the data will not be lost.
Download mySIS (could be run in Linux Terminal if G++ installed)

Word Frequencies (Assignment on Hash Tables)

This program read the contents of a text file and prints out the number of times each word in the file is repeated. The way this works is that each time a new word is found it stores it in a Hash Table, and if the word was previously added it increments the key value of that word by one. We did the hashing part of this program in an assignment. The driver program was provided by Prof. Greg Mori. It uses double hashing to probe words that have the same hash value. The default hash function is the following:
i₀*(32^n-1) + i₁*(32^n-2) + .... + i_n-1*32¹ + i_n

Where i the order of the word in the alphabet (a number from 1 to 26)
n is the length of the word.

For example for the word "CAR" we get the following hash value:
3*(32²) + 1*(32¹) + 18 = 3122 Download word_frequencies (could be run in Linux Terminal if G++ installed)

Secret Decoder (Self-Directed)

I developed this program during my pastime. This simple and interesting program converts the contents of a text file into a secret coded message which can be converted back into readable text again! It reads a text file character by character and converts them into weird (but predefined) characters. Here is a screenshot of how the text message looks like before and after conversion:
Here is how a text is converted into a secret code:

And finally, the message written in secret language can be converted back into readable text!
Download Decoder (could be run in Linux Terminal if G++ installed)

Matrix Operations

This is the most recent program that I developed using C++. Program runs based on the following procedure:

User enters the number of rows and columns of the m*n matrix
Users enters the item in row i and columns j of the m*n matrix for ∀i and j, where 0 ≤ i ≤ m and 0 ≤ j ≤ n
The program prints the matrix on screen
The program prints the menu showing the operations that could be done on the matrix

that is capable of doing the following operations on ANY n*n matrix:

Transpose: The program finds the transpose of any m*n matrix. To do this the program creates a dynamically allocated matrix of size n*m and then for ∀i and j stores the item in row i, and column j of the old matrix in the row j, and column i of the new matrix
Multiplication: It multiplies the m*n matrix with another n*x matrix. If the number of columns of the first matrix are not equal to the number of rows of the second matrix then the program warns the user that multiplication cannot be done
Determinant This part of this project was the most interesting part that I ever worked on. This program finds the determinant of any n*n matrix (as long as your computer RAM allows) using a recursively defined function. Here was the basic idea behind the recursion:

det(A) = a_i1C_i1 + a_i2C_i2 + a_i3C_i3 + ... a_inC_in
Where C_ij is the determinant of the cofactor matrix created when removing row i and column j from the matrix, and a_i1 is the element in row i and column j of the matrix. Using the above formula the determinant of any n*n matrix can be defined in terms of the determinants of (n-1)*(n-1) matrices. And the base case for induction is when n=2 (a 2*2 matrix), where the determinant can be evaluated easily.
Download matrix (could be run in Linux Terminal if G++ installed)