Pinned Repositories
AppleStopWebApp
This is a simple web application to demonstrate HTML5 and CSS3
AStarAlgorithm
A* Algorithm
Automotive-Calculator
Joe’s Automotive performs the following routine maintenance services: • Oil change - $26 • Lube job - $18 • Radiator flush - $30 • Transmission flush - $80 • Inspection - $15 • Muffler replacement - $100 • Tire rotation - $20 Joe also performs other nonroutine services and charges for parts and labor ($20 per hour). Create an application that displays the total for a customer’s visit to Joe’s.
BattleShip
Counting battleship
Calendar
Calender implementation using SortedList in C#
company_php
A simple php web application with CRUD
CourseSchedule
Implementation of Topological sorting algorithm
FireTruck
The Center City fire department collaborates with the transportation department to maintain maps of the city which reflects the current status of the city streets. On any given day, several streets are closed for repairs or construction. Firefighters need to be able to select routes from the firestations to fires that do not use closed streets. Central City is divided into non-overlapping fire districts, each containing a single firestation. When a fire is reported, a central dispatcher alerts the firestation of the district where the fire is located and gives a list of possible routes from the firestation to the fire. You must write a program that the central dispatcher can use to generate routes from the district firestations to the fires. Input and Output The city has a separate map for each fire district. Streetcorners of each map are identified by positive integers less than 21, with the firestation always on corner #1. The input file contains several test cases representing different fires in different districts. The first line of a test case consists of a single integer which is the number of the streetcorner closest to the fire. The next several lines consist of pairs of positive integers separated by blanks which are the adjacent streetcorners of open streets. (For example, if the pair 4 7 is on a line in the file, then the street between streetcorners 4 and 7 is open. There are no other streetcorners between 4 and 7 on that section of the street.) The final line of each test case consists of a pair of 0's. For each test case, your output must identify the case by number (case #1, case #2, etc). It must list each route on a separate line, with the streetcorners written in the order in which they appear on the route. And it must give the total number routes from firestation to the fire. Include only routes which do not pass through any streetcorner more than once. (For obvious reasons, the fire department doesn't want its trucks driving around in circles.) Output from separate cases must appear on separate lines. The following sample input and corresponding correct output represents two test cases.
WorkshopSelector
A basic WPF application with MVVM model
PamyAnnPatrick's Repositories
PamyAnnPatrick/WorkshopSelector
A basic WPF application with MVVM model
PamyAnnPatrick/AppleStopWebApp
This is a simple web application to demonstrate HTML5 and CSS3
PamyAnnPatrick/FireTruck
The Center City fire department collaborates with the transportation department to maintain maps of the city which reflects the current status of the city streets. On any given day, several streets are closed for repairs or construction. Firefighters need to be able to select routes from the firestations to fires that do not use closed streets. Central City is divided into non-overlapping fire districts, each containing a single firestation. When a fire is reported, a central dispatcher alerts the firestation of the district where the fire is located and gives a list of possible routes from the firestation to the fire. You must write a program that the central dispatcher can use to generate routes from the district firestations to the fires. Input and Output The city has a separate map for each fire district. Streetcorners of each map are identified by positive integers less than 21, with the firestation always on corner #1. The input file contains several test cases representing different fires in different districts. The first line of a test case consists of a single integer which is the number of the streetcorner closest to the fire. The next several lines consist of pairs of positive integers separated by blanks which are the adjacent streetcorners of open streets. (For example, if the pair 4 7 is on a line in the file, then the street between streetcorners 4 and 7 is open. There are no other streetcorners between 4 and 7 on that section of the street.) The final line of each test case consists of a pair of 0's. For each test case, your output must identify the case by number (case #1, case #2, etc). It must list each route on a separate line, with the streetcorners written in the order in which they appear on the route. And it must give the total number routes from firestation to the fire. Include only routes which do not pass through any streetcorner more than once. (For obvious reasons, the fire department doesn't want its trucks driving around in circles.) Output from separate cases must appear on separate lines. The following sample input and corresponding correct output represents two test cases.
PamyAnnPatrick/AStarAlgorithm
A* Algorithm
PamyAnnPatrick/Automotive-Calculator
Joe’s Automotive performs the following routine maintenance services: • Oil change - $26 • Lube job - $18 • Radiator flush - $30 • Transmission flush - $80 • Inspection - $15 • Muffler replacement - $100 • Tire rotation - $20 Joe also performs other nonroutine services and charges for parts and labor ($20 per hour). Create an application that displays the total for a customer’s visit to Joe’s.
PamyAnnPatrick/BattleShip
Counting battleship
PamyAnnPatrick/Calendar
Calender implementation using SortedList in C#
PamyAnnPatrick/company_php
A simple php web application with CRUD
PamyAnnPatrick/CourseSchedule
Implementation of Topological sorting algorithm
PamyAnnPatrick/ExamResultCalculator
This is a desktop application (WPF) that read candidate's answers from file and compare it with the correct result in the list and display result in list and summary in chart
PamyAnnPatrick/LongLine
Longest Line of Consecutive One in Matrix using dynamic programming
PamyAnnPatrick/MatchingSubSequences
Subsequence matching using Trie
PamyAnnPatrick/MatrixProblem
Solving Matrix problem using dynamic programming and BFS
PamyAnnPatrick/NetworkDelay
Dijkstra algorithm using priority queue
PamyAnnPatrick/Personal-Information
Create a class that holds the following personal data in properties: name, address, age, and phone number. Demonstrate the class in an application that creates three instances of the class. Once instance should hold your information, and the other two should hold your friends’ or family members’ information. Display each object’s properties on the application’s form.
PamyAnnPatrick/Population-Simulator
Create an application that predicts the approximate size of a population of organisms. The application should use textboxes to allow the user to enter the starting number of organisms, the average daily population increase (as a percentage), and the number of days the organisms will be left to multiply. If the user clicks the Save button, save the current prediction to a file.
PamyAnnPatrick/TransformArray
Sort Transformed Array