Programming Articles - Page 1282 of 3366

In order to add two complex numbers in C programming language, the user has to take two complex numbers as structure members and perform addition operation on those two numbers by creating a user-defined function.AlgorithmRefer an algorithm given below for addition of two complex numbers.Step 1: Declare struct complex with data members. Step 2: Declare name for structure and variables. Step 3: Enter real and imaginary part for first complex number at run time. Step 4: Enter real and imaginary part for second complex number at runtime Step 5: Compute addition of number1 and number2 by calling function. Go to ... Read More

A linear search compares the target element with each array element, while a binary search uses divide-and-conquer method to efficiently search for the target element. In this article, we will compare linear search and binary search. What is Linear Search? Linear search is a sequential searching algorithm where we traverse every element within the input array and compare it with the target element to be found. If the target element is found, we return true and the index, and return false if the element is not found in the given array. Below is an animation of working of linear ... Read More

In this post, we will understand the difference between Applet and Application.ApplicationThey are similar to Java programs.They can be executed independently without using web browser.It requires a ’main’ function for it to be executed.Java applications have full access to local file system and network.They can access all kinds of resources that are available to the system.They can execute the programs with the help of the local system.An application program is required when a task needs to be directly performed for the user.AppletsThey are small Java programs.They have been designed to be included with HTML documents.They need Java enabled web browser ... Read More

There are two types of non-linear data structures namely, B-Tree and Binary Tree. These two terms sound similar but they are absolutely different from each other. The most basic difference between a B-Tree and a Binary Tree is that a B-Tree is used for data storage on a disk, whereas a Binary Tree is used for data storage in RAM. Read this article to learn more about B-tree and Binary Tree and how they are different from each other. What is a B-Tree? B-Tree, also called Balanced Sort Tree, is a type of balanced M-way tree. In a B-tree, the ... Read More

In this post, we will understand the difference between Link and Association.LinkIt can be understood as the physical connection between objects.It helps tell about the relationship among objects.It is represented using line segment between objects.They can’t be referenced.It is used in UML designs.AssociationIt is a specification about the collection of links.The connections are related to classes.It is a general relationship between classes.They are implemented using programming languages as a reference model.It shows connections between classes using line segments.It is used in UML designs.

In this post, we will understand the difference between Friend function and Friend class.Friend FunctionIt is usually used with operator overloading operation.It is used with the ‘friend’ keyword.It helps give a non-member function the access to the private members of the class.It has to be declared before it is used.It is used to access private and protected members of the class.It can be a global function or a function in another class.Exampleclass Node {    private:    int val;    Node* next;    // Other members of Node Class //    friend int LinkedList::search();    // Only search method ... Read More

The realm of computer graphics is an expansive one that is always undergoing development. It involves a variety of concepts and ideas, of which "drawing a line" is the most fundamental tasks involved in working with graphical media.There are two algorithmic rules that are followed while drawing a line on the screen. They are DDA (Digital Differential Analyser) algorithmic rule and Bresenham line algorithm.Both the DDA and Bresenham's algorithm are examples of computational procedures that can be utilised for the goal of approximating the length of a line segment.What is DDA?The primary purpose of a DDA in computer graphics is ... Read More

In this post, we will understand the difference between server-side scripting and client-side scripting.Server-side ScriptingIt helps work with the back end.It doesn’t depend on the client.It runs on the web server.It helps provide a response to every request that comes in from the user/client.This is not visible to the client side of the application.It requires the interaction with the server for the data to be process.Server side scripting requires languages such as PHP, ASP.net, ColdFusion, Python, Ruby on Rails.It is considered to be a secure way of working with applications.It can be used to customize web pages.It can also be ... Read More

In this article, we'll explain the difference between private and protected access specifiers in C++. Access specifiers in C++ control who can access the variables and functions inside a class. Two commonly used specifiers are private and protected. Private members are accessible only within the class, while protected members can be accessed by the class and its derived classes. We'll show how each specifier works in C++, especially with inheritance, using simple examples to make it easy to understand. Private Access Modifier When we declare a class member as private, it means that this member is only accessible within ... Read More

In this post, we will understand the difference between linear queue and circular queue −Linear QueueIt is a linear data structure, which data is arranged in a linear pattern.Operations such as insertion and deletion are done from rear and front respectively.It requires more memory, since data is stored in a linear fashion.The element that is added to a linear queue at first, is the element that gets deleted first.It follows FIFO, i.e first in first out.The element that is inserted first is the element that is deleted first as well.It is not as efficient as a circular queue structure.Circular QueueThe ... Read More