Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
When it is required to create a doubly linked list and display the elements in a reversed order, a ‘Node’ class needs to be created. In this class, there are three attributes, the data that is present in the node, the access to the next node of the linked list, and the access to the previous node of the linked list.Another class needs to be created that would have an initialization function, and the head of the node would be initialized to ‘None’ inside this.Multiple methods are defined by the user to add node to the linked list, to reverse ... Read More
When it is required to count the number of nodes in a doubly linked list, a ‘Node’ class needs to be created. In this class, there are three attributes, the data that is present in the node, the access to the next node of the linked list, and the access to the previous node of the linked list.In a doubly linked list, the nodes have pointers. The current node would have a pointer to the next node as well as the previous node. The last value in the list will have ‘NULL’ value in the next pointer. It can be ... Read More
When it is required to create a doubly linked list from a ternary tree, a ‘Node’ class needs to be created. In this class, there are two attributes, the data that is present in the node, and the access to the next node of the linked list.Another ‘linked_list’ class needs to be created that would have an initialization function, and the head of the node would be initialized to ‘None’.In a doubly linked list, the nodes have pointers. The current node would have a pointer to the next node as well as the previous node. The last value in the ... Read More
When it is required to convert a given binary tree to a doubly linked list, a ‘Node’ class needs to be created. In this class, there are two attributes, the data that is present in the node, and the access to the next node of the linked list.Another ‘linked_list’ class needs to be created that would have an initialization function, and the head of the node would be initialized to ‘None’.In a doubly linked list, the nodes have pointers. The current node would have a pointer to the next node as well as the previous node. The last value in ... Read More
When it is required to sort the elements of a circular linked list, a ‘Node’ class needs to be created. In this class, there are two attributes, the data that is present in the node, and the access to the next node of the linked list.In a circular linked list, the head and the rear are adjacent to each other. They are connected to form a circle, and don’t have ‘NULL’ value in the last node.Another ‘linked_list’ class needs to be created that would have an initialization function, and the head of the node would be initialized to ‘None’.Multiple methods ... Read More
When it is required to search for an element in a circular linked list, a ‘Node’ class needs to be created. In this class, there are two attributes, the data that is present in the node, and the access to the next node of the linked list.In a circular linked list, the head and the rear are adjacent to each other. They are connected to form a circle, and don’t have ‘NULL’ value in the last node. Another class needs to be created that would have an initialization function, and the head of the node would be initialized to ‘None’.Multiple ... Read More
An expression is a combination of operators and operands.Operand is a data item in which operation is performed.An operator performs an operation on dataFor example; z = 3+2*1 z = 5Types of expressionsThe different types of expressions that are evaluated in C language are as follows −Primary expressions − The operand in this expression can be a name, a constant or any parenthesized expression. For example, c = a+ (5*b);Postfix expressions − In a postfix expression, the operator will be after the operands. For example, ab+Prefix expressions − In a prefix expression, the operator is before the operand. ... Read More
The programming languages are used to give instructions to the computer in a language which a computer can understand.Computer languages are classified into three types as follows −Machine languagesSymbolic languagesHigh level languagesMachine languagesComputer is a machine. Since, its memory can store only 1’s and 0’s, instructions must be given to the computer in streams of 1’s and 0’s i.e. binary code.These are easily understandable by the machine.Programs written in binary code can be directly entered into computer for execution and it is known as machine language.Advantages of machine language include −Execution is very fast.It is very difficult to write and ... Read More
When it is required to get the unique elements in a nested tuple, a nested loop and the 'set' operator can be used.Python comes with a datatype known as 'set'. This 'set' contains elements that are unique only.The set is useful in performing operations such as intersection, difference, union and symmetric difference.Below is a demonstration of the same −ExampleLive Demomy_list_1 = [(7, 8, 0), (0 ,3, 45), (3, 2, 22), (45, 12, 9)] print ("The list of tuple is : " ) print(my_list_1) my_result = [] temp = set() for inner in my_list_1: for elem in inner: ... Read More
When it is required to multiply adjacent elements, the 'zip' method, the 'tuple' method, and the generator expression can be used.The zip method takes iterables, aggregates them into a tuple, and returns it as the result.Generator is a simple way of creating iterators. It automatically implements a class with '__iter__()' and '__next__()' methods and keeps track of the internal states, as well as raises 'StopIteration' exception when no values are present that could be returned.Below is a demonstration of the same −ExampleLive Demomy_tuple_1 = (7, 8, 0 ,3, 45, 3, 2, 22) print ("The tuple is : " ) ... Read More