usamashafiq

-hello-message-with-it-

Take user name as an input and print ‘hello’ message with it First declare two arrays one contain the word hello and the second array is un initialized. Initialize the array in main proc then input data of uninitialized array Then print this array by word hello store in var by output statement show the name store in var1

-MANAGEMENT-SYSTEM

MARKET PLACE MANAGEMENT SYSTEM USING LINKED LIST IN C++

1.Print-two-different-strings-statically

First declare two variables then store two strings. Initialize the strings in the main proc then mov the strings in data registers and show them on the screen.

2D_array

You are given following 2D array which has fee of students row wise. The first element in a row represent student roll no and second element represents fee paid in first semester, third element represents fee in second semester and so on. Process the array and store the total fee paid by each student. Declare this array statically and process using nested loop. 401 21000 42000 0 0 0 0 0 0 ? 402 0 59000 0 0 0 0 0 0 ? 403 12000 19000 21000 0 0 0 0 0 ? 404 56000 0 0 0 0 0 0 0 ? Then display the data as follows 2015-CS-401 paid fee Rs. 63000/- 2015-CS-402 paid fee Rs. xxxx/-

Adding-numbers

Take input from user add a number in it and display it on screen Input a number from the user and add constant number in it. Then move the added numbers in the data register and display it on the the screen. Exit the code by execution statement

Cellular-companies-save-Call-details-records-CDR-for-each-call

Cellular companies save Call details records (CDR) for each call. Some of the data of calls made in 2018 year in Gukkhar are given file “cdr.txt”. The file has caller no, callee number, date of call, duration of call. This file has 10lacks records. File has data in the following format. Callerno calleeno day month year hours minutes second o *Write a structure CDR to hold a single record o *Write a function print that accepts a CDR and print it on screen in a row o *Write a function show_all the accept nothing open “cdr.txt” in read mode and read record one by one and use the above print function to print all the records on scree o *Write main function and call show_all method to check o Write a function readf that accept an array of CDR of size N. Read first N records from the file into that array. o Modify the main function and declare and array of size 10 of CDR, call the readf function and pass this array o Write a function writef that accepts an array of CDR of size N and write the array contents to the file “f10.txt” omitting the call status field. o Modify the main and call writef on the array in which data is already been stored. Open the “f10.txt” file to confirm o *Write a function printHTML that accept a callerno, write all calling record of that caller to a new file named “caller.txt”. Test this function to filter calls made by “03090061389". o Write a function countCalls that accepts a callerno and return how many calles are made by this caller no. Test this function to count calls by “03090061389" you must have 6758 call records. o *Write a function Delete that accept an int (record no) and delete that record from the original file. Modify the main function to delete 3rd record. Before and after call show_all function to confirm 2. Write a program that read MCQ questions from the file and ask these question form user, get the answer and calculate the score. Use functional approach with array of structure instance to accomplish the task. Write the wrong answered questions to a new HTML file that can be opened in browser. MCQ questions are given in file “qbank.txt”. Open the file task2.cpp follow the below sequence. Analyze the file structure such that you can store data from file to the structure given below struct Mcq{ char question[300]; char answer[150]; char opt1[150]; char opt2[150]; char opt3[150]; char opt4[150]; } ; o Write main program that declare and array of 10 size of above structure. o Write a function readN that accepts array of Mcq and its size. Open the file for reading and read first size questions from file and put in array o Modify the main to call the readN and pass the created array o Write a function askQuestion that accept an instance of above structure and show question on the screen and ask the answer from user. Compare the answer of user and return true if user answered it correctly otherwise return false. Question: What is Capital of Pakistan? a) Karachi b) Quetta c) Lahore d) Islamabad o Modify the main to loop over the array and pass each element to askQuestion to count how many answer was correct. When user has answered all the questions than it should show score to user (each correct answer carry 2 marks) o Modify the above loop and if user answered a question incorrectly then write it to the HTML file in a new paragraph. o (do at home) print a certificate to the user in HTML showing his name, score etc 3. Save the library books record in a file. The record can be added anytime, can be modified, deleted or searched by book id. (we need to store id, title, author, pages, price of each book). You are given a sample data in file “collection.txt”. modify the code in task3.cpp o Write a function search that takes book id and search the record from the file and show it on screen. If record not fund it should handle that case. o Comment out the relevant lines in given main function, run to check o Write a function insert that take book structure and write the record at the end of the file. o Comment out the relevant lines in the main and run it to insert a record, then check it using search option o Write a function Delete that takes book id and delete that record form the file. o Comment out the relevant lines form main, delete the inserted record and then confirm deletion using search o Write a function modify that take a book structure instance. Modify that record with new values. o Comment out the relevant code in main, run and modify a record. Search it to confirm modification o Write a function that takes nothing, write all the records to the HTML reportHTML file “report.html” in a table where book pagers are above 400. o Comment out the relevant code in main, run and open the file in browser to confirm

