khushi-shukla Goto Github PK

angular

api-dev-bootcamp

asian-countries

auto-grading-system

bootstrap

The repo has been created using bootstrap

cheatsheets-for-developers

This Cheat sheet list has been made to enhance the workflow and efficiency. This well curated list will save you time when you just can't remember the code.

city-tour

contactapp

design-analysis-of-algorithms

Module wise C++ code

dsa

facebooklike

This project is made using JavaScript, Jquery and JqueryUi. It is a simple page like facebook.

findmeal

flipping-tiles

Flipping Tiles is a java GUI project. It also saves the scores in a csv file

free-programming-books

:books: Freely available programming books

github-slideshow

A robot powered training repository :robot:

hacktoberfest

Participate in Hacktoberfest by contributing to any Open Source project on GitHub! Here is a starter project for first time contributors. #hacktoberfest

hacktoberfest2021

Raise Genuine PRs only. Your PRs will be accepted, keep patience. Star This Repo. You aren't allowed to Update README.md

hacktoberfest2023-1

This repository is made for hacktoberfest 2023. Here you can upload DSA questions in the CPP language. Leetcode , GFG , Codechef, codeforces problems are also accepted in this repository.

hello-world

it-cert-automation-practice

Google IT Automation with Python Professional Certificate - Practice files

javascript

Algorithms and Data Structures implemented in JavaScript for beginners, following best practices.

khushi-shukla

landingpage

mips64bitsaddition

64-bit Adds (45 points): Write a MIPS assembly program in the MARS simulator that solves the following problem. Ask the user to enter 4 unsigned (positive) 32-bit integers. Read these 4 integers; let's call them A, B, C, D. At the end of your program, registers $t8 and $t9 should contain the 64-bit result of ((A*B) + (C*D)); $t8 should have the most significant 32 bits and $t9 should have the least significant 32 bits. We will not test your code with invalid inputs, so you don't need to clutter your code with checks for invalid inputs. Hint: The tricky part here of course is to perform addition on two 64-bit values. Since you can only do 32-bit additions in MARS, you'll somehow have to figure out how to propagate a carry from the 32nd bit to the 33rd bit. When you add two large 32-bit numbers (with addu $t1, $t2, $t3), the result may be a 33-bit number, but MIPS does not give you access to that 33rd bit. So you'll have to explicitly compute that 33rd bit. Note that the 33rd bit is a 1 if at least two of the following three bits are 1: (i) the 32nd bit of the first operand, (ii) the 32nd bit of the second operand, (iii) the carry generated by the sum of the 31 least significant bits.

mipsstringcompression

Data Compression (45 points): Write a MIPS assembly program in the MARS simulator that accepts an input string of size less than 40 characters, and applies the following compression algorithm to the string, and then prints the resulting compressed string. The input string will only consist of alphabets, i.e., a-z and A-Z. First check the string to make sure it's a valid input (if not, print an error message and quit). Then walk through the string looking for consecutive occurrences of the same character and replace them with the character and a count (called a "run length encoding"). For example, if you see AAAAA, you would replace them with A5. If you see BBBBBBBBBBBB, you would replace them with B12. Note that the number 12 is represented as characters "1" and "2" within the output string. Single character occurrences do not need a count. For reference, here is an ASCII table. Here is an example run of the program: Provide an input string with less than 40 characters and only containing a-z or A-Z: AACCCCCGTTTTTTTTTTTTTTAAAabbcd The compressed string is: A2C5GT14A3ab2cd

neomorphic-portfoliotemplate

This is a OpenSource Portfolio Template Based on Neomorphic Theme Made with pure HTML, CSS(SCSS), And A bit of Java script

note-app

npx-khushi

oops_lab

pokemon