Skip to main content

Posts

Showing posts with the label C Programming

Pocker Game in C Programming - 300698 Operating Systems Programming (Advanced) – 300943

1. Introduction Operating Systems have a need for extremely compact data structures, as often these need to be stored wholly in memory. Examples of this are free memory lists, page tables and disk space bitmaps. This  practical Case Study will refresh your knowledge of bit operations, necessary to manipulate such compact data structures. We will use a simple variant of the card game poker as the inspiration for our compact data structure. In this exercise, you will model a deck of playing cards as a bit 1eld. Only six bits arerequired to fully describe a card, two for the suit and four for the value. An extra bit as been added to the structure to encode the colour of the card. A second bit 1eld will be used to store the number of pairs contained in a hand. Read this section fully before attempting any of the exercises. These instructions contain some background information, the task to perform, sample code and some system documentation extract. 2. Structure of the bit 1elds ...

Rot-13 rotate 13 characters in the alphabet and wrap back around | Download Now

Rot13 Rot-13 - this rotate 13 characters in the alphabet and wrap back around. "abcdefghijklmnopqrstuvwxyz" "cat" "png" - encrypted using rot13 Implement the ability to read in the contents of a file, encrypt it using rot13, then write the encrypted version to a new file called encrypt.txt.  You should be able to test the accuracy, by copying the contents of encrypt.txt into your source file and running encrypt again and see you original message in encrypt.txt. Download Now Buy now

Highest GPA Calculator Using Stack and File Handling in C++

Highest GPA Calculator Introduction We want to write a C++ program that reads a data file consisting of each student’s GPA followed by the student’s name. The program then prints the highest GPA and the names of all of the students who received that GPA. The program scans the input file only once. Moreover, we assume that there is a maximum of 100 students in the class. Use a stack to write your code. Here is an example of the input/output operations. Input  The program reads an input file consisting of each student’s GPA, followed by the student’s name. Sample data is: 3.5 Bill 3.6 John 2.7 Lisa 3.9 Kathy 3.4 Jason 3.9 David 3.4 Jack Output  The highest GPA and all of the names associated with the highest GPA. For example, for the above data, the highest GPA is 3.9, and the students with that GPA are Kathy and David. CONTACT DETAILS For any other questions or other tasks please feel free to contact me via email: mhassnainjamil@gmail.com via WhatsApp: +92-324-7042178 via skype...

Head First C by David Griffiths & Dawn Griffiths [PDF] free download