norhanabbas Goto Github PK

14ers-git

This is a demo repo to use for the 14ers activity

basemaps

Scripts to generate MapServer mapfiles based on OpenStreetMap data. Please submit pull requests to the 'main' branch.

cs445-rec1

CS 445: Recitation 1 exercises

cs445-rec10

cs445-rec11

A repository for recitation 11 of CS 445 during the Summer 2021 term. This recitation focuses on using the Dictionary ADT.

cs445-rec2

CS 445: Recitation 2 exercises

cs445-rec3

cs445-rec4

cs445-rec5

cs445-rec7

Repository for recitation 7 (backtracking) for CS 445 during the Summer of 2021.

cs445-rec8

cs445-rec9

GitHub repository for CS445 Recitation 9 on the List ADT.

csci-232-assignment03

You just have to run: Part_1, Part_2, & Part_3

csci-232-data-structures-and-algorithms-

assignments

csci-232-pgm1

Create a Binary Search Tree

csci-305

A group of programming assignments for CSCI 305: Concepts/Programming Languages, a class taught at Montana State University. It includes an examination of several programming languages, as well as their application and underlying execution model, such as C, C++, Java, Go, Lisp, and Prolog.

csci_366_examples

Code examples for lecture demonstrations

csci_366_github_homework

csci_366_programming_assignments

Programming assignments for MSU CSCI 366

dotfiles

dotfiles for vim, git, zsh, cwm, xinit, and many others. Install with: lndir -silent /path/to/dotfiles $HOME

esof-322

ESOF 322 is a class taught at Montana State University. It includes software lifecycles, Unified Modeling Language, design patterns, software engineering standards, requirements analysis, development issues, efficiency tools, verification and validation, configuration management, testing and maintenance.

github-starter-course

githubtraining

Repository for a training November 20, 2019

greedy-making-change

Objective: getting the minimum number of coins of a GIVEN denomination that adds up to a GIVEN amount of money, using greedy algorithm and JUnit tests

hash-table-implementation-

Overview: this program implements hash table as it allows the following: 1- Insertion by Linear probing 2- Insertion by Quadratic probing 3- delete an integer and returning the array without that integer 4- Search for an integer and get to know if it exists (True) Or it is not there (False) **All the above take place by the user choice. Also, the loading factor of our table is always taken into consideration WHILE INSERTING ANY INTEGER ** NB. In this program, any Zero is considered to be a NULL element * Accordingly, the user should insert any integer OTHER THAN ZERO

hash-table-implementation-2

huffman-tree

This program is a Huffman Tree Implementation: 1- It takes the input from a file 2- Construct a frequency table for the different characters the input is composed of 3- Based on the frequency table, it creates a Huffman tree and a bitmap 4- Using the Bitmap, it encodes the input 5- Then, decode it again... Which means your input and output file have to be exactly the same ; otherwise, there is something wrong going on

karakara

Karaoke Event System - Attendees can view and queue tracks from their mobile phones

kruskal-s-algorithm-implementation-

mechanize

Stateful programmatic web browsing in Python, after Andy Lester's Perl module WWW::Mechanize .