Posts

Showing posts with the label Coding

My very first web app - an extension for Google Chrome

Image
I have recently made a Chrome Browser Extension and submitted it to Google. To my delight, it was approved by Google and published in the Chrome Web Store within 24 hours since submission. The submission took place on 16 November, 2023. Approval and publishing by Google The app in question lets both students and teachers practise transformation of graphs interactively. All you need to do is adding it to the browser as an extension. Here is the link: 👉 Transformation of Graphs This is how it appears in the Chrome Web Store. Just click the button to add it to your browser: Transformation of Graphs on Chrome Web Store This application visually shows how graphs change while applying certain transformations to them, with the app itself being high customizable. The User Interface of the App The App at work Transformation of Graphs The inspiration behind the app stemmed from the realization that visualizing and understanding graph transformations could be a daunting task for many. Whether

Insertion Sort

  Insertion sort is a simple and efficient sorting algorithm that is used to sort small arrays or lists. It works by dividing the input list into two parts: the sorted part and the unsorted part. The sorted part is initially empty, and the unsorted part contains all the elements of the input list. The algorithm iterates through the unsorted part, picking one element at a time and inserting it into the correct position in the sorted part. The algorithm starts by assuming that the first element of the input list is already sorted. It then picks the second element and compares it with the first element. If the second element is smaller than the first element, they are swapped. Otherwise, the second element is already in its correct position in the sorted part. The algorithm then picks the third element and compares it with the second element. If the third element is smaller than the second element, they are swapped. If the third element is also smaller than the first element, it is swappe

Bubble Sort

BUBBLE SORT Sorting algorithms are a fundamental aspect of computer science and are used in a wide range of applications. Bubble sort is one of the simplest and most widely-known sorting algorithms. In this blog post, we will take a closer look at bubble sort, how it works, and its place in the wider world of algorithms. Bubble sort is a simple sorting algorithm that works by repeatedly swapping adjacent elements in a list until they are in the correct order. The algorithm gets its name from the way that smaller elements "bubble up" to the top of the list during each pass. Bubble sort is easy to understand and implement, making it a popular choice for teaching the basics of sorting algorithms. The basic algorithm for bubble sort is as follows: Start at the beginning of the list Compare the first two elements of the list If the first element is greater than the second element, swap them Move to the next pair of elements in the list and repeat steps 2 and 3 Continue until the e

Python Pascal Triangle

Image
The Pascal's Triangle is produced in Python. The programming sequence is as follows: Factorial of a number is run A function of combination is run Pascal' s Triangle is produced with the correct space between the terms using the appropriate nth term calculation You can practise it here interactively:

Pascals Triangle in Python

Hexadecimal, Binary and Decimal AQA GCSE Computer Science

These programmes can do the following: Converting decimal numbers to binary numbers Performing binary shift Converting decimal to hexadecimal

Python

Image
PYTHON Python is an interpreted, object-oriented, high-level programming language with dynamic semantics. Its high-level built in data structures, combined with dynamic typing and dynamic binding, make it very attractive for Rapid Application Development, as well as for use as a scripting or glue language to connect existing components together. Python's simple, easy to learn syntax emphasizes readability and therefore reduces the cost of program maintenance.  Python supports modules and packages, which encourages program modularity and code reuse. The Python interpreter and the extensive standard library are available in source or binary form without charge for all major platforms, and can be freely distributed. It is often used to  build websites and software, automate tasks, and conduct data analysis . Python is a general-purpose language, meaning it can be used to create a variety of different programs and isn't specialized for any specific problems. I have created several

Solving an equation by Iteration

Image
I am solving an equation by iteration. In this case, I am going to solve x 2  - x - 5 = 0 by iteration.  First of all, I am rearranging it in the iterative form: Suppose you have to solve x 2  - x - 5 = 0 by iteration. Let's rearrange it in iterative form first. x = √(x + 5) x n+1  = √(x n  + 5) Let's take the initial value, x 0 = 1  and iterate in the following programme: Now, you can change the initial value and the number of iterations in the code and play with it. Much to your surprise, you will notice that the solution or root is going to be the same regardless of the initial value! This is the beauty of iteration.😂