Chatbot

simple chatbot to give answers on your trained data

find-shotest-path-priority-queue-structure-

Implement the given methods of priority queue structure using node structure and pointers a) Create node structure that can store strings b) Create PQueue class, declare data members as discussed and write constructor • Write main method and create a queue object c) Write display method that display the queue each element as DATA | PR. Take care of head & tail(it should not move or any other thing should not change) • Call this method in main to test d) Write add method that accept a string and priority number and place it at proper position. Handle all the cases and minimize the queue traversal. Properly adjust the pointers • Call this method in main to add Lahore | 2, Islamabad | 2, Karachi | 5, Multan | 9 in the queue, and display to confirm e) Write getHigestPriorityNo that accept nothing and return the highest priority value in the queue, if queue is empty than return 9999 • Call this method to check the highest priority in the queue f) Write getHigestPriorityValue that accept nothing and return the highest priority element from the queue, if queue is empty then return empty string • Call this method to check the highest priority element in the queue g) Write remove method that remove element with highest priority and return bool removed if element is removed. Implement the cases as discussed in theory. Properly take care of pointers (both head & tail). • Call this method in main to remove and element and display to confirm h) Write search method that accepts a string and return its position in the queue • Call this method to find Multan i) Write a method getPriority that accept a number and return the priority of element found at that position. If no such element the return 9999 • Call this method to find priority of element at 3rd position j) Write a method getValue that accept a number and return the element at that position. If no such element the return empty string • Call this method to find element at 3rd position k) Write size method that return number of elements in the queue • Call this method to determine queue size l) Implement the destructor of priority queue A tourist is traveling by car and wants to know the shortest path to its destination from a sub graph (see figure). He can’t travel long and have to take rest in between. Show him the path to destination such that he can visit the nearest city to take rest. Consider the cities as separate priority queue and select the local shortest path from each city to lead him to the destination.

MCQ_TEST-IN-C-

*Create a structure that can store a MCQ. Following things need to be stored o Question o Four options for answer o Correct answer Create a mcq instance in main and store following data statically. Question: What is Capital of Pakistan? a) Karachi b) Quetta c) Lahore d) Islamabad  Correct answer: Islamabad Show Question and options in the format given. Prompt the user for the answer. Compare the user answer with correct answer and show correct/incorrect accordingly

two-way-sign-language-translator-master

usamashafiq/Cellular-companies-save-Call-details-records-CDR-for-each-call

