Object Oriented Programming

GATE

Data Structures

Data Structures in Python

Power BI

Data Science

Django

Data Structure and Algorithm

Python

Recursion

Arrays

Searching

Sorting

String

Linked List

Data Structures in C

Algebra

Maths

Strings

C++ Tricks

System Design

Theory of Computation

Computer Organization and Architecture

Operating System

Engineering Mathematics

Database

Digital Logic

Computer Networks

GATE 2022

Java

GeeksforGeeks School

Hashing

Competitive Programming

Problem of the Day

School

HTML

Javascript

Bootstrap

Web Development

Android

Excel

Microsoft Office

Machine Learning

Resume Builder

Miscellaneous

Gblog

TechTips

React

Advanced JavaScript

DSA Self Paced

CS-subjects

Data Structures and Algorithms

Operating Systems

C Language

DBMS

Basics of CPP

Data Structures ( Basics )

Object Oriented Design

Dynamic Programming

Data Interpretation and Logical Reasoning

Algorithms

Core Java

RESTful APIs

Spring Basics

CPP-Tricks

Basics of Java

Aptitude

GATE YT

Flutter

Application Development

Blockchain

GFG SDE Sheet

SDE Sheet

Deep Learning

Go Programming

Placement

C++ Programs

Data Visualisation

DevOps

Docker

Queue

Matrix

Trie

Stack

Graph

Tree

Magic Numbers

Divide and Conquer

React Native

React JS

Interview-Questions

Advanced Java

cloud-computing

income tax

Artificial Intelligence

Programming Languages

Computer Graphics

Cyber Security

Project Management

DSA / Placements

DA / Data Science & AI

Development

DevOps Course

All Courses

Courses

ML & Data Science

CS Subjects

Software and Tools

School Learning

Tutorials

Interview Corner

Practice DSA

GfG 160

Interview Prep

Discover SQL in Action with real-world examples demonstrating how SQL queries manage and manipulate data effectively. Learn practical use cases like retrieving, inserting, and updating data to understand SQL's power. Explore detailed examples to enhance your database management skills.&nbsp; Read the full article here: <a href="https://www.geeksforgeeks.org/sql-tutorial/">SQL Tutorial</a>.

SQL in Action

Learn how to use the UPDATE statement in SQL to modify existing data in tables efficiently. This statement allows updating specific rows based on conditions or all rows in a table. Explore syntax and practical examples to ensure accurate data updates.&nbsp; Read the full article here: <a href="https://www.geeksforgeeks.org/sql-tutorial/">SQL Tutorial</a>.

Update data from a table

Learn how to use the INSERT statement in SQL to add data into tables effectively. This statement helps populate tables with single or multiple rows of data. Understand the syntax and explore examples for structured data insertion. Ensure data accuracy with practical implementation.&nbsp; Read the full article here: <a href="https://www.geeksforgeeks.org/sql-tutorial/">SQL Tutorial.</a>

Insert Data in a table

Understand the importance of keys in SQL, including primary, foreign, and unique keys, to ensure data integrity and relationships in databases. Keys play a crucial role in uniquely identifying rows and maintaining database structure. Learn how to use keys effectively in relational databases. Practical examples illustrate their significance.&nbsp; Read the full article here: <a href="https://www.geeksforgeeks.org/sql-tutorial/">SQL Tutorial</a>.

Introduction to Keys

Learn how to retrieve data efficiently using SQL, including the use of SELECT statements and filters like WHERE clauses. SQL simplifies fetching specific records from databases such as MySQL and PostgreSQL. Understand key techniques to query and extract valuable insights from structured data. Practical examples make it easy to grasp the concepts.&nbsp; Read the full article here: <a href="https://www.geeksforgeeks.org/sql-tutorial/">SQL Tutorial</a>.

Data Retrieval with SQL

In this SQL tutorial, you’ll learn basic to advanced SQL concepts like queries, joins, and creating tables. SQL, developed by IBM in the 1970s, helps manage data efficiently in databases like MySQL and Oracle. It is a standard query language for database manipulation. Databases store structured data, enabling easy access and management through SQL.&nbsp; Read the full article for detailed examples and concepts: <a href="https://www.geeksforgeeks.org/sql-tutorial/">here</a>.

Introduction to SQL

In this video, we will be studying the Shortest Job First (SJF) CPU Scheduling Algorithm. What is CPU Scheduling? The process of assigning CPU time to various processes is known as CPU Scheduling. It allows the CPU to execute a process while another process is kept on standby (or is waiting for other system resources). Scheduling improves CPU utilization by reducing idle time. It enhances the efficiency of the system by making it faster and more responsive.&nbsp; When the CPU becomes idle, the OS must select one of the processes that are ready to be executed. The selection process is performed by the CPU scheduler. The CPU Scheduler selects one of the processes present in memory and assigns the CPU to it. The algorithm used by the CPU Scheduler to select the process is known as the CPU Scheduling (or Process Scheduling) Algorithm. Shortest Job First (SJF) algorithm selects the process that has the smallest burst time for assigning the CPU next. It is a greedy algorithm which makes scheduling decisions based on burst times of the processes. SJF is a non-preemptive scheduling algorithm. Once a process is scheduled, it is not interrupted even if a shorter process arrives. It is also known as Shortest Job Next scheduling algorithm. Advantages of SJF: 1) It reduces the average waiting time as compared to FCFS algorithm.&nbsp; 2) It is suitable for jobs that run in batches, as their execution time is already known.&nbsp; 3) It is useful for long-term scheduling of processes.&nbsp; 4) It reduces the average turnaround time of processes.&nbsp; 5) It achieves a high throughput, leading to efficient CPU utilisation. It can lead to starvation of processes if shorter jobs keep entering the system and are selected by the scheduler. Estimating the burst time for all the processes may not be feasible. Difficult to implement as it requires predicting the burst time of processes in advance. Shortest Job First (SJF) CPU Scheduling: <a href="https://www.geeksforgeeks.org/program-for-shortest-job-first-or-sjf-cpu-scheduling-set-1-non-preemptive/">https://www.geeksforgeeks.org/program-for-shortest-job-first-or-sjf-cpu-scheduling-set-1-non-preemptive/</a>

Shortest Job First (SJF) Scheduling Algorithm | Operating Systems

In this video, we will see Boundary fill algorithm and its type in detail. The boundary fill algorithm starts from a pixel inside the polygon to be filled and paints the interior working outward towards the boundary.

Basically, this algorithm works simplest if the colour with which the region must be filled and the colour of the boundary of the region are different. If the boundary is of 1 single colour, this method proceeds outwards pixel through pixel till it hits the boundary of the region.

Boundary Fill Algorithm is recursive in nature. It takes an interior factor(x, y), a fill colour, and a boundary colour because of the input. The set of rules starts by checking the colour of (x, y). If its colour isn't always identical to the fill colour and the boundary colour, then it is painted with the fill colour and the character is known as all of the neighbours of (x, y). If a factor is observed to be of fill colour or of boundary colour, the characteristic does now no longer name its neighbour and returns. 

This technique keeps till all factors as much as the boundary colour for the region were tested. The boundary fill algorithm can be implemented by 4-connected pixels or 8-connected pixels.

1. 4-connected pixels algorithm: After painting a pixel, the function is called for four neighbouring points. These are the pixel positions that are right, left, above, and below the current pixel. Areas filled by this method are called 4-connected.

2. 8-connected pixels algorithm: For more complex diagrams we use this approach.The pixels to be tested are the 8 neighbouring pixels, the pixel on the right, left, above, below and the 4 diagonal pixels. Areas filled by this method are called 8-connected.

Boundary fill algorithm: https://www.geeksforgeeks.org/boundary-fill-algorithm/

Boundary Fill Algorithm in Computer Graphics

In this video, we will see Flood Fill Algorithm in computer graphics. Firstly it starts from a specified interior point (x, y) and reassigns all pixel values that are currently set to a given interior color with the desired fill color. Suppose the area we want to paint has more than one interior color, then we can first reassign pixel values. So that all interior points have the same color. Apart from that we can use a connected or 8-connected method to fill the object. This algorithm is also known as the “Seed Fill algorithm”.This is an algorithm that determines the area that are connected to a given node in a multi-dimensional array. Examples for Flood Fill Algorithms are as follows: 1) Puzzle games 2) Paint programsThe flood fill algorithm takes three parameters: 1. Start node 2.Target color 3. Replacement colorWorking principle of Flood Fill Algorithm: Step 1: Take the position of the starting point. Step 2: Decide whether you want to go in 4 directions (N, S, W, E) or 8 directions (N, S, W, E, NW, NE, SW, SE). Step 3: Choose a replacement color and a target color. Step 4: Travel in those directions. Step 5: If the tile you land on is a target, replace it with the chosen color. Step 6: Repeat 4 and 5 until you’ve been everywhere within the boundaries.Flood fill algorithm:&nbsp; <a href="https://www.geeksforgeeks.org/flood-fill-algorithm-implement-fill-paint/ ">https://www.geeksforgeeks.org/flood-fill-algorithm-implement-fill-paint/&nbsp;</a> <a href="https://www.geeksforgeeks.org/flood-fill-algorithm/">https://www.geeksforgeeks.org/flood-fill-algorithm/</a>

Flood Fill Algorithm | Computer Graphics

In this video, we will understand what is a Resource Allocation Graph (RAG) in Operating System.<h2>What is Resource Allocation Graph (RAG)?</h2>A Resource Allocation Graph is a diagram that tells about the state of the system in terms of processes and resources. The diagrammatic representation of a RAG helps in the easy identification of a deadlock as compared to a tabular representation. However, if the number of processes and their corresponding processes is large in number, tabular representation is better.Each RAG contains vertices and edges such that there are 2 types of vertices and two types of edges that can be present.<ul><li>Process Vertex: Every process is denoted by a vertex in the Resource Allocation Graph. Process vertices are generally denoted by a circle.</li><li>Resource Vertex: Every resource is represented as a vertex in the Resource Allocation Graph. They are two types:<ul><li>Single-instance resource: It is depicted using a single dot inside a box, where the dot indicates the single available instance of the resource.</li><li>Multi-instance resource: It is represented by multiple dots inside the box. The number of dots equals the number of instances.</li></ul></li></ul>Types of edges used in resource allocation graph:<ul><li>Assign Edge:&nbsp;This edge is used when a resource has already been assigned to a process. The arrowhead of the assigned edge points to the process to which the resource has been allocated.</li><li>Request Edge: A request edge indicates that the resource has been requested by a process and this request might be fulfilled in the future. The arrowhead of the request edge points to the resource which has been requested by the process.</li></ul>Apart from this there are various states too which we have discussed in the video.Resource Allocation Graph in OS: <a href="https://www.geeksforgeeks.org/resource-allocation-graph-rag-in-operating-system/">https://www.geeksforgeeks.org/resource-allocation-graph-rag-in-operating-system/</a>

Resource Allocation Graph in Operating System

In this video, we will be discussing what is a Six-State Process model in Operating Systems &amp; why we introduced these process model.Previously we had only 5 states i.e 1) New State 2) Ready State 3) Running State 4) Blocked/Waiting State 5) Exit/Termination State New state added: 1) Suspended StateBy the end of this video, you will understand the Suspended state &amp; it's workingSix-State Process Model in OS: <a href="https://www.geeksforgeeks.org/six-state-process-model-in-operating-system/">https://www.geeksforgeeks.org/six-state-process-model-in-operating-system/</a>

Six-State Process Model in Operating System

In this video, we will be discussing what is producer consumer problem in operating systems.<h2>What is Producer Consumer Problem</h2>The Producer Consumer problem is a process synchronization problem. In this problem, there is a memory buffer of a fixed size. Two processes access the shared buffer: Producer and Consumer. A producer creates new items and adds to the buffer, while a consumer picks items from the shared buffer. The problem is to ensure synchronization between the producer and the consumer such that while the producer is adding an item to the buffer, the consumer does not start accessing it.Further, the producer should not try to add items to the buffer when it is full and the consumer should not access the buffer when it is empty. If the producer finds the buffer full, it should either sleep or discard the new item until the consumer frees a location in the buffer.Similarly, a consumer may go to sleep if it finds the buffer empty. When the producer adds an item, the consumer can continue retrieving the data.The Producer-Consumer problem is also known as the Bounded Buffer problem.A solution is required for the Producer-Consumer problem such that both processes can perform their tasks without ending up in a deadlock.Let's watch the video to understand what solution is required for producer-consumer problem.Producer consumer problem: <a href="https://www.geeksforgeeks.org/producer-consumer-problem-using-semaphores-set-1/">https://www.geeksforgeeks.org/producer-consumer-problem-using-semaphores-set-1/</a>

Producer Consumer Problem in Operating System