ASCII in Java ASCII ( American Standard Code for Information Interchange) is a character encoding standard used in computers and communication equipment to represent text, control characters, and other data. ASCII was first developed in the 1960s and has been widely used since then. The ASCII standard uses a 7-bit binary code to represent each … Read more
HTML FULL FORM The full form of HTML is Hyper(H)Text(T) Markup(M) Language(L). Here’s a detailed explanation of each component: HyperText: “HyperText” refers to the method of linking text (or other content) to other documents or web pages via hyperlinks. It allows users to navigate(forward and backward) between pages on the web by clicking on linked … Read more
Using Graphics, we can draw geometric figures like circles, lines, ellipses, bars, etc. In this, we set the coordinates like leftt,top, right,bottomm.Graphics.h library is used for graphics (initgraph method). C program to draw shapes using graphics #include<graphics.h> #include<conio.h> main() { int gdd = DETECT,gmm,leftt=100,topp=100,rightt=200,bottomm=200,xx= 300,yy=150,radiuss=50; initgraph(&gdd, &gmm, “C:\\TC\\BGI”);//initialization of graphics rectangle(leftt, topp, rightt, bottomm); circle(xx, yy, … Read more
REVERSE A LINKED LIST IN A DATA STRUCTURE A linked list is a linear data struture where elements (nodes) are connected using pointer.Each node typically contain: Data(the value stored) Next(a pointer to the next node) Reversing a linked list means changing the direction of links. For Example: Original List:10->20->30->40->NULL Reversed List:40->30->20->10->NULL Reversing a linked … Read more
What is Shell Sort in Data Structure? Shell sort is one of the oldest sorting(ascending order) algorithms named after its inventor Donald L. Shell (1959). Shell Sort is a sorting algorithm that is an improved version of Insertion Sort. It works by comparing and exchanging elements that are far apart, progressively reducing the gap between … Read more
What is an Array Introduction An array is a data structure that stores multiple items of the same data type. Unlike Python’s built-in lists, which can store different data types, arrays are designed for homogenous data storage (e.g., only integers or floats). This feature makes arrays more efficient in memory and computation, especially for numerical data. … Read more
Introduction to Recursion in Data Structures Recursion in data structure is a process where a function calls itself to solve smaller instances of the same problem until it reaches a base case, which stops the recursion. Recursion in data structure is a fundamental concept used in programming and data structures to solve complex problems in … Read more
Queue Operations are…… 1· Enqueue—Add an item(new item in the backside) to the end of the queue. 2· Dequeue—Remove an item from the front. 3· Queue Front—Who is first? 4· Queueu End—Who is last? What is the Queue algorithm in the C data structure? 1)Storage for a queue….. Struct intqueue { int *queueAry; int maxSize; int countt; int … Read more
The structure of a C program is typically organized into several parts. Here’s an outline of the key components of a basic C program: 1.Preprocessor Directives These are instructions to the C preprocessor. They usually include library imports or macro definitions and start with #. Common examples: #include <stdio.h> // For input/output functions #include <stdlib.h> … Read more
Algorithm for creation in a Linked List CREATE—In this algorithm, a Linked List of nodes is created. The list is pointed by pointer first, the last node of the list points to NULL., indicating the end of the list. Each node has two parts DATA and NEXT. Let us assume that a linked list of … Read more