Cellular companies save Call details records (CDR) for each call. Some of the data of calls made in 2018 year in Gukkhar are given file “cdr.txt”. The file has caller no, callee number, date of call, duration of call. This file has 10lacks records. File has data in the following format. Callerno calleeno day month year hours minutes second o *Write a structure CDR to hold a single record o *Write a function print that accepts a CDR and print it on screen in a row o *Write a function show_all the accept nothing open “cdr.txt” in read mode and read record one by one and use the above print function to print all the records on scree o *Write main function and call show_all method to check o Write a function readf that accept an array of CDR of size N. Read first N records from the file into that array. o Modify the main function and declare and array of size 10 of CDR, call the readf function and pass this array o Write a function writef that accepts an array of CDR of size N and write the array contents to the file “f10.txt” omitting the call status field. o Modify the main and call writef on the array in which data is already been stored. Open the “f10.txt” file to confirm o *Write a function printHTML that accept a callerno, write all calling record of that caller to a new file named “caller.txt”. Test this function to filter calls made by “03090061389". o Write a function countCalls that accepts a callerno and return how many calles are made by this caller no. Test this function to count calls by “03090061389" you must have 6758 call records. o *Write a function Delete that accept an int (record no) and delete that record from the original file. Modify the main function to delete 3rd record. Before and after call show_all function to confirm 2. Write a program that read MCQ questions from the file and ask these question form user, get the answer and calculate the score. Use functional approach with array of structure instance to accomplish the task. Write the wrong answered questions to a new HTML file that can be opened in browser. MCQ questions are given in file “qbank.txt”. Open the file task2.cpp follow the below sequence. Analyze the file structure such that you can store data from file to the structure given below struct Mcq{ char question[300]; char answer[150]; char opt1[150]; char opt2[150]; char opt3[150]; char opt4[150]; } ; o Write main program that declare and array of 10 size of above structure. o Write a function readN that accepts array of Mcq and its size. Open the file for reading and read first size questions from file and put in array o Modify the main to call the readN and pass the created array o Write a function askQuestion that accept an instance of above structure and show question on the screen and ask the answer from user. Compare the answer of user and return true if user answered it correctly otherwise return false. Question: What is Capital of Pakistan? a) Karachi b) Quetta c) Lahore d) Islamabad o Modify the main to loop over the array and pass each element to askQuestion to count how many answer was correct. When user has answered all the questions than it should show score to user (each correct answer carry 2 marks) o Modify the above loop and if user answered a question incorrectly then write it to the HTML file in a new paragraph. o (do at home) print a certificate to the user in HTML showing his name, score etc 3. Save the library books record in a file. The record can be added anytime, can be modified, deleted or searched by book id. (we need to store id, title, author, pages, price of each book). You are given a sample data in file “collection.txt”. modify the code in task3.cpp o Write a function search that takes book id and search the record from the file and show it on screen. If record not fund it should handle that case. o Comment out the relevant lines in given main function, run to check o Write a function insert that take book structure and write the record at the end of the file. o Comment out the relevant lines in the main and run it to insert a record, then check it using search option o Write a function Delete that takes book id and delete that record form the file. o Comment out the relevant lines form main, delete the inserted record and then confirm deletion using search o Write a function modify that take a book structure instance. Modify that record with new values. o Comment out the relevant code in main, run and modify a record. Search it to confirm modification o Write a function that takes nothing, write all the records to the HTML reportHTML file “report.html” in a table where book pagers are above 400. o Comment out the relevant code in main, run and open the file in browser to confirm

usamashafiq/find-shotest-path-priority-queue-structure-

Implement the given methods of priority queue structure using node structure and pointers a) Create node structure that can store strings b) Create PQueue class, declare data members as discussed and write constructor • Write main method and create a queue object c) Write display method that display the queue each element as DATA | PR. Take care of head & tail(it should not move or any other thing should not change) • Call this method in main to test d) Write add method that accept a string and priority number and place it at proper position. Handle all the cases and minimize the queue traversal. Properly adjust the pointers • Call this method in main to add Lahore | 2, Islamabad | 2, Karachi | 5, Multan | 9 in the queue, and display to confirm e) Write getHigestPriorityNo that accept nothing and return the highest priority value in the queue, if queue is empty than return 9999 • Call this method to check the highest priority in the queue f) Write getHigestPriorityValue that accept nothing and return the highest priority element from the queue, if queue is empty then return empty string • Call this method to check the highest priority element in the queue g) Write remove method that remove element with highest priority and return bool removed if element is removed. Implement the cases as discussed in theory. Properly take care of pointers (both head & tail). • Call this method in main to remove and element and display to confirm h) Write search method that accepts a string and return its position in the queue • Call this method to find Multan i) Write a method getPriority that accept a number and return the priority of element found at that position. If no such element the return 9999 • Call this method to find priority of element at 3rd position j) Write a method getValue that accept a number and return the element at that position. If no such element the return empty string • Call this method to find element at 3rd position k) Write size method that return number of elements in the queue • Call this method to determine queue size l) Implement the destructor of priority queue A tourist is traveling by car and wants to know the shortest path to its destination from a sub graph (see figure). He can’t travel long and have to take rest in between. Show him the path to destination such that he can visit the nearest city to take rest. Consider the cities as separate priority queue and select the local shortest path from each city to lead him to the destination.

usamashafiq/-hello-message-with-it-

Take user name as an input and print ‘hello’ message with it First declare two arrays one contain the word hello and the second array is un initialized. Initialize the array in main proc then input data of uninitialized array Then print this array by word hello store in var by output statement show the name store in var1

usamashafiq/-MANAGEMENT-SYSTEM

MARKET PLACE MANAGEMENT SYSTEM USING LINKED LIST IN C++

usamashafiq/1.Print-two-different-strings-statically

First declare two variables then store two strings. Initialize the strings in the main proc then mov the strings in data registers and show them on the screen.

usamashafiq/Adding-numbers

Take input from user add a number in it and display it on screen Input a number from the user and add constant number in it. Then move the added numbers in the data register and display it on the the screen. Exit the code by execution statement

usamashafiq/Addressing-and-service-routines

Take an input and print it on the screen First take an input and store it in data register then pass an interrupt signal and display it on the screen. Write execution statement to exit the code.

usamashafiq/ASCII-Code-its-Equivalent-Character-

c++ code

usamashafiq/ASCII-conversion

Add two numbers Add two constant numbers. To show correct answer add 48 in the Answer. As 48 is the ASCII code of 0. Then show the output on the screen .

usamashafiq/Character-vowel-or-consonant

c++ code

usamashafiq/chocolate-chocolate-separation-queue-structure

Implement the given methods of queue structure using node structure and pointers a) Create node structure that can store integers b) Create queue class, declare data members as discussed and write constructor • Write main method and create a queue object c) Write display method that display the queue each element on new line. Take care of head & tail(it should not move or any other thing should not change) • Call this method in main to test d) Write add method that accept an integer and place it at the end of queue. Properly adjust the pointers. • Call this method in main to add 21, 54, 67, 88, 44, 33, 48, 44, 109, 133 in the queue, and display to confirm e) Write add method that accepts a Node and place it at end of queue • Call this method to add 150 in existing queue f) Write remove method that remove first element from the queue and return removed if element is removed. Implement the cases as discussed in theory. Properly take care of pointers (both head & tail). • Call this method in main to remove and element and display to confirm g) Write search method that accepts a number and return its position in the queue • Call this method to find 67 h) Write get method that accepts position, and return element found at that position. Properly look for index bounds • Call this method to replace find 133 i) Write size method that return number of elements in the queue • Call this method to determine queue size In chocolate production company there are different kind of chocolates. Some people like wafers with chocolate coating. Company weigh each wafer stick and dip in chocolate container to coat it. At the end it is weighted again to meet quality. If any piece is found below form expected weight it has to be re-dipped (and placed on main conveyer again) and overweighed pieces are packed in different weight category. The process is automatic and hundreds of items are processed in a second. The conveyor belt moves the wafers and each of them weighted. The machine arm segregate them based on the weight and move into different conveyer belt. Take wafers form main entry point (consider it as queue) and based on below threshold move them to different conveyer belt (consider them as queues).  Packing conveyer (wafers weigh from 48g – 52g)  Re-dip Conveyer (wafers weigh below 47g)  Over weigh Conveyer (wafers weigh above 52g) You have to count that how many are packed in (48-52) category, how many are re-dipped and how many are move to different weight category. If wafer stick weigh is 15g the find how much chocolate solution is consumed? Implement the simulation by taking weight randomly

usamashafiq/circular-list-structure-using-node-structure-spin-wheel-game-to-earn-rewards

Implement the given methods of circular list structure using node structure and pointers a) Create node structure that can store label and value (string and one integer) b) Create CircularList class, declare data members as discussed and write constructor • Write main method and create a circular list object c) Write display method that display the list each element as LABEL (VALUE). • Call this method in main to test d) Write addFirst method that accept a string and integer number and place it at start of circular list. Properly adjust the pointers. • Call this method in main to add Coins | 1500, Life | 3, and display to confirm e) Write addLast method that accept a string and integer number and place it at start of circular list. Properly adjust the pointers. • Call this method in main to add Keys | 20, and display to confirm f) Write get that accept position and return the node structure at the position, if list is empty the it return null • Call this method to get second element g) Write removeFirst method that remove first element • Call this method in main to remove and display to confirm h) Write removeLast method that removes last element • Call this method is main to remove and display to confirm i) Write add method that accept a node and position and place it at given position • Call this method to insert Shields (10) at 3rd position j) Write search method that accepts a string and return its position in the list • Call this method to find Coins k) Implement the destructor of circular link list 2. Implement a portion of game where character moves to the shop and plays the spin wheel game to earn rewards. Implement the main method by using the circular link list and ask the user to press any key to spin wheel. Then spin the wheel (It will not show on screen as we are not doing graphics) and show the earned rewards. (see the picture below) o Be realistic how a wheel can spine o While wheel is spinning show the current marker position o You can give delays using sleep_for function from thread // Example program for delay #include <iostream> #include <string> #include <thread> #include <chrono> using namespace std::this_thread; // sleep_for, sleep_until using namespace std::chrono; //for seconds, milliseconds, nanoseconds using namespace std; int main() { string name; cout << "What is your name? "; getline (cin, name); sleep_for(milliseconds(100)); cout << "Hello, " << name << "!\n"; }

usamashafiq/Expression-sepration-using-stack

data structure in c++

usamashafiq/Find-binary-number-and-Print-in-reverse-order

c++ code

usamashafiq/Find-prime-Number

c++ code

usamashafiq/Find-prime-number-

Find a prime number if number is prime then print the number and show the my python code

usamashafiq/HelloWorld

Just another repository

usamashafiq/initialize-arrays

Take 5 digits from user and add middle and last digit and display it. Declare an un initialized array of 5 elements at .data. Then input 5 digits from user in first array by incrementing the si register. Then mov the address of middle and last digit in registers and add them.

usamashafiq/Jumps-and-Conditions

Take input as user name and print hello message and then ask then ask him again whether he wants to do that again or not otherwise, terminate the program. Take input the form of capital letter and convert them into decimal repeat the process until the user wants to terminate

usamashafiq/middle-character-as-output

Declare array of any word and print the middle character as output. First store a word in an array. Then initialize it in main proc to print its middle character move the index of middle letter in si register and display it

usamashafiq/operations-on-array-line-field-and-carriage-return

Declare an array of four digits access and print each digit on new line First declare an array of four digits then initialize it in main proc. Then mov the offset of array in si register. Display the first element of array on screen by incrementing the si register display the next 3 elements of array. Then exit the program by execution statement

usamashafiq/Password-Generator

c++ code

usamashafiq/Polymomial-class

OOP C++

usamashafiq/print-Selected-character-name

Create a text file using notepad. Write your friends name in this file. Each name should be on a new line. Write a program that read this file and display only those names on screen where first character of name is from E to T

usamashafiq/Shifts-operations-and-Conditional-jumps-

Develop a password checker for a user and check whether the input password is correct or not. Take an input in character and convert into binary form and then count its ones.

usamashafiq/stack-structure-using-node-structure-and-pointers

Implement the given methods of stack structure using node structure and pointers. List of stack functions is given at the end a) Create node structure that can store integers b) Create stack class, declare data members as discussed and write constructor • Write main method and create a stack object c) Write display method that display the stack each element on new line from top to bottom. Take care of s_top (it should not move or any other thing should not change) • Call this method in main to test d) Write push method that accept an integer and place it at the start of stack. Properly adjust the pointer and return bool • Call this method in main to push 21, 54, 67, 88, 44, 33, 48, 44, 109, 133 in the stack, and display to confirm e) Write push method that accept object of node and copy its data to push in stack. Properly adjust the pointer. • In main create a node with 189 and call this method to push and display to confirm f) Write pop method that remove top element from the stack and return the element value if element is removed. If stack is empty then return -9999 as sentinel value. Implement the cases as discussed in theory. Properly take care of pointers. • Call this method in main to remove an element and display to confirm Write stackSize method that returns size of stack using counter we hold in stack • Call this method in main h) Write stackSizeByPointer method that returns size of stack by traversing the stack • Call this method in main and match results from above i) Write destructor of stack that should fully empty the stack. Properly de-attach element one by one and delete form memory Constructor Set initializing values int stackSize(); Return Size of Stack int stackSizeByPointer(); Return stack size by traversing stack bool push(int); Put given element at the top of stack int pop(); Remove top element from the stack and return element int top(); Return top element of stack void display(); Display stack from top to end Destructor Empty the stack and properly delete elements from memory

usamashafiq/Stacks-Labels-Procedure-in-assembly

Design a quiz game with following features Ask user to enter his name and display the welcome note. Display different options.

usamashafiq/Subtract-two-constant-numbers

Subtract two constant numbers. To show correct answer add 48 in the Answer. As 48 is the ASCII code of 0. Then show the output on the screen .

usamashafiq/Take-two-inputs-from-the-user-and-add-them

Take two inputs from the user. To show correct answer sub 48 from the Answer as when we perform subtraction in fact the subtraction perform on ASCII numbers so to get exact answer 48 is subtracted from the answer. As 48 is the ASCII code of 0. Then show the output on the screen.

usamashafiq/Variable-declaration

Convert an uppercase alphabet to a lower case Input an alphabet from the user. Then move it in data register then add 32 in the dl register to convert uppercase alphabet into a lower case alphabet.