Explore topic-wise InterviewSolutions in .

22,24,26,31,42,45,55,63,72,77,88,99

If U want to KNOW such types of ANSWER PLZZ go to GOOGLE

Min: BEGIN with root and MOVE left until the NODE's left is not NULL
Max: begin with the route and move right until the node's WRITE is not null

Hi there !

_______________________

RAM stands for Random ACCESS Memory.

The internal memory that can be read from as well as written to is called RAM i. e., Random Access Memory.

RAM is a FORM of DATA storage that can be accessed randomly at any time in any order, by CPU.

RAM CONTENTS can be changed or altered as and when required.

RAM allows the computer to read data quickly to run applications.

When people talk about computer memory in connection with computer they usually mean the RAM.

The Random Access Memory ( RAM ) is volatile i. e., it's contents are lost when power is turned off. Because of RAM's following limitations, auxiliary memory is needed.

Limitations of RAM :-)

(i) LIMITED storage capacity.

(ii) volatile in nature i. e., it's contents get removed when power is turned off.

_______________________

Thanks for the question !

☺️❤️☺️

                          46

          21                                56

9                                                     89

      12          

The above BST will be GENERATED for that LIST

Begin with root and compare the value of the node with the value you are SEARCHING for. if the NUMBER is LESS than or equal to then check its left node else check its right node and repeat this until you either find the element or you REACH the LEAF

ANIMATION lets you bring out your slide SHOW more PRESENTABLE and INNOVATIVE.

HOPE IT HELPS.

This is similar to a situation where expenses are more than income. Exactly what happens when animal body doesn't GET enough food for energy synthesis is what will happen in plants.

Photosynthesis is an anabolic pathway. Carbon dioxide from the atmosphere and water from soil get converted to glucose in plants in the presence of SUNLIGHT. This glucose ACTS as food in plants.

Respiration is a catabolic pathway. The glucose breaks down into carbon dioxide and water by using oxygen to release energy. This process is similar to the process of digestion in animals where a complex molecule is broken down into simple molecules.

Now, in a case of prolonged fasting in man the body doesn't get PROPER food and thus no nutrients are provided to it. To compensate this loss the carbohydrates, fats and proteins in the body start breaking down into their simpler forms.

Something similar happens in plants. When the rate of respiration is more than the rate of photosynthesis, the biomolecules present in plants break down to compensate the reduced rate of photosynthesis. This results in loss of DRY weight of the plant.

In designing of Algorithm, complexity ANALYSIS of an algorithm is an essential aspect. Mainly, algorithmic complexity is concerned about its performance, how fast or slow it works.

The complexity of an algorithm describes the efficiency of the algorithm in terms of the amount of the memory required to process the data and the PROCESSING TIME.

Complexity of an algorithm is analyzed in two perspectives: Time and Space.

ASYMPTOTIC Notations are languages that allow us to analyze an algorithm’s running time by identifying its behavior as the input size for the algorithm increases. This is also known as an algorithm’s growth rate. Does the algorithm suddenly BECOME incredibly slow when the input size grows? Does it mostly maintain its quick run time as the input size increases? Asymptotic Notation gives us the ability to answer these questions.

1) Create an empty stack S. 2) Initialize current node as root 3) Push the current node to S and SET current = current->left until current is NULL 4) If current is NULL and stack is not empty then a) Pop the top ITEM from stack. b) Print the popped item, set current = popped_item->right C) Go to step 3. 5) If current is NULL and stack is empty then we are done.

Assuming the the data is not SORTED, if the elements are in an array start will first element and compare with each element until either you find the element or REACH TILL the end

If elements are in linked list you can start will the first element, compare and then move to the NEXT node using the next pointer, do this until you either find the element of the next pointer of a node is pointing to NULL.

If the data is sorted and is in array then you can apply BINARY search

Construct bst
and delete 42 by moving to the RIGHT of 42 and then LEFT until you REACH a leaf
replace 42 with leaf

How to Write an Algorithm in Programming LANGUAGE

Keep in mind that algorithm is a step-by-step process.

Depending UPON programming language, include syntax where necessary.

Begin.

Include variables and their usage.

If they are any LOOPS, TRY to GIVE sub number lists.

Try to give go back to step number if loop or condition fails.

A division algorithm is an algorithm which, given two INTEGERS N and D, computes their quotient and/or REMAINDER, the result of division. Some are APPLIED by hand, while OTHERS are employed by digital circuit designs and software.

More TREE terminology:

The depth of a node is the number of edges from the root to the node.

The height of a node is the number of edges from the node to the DEEPEST leaf.

The height of a tree is a height of the root.

A full binary tree.is a binary tree in which each node has exactly zero or two children.

A complete binary tree is a binary tree, which is completely filled, with the possible EXCEPTION of the bottom level, which is filled from LEFT to RIGHT.

How to Write an Algorithm in PROGRAMMING Language

Keep in mind that algorithm is a step-by-step process.

Depending UPON programming language, INCLUDE syntax where necessary.

Begin.

Include VARIABLES and their usage.

If they are any loops, try to give sub number lists.

Try to give go back to step number if LOOP or condition fails.

How to Write an Algorithm in Programming Language

Keep in mind that algorithm is a STEP-by-step process.

Depending upon programming language, include syntax where necessary.

Begin.

Include VARIABLES and their usage.

If they are any LOOPS, try to give sub number lists.

Try to give GO back to step number if loop or condition fails.

HELLO MATE
HERE'S YOUR ANSWER
__________________


HEAP SORT ALGORITHM

In computer science, HEAPSORT is a comparison-based SORTING algorithm. Heapsort can be thought of as an improved SELECTION sort



HOPE IT HELPS

THANK YOU
- SHIVAMSHAURYA

/﹋\_
(҂`_´)
<,︻╦╤─••••PLÉÃSÈ FÖLLÔW MÉ
_/﹋\_
100 %
██████████ HÉLPFÜL ✔




✔️✔️✔️✔️✔️✔️


●▬▬▬▬▬ஜ۩۞۩ஜ▬▬▬▬▬▬●

Priority queue. In COMPUTER SCIENCE, APRIORITY queue is an abstract data type which is like a regular queue or stack data structure, but where additionally each element has a "priority" associated with it. In a priority queue, an element with HIGH priority is served before an element with low priorit



●▬▬▬▬▬ஜ۩۞۩ஜ▬▬▬▬▬▬●



●▬▬▬▬▬ஜ۩۞۩ஜ▬▬▬▬▬▬●


●▬▬▬▬▬ஜ۩۞۩ஜ▬▬▬▬▬▬●
●▬▬▬▬▬ஜ۩۞۩ஜ▬▬▬▬▬▬●

It is the vertex which is DEFINED as number of edges ENTERS or exists from it.

Hope it HELPS.....

/﹋\_
(҂`_´)
<,︻╦╤─••••PLÉÃSÈ FÖLLÔW MÉ
_/﹋\_
100 %
██████████ HÉLPFÜL ✔




✔️✔️✔️✔️✔️✔️


●▬▬▬▬▬ஜ۩۞۩ஜ▬▬▬▬▬▬●


Stack can be implemented USING both arrays and linked LISTS. The LIMITATION, in the case of an array, is that we need to define the size at the beginning of the implementation. This makes ourstack static. It can ALSO RESULT in “stackoverflow” if we try to add elements after the array is full


●▬▬▬▬▬ஜ۩۞۩ஜ▬▬▬▬▬▬●



●▬▬▬▬▬ஜ۩۞۩ஜ▬▬▬▬▬▬●


●▬▬▬▬▬ஜ۩۞۩ஜ▬▬▬▬▬▬●
●▬▬▬▬▬ஜ۩۞۩ஜ▬▬▬▬▬▬●

A graph is a pictorial representation of a set of objects where some pairs of objects are connected by LINKS. The interconnected objects are represented by points termed as vertices, and the links that connect the vertices are called EDGES.

Formally, a graph is a pair of sets (V, E), where V is the set of vertices and E is the set of edges, connecting the pairs of vertices. Take a look at the following graph −



In the above graph,

V = {a, b, c, d, e}

E = {ab, ac, bd, cd, de}

Graph Data Structure

Mathematical graphs can be represented in data structure. We can represent a graph using an array of vertices and a two-dimensional array of edges. Before we proceed further, let's familiarize ourselves with some important terms −

Vertex − Each node of the graph is represented as a vertex. In the following example, the labeled circle represents vertices. Thus, A to G are vertices. We can represent them using an array as shown in the following image. Here A can be identified by INDEX 0. B can be identified using index 1 and so on.

EDGE − Edge represents a path between two vertices or a line between two vertices. In the following example, the lines from A to B, B to C, and so on represents edges. We can use a two-dimensional array to represent an array as shown in the following image. Here AB can be represented as 1 at row 0, column 1, BC as 1 at row 1, column 2 and so on, keeping other combinations as 0.

Unlike linear data structures (ARRAY, Linked List, Queues, STACKS, etc) which have only one logical WAY to traverse them, trees can be TRAVERSED in different ways. Following are the generally used ways for traversing trees.



Example Tree

Depth First Traversals:
(a) Inorder (Left, ROOT, Right) : 4 2 5 1 3
(b) Preorder (Root, Left, Right) : 1 2 4 5 3
(c) Postorder (Left, Right, Root) : 4 5 2 3 1

Breadth First or Level Order Traversal : 1 2 3 4 5
Please see this post for Breadth First Traversal.

Applications of Queue Data Structure. Queue is used when things don't have to be processed immediately, but have to be processed in FIRST In First Out order like Breadth First Search. This property of Queue MAKES it also USEFUL in FOLLOWING kind of scenarios. 1) When a resource is SHARED among multiple consumers.
by.....
#dark⚫️

When inserting or searching for an ELEMENT in a BINARY search TREE, the KEY of each visited node has to be compared with the key of the element to be inserted or found.

The shape of the binary search treedepends entirely on the order of insertions and deletions, and can become degenerate.

by ....
dark⚫️

/﹋\_
(҂`_´)
<,︻╦╤─••••PLÉÃSÈ FÖLLÔW MÉ
_/﹋\_
100 %
██████████ HÉLPFÜL ✔




✔️✔️✔️✔️✔️✔️


●▬▬▬▬▬ஜ۩۞۩ஜ▬▬▬▬▬▬●
Circular Queue is a linear data structure in which the operations are performed BASED on FIFO (First In First Out) principle and the last position is CONNECTED back to the first position to make a CIRCLE. ... enQueue(value) This function is USED to insert an element into the circular queue.




●▬▬▬▬▬ஜ۩۞۩ஜ▬▬▬▬▬▬●



●▬▬▬▬▬ஜ۩۞۩ஜ▬▬▬▬▬▬●


●▬▬▬▬▬ஜ۩۞۩ஜ▬▬▬▬▬▬●
●▬▬▬▬▬ஜ۩۞۩ஜ▬▬▬▬▬▬●

Here is your solving...PLZ mark me as a BRAINIST if U like it ...

A minimum spanning tree (MST) or minimum WEIGHT spanning tree is a subset of the edges of a connected, edge-weighted (un)directed graph that connects all the vertices TOGETHER, without any cycles and with the minimum POSSIBLE total edge weight. That is, it is a spanning tree whose sum of edge weights is as small as possible. More generally, any edge-weighted undirected graph (not necessarily connected) has a minimum spanning FOREST, which is a UNION of the minimum spanning trees for its connected components.

HOPE IT HELPS YOU
PLZ MARK ME AS BRAINELIST
#BE BRIANLY

Hhhhjhhhhbhhhhhhhhhjhh

When inserting or SEARCHING for an element in a binary search tree, the key of each visited node has to be COMPARED with the key of the element to be inserted or found.

The shape of the binary search treedepends entirely on the order of INSERTIONS and DELETIONS, and can BECOME degenerate.

by.....
#dark⚫️

Linked List example:

Deleting an element with a specific value from a linked list.

Here are some constraints for our example:

The list holds char's.

Deletion can occur anywhere in the list.

The delete operation will not RETURN the element that we delete, it only need remove it from the list.

Now, recall the basic structure of a singly-linked list:

list | v --------- --------- --------- | a | --+---> | b | --+---> | c | 0 | --------- --------- ---------

In other WORDS, there is a node for each element, where nodes consist of a part in which the element is stored and a link to the next node. The last node links to nothing (i.e., there are no nodes after it). Also, there is a link to the beginning of the list.

What do these links correspond to in C?

Answer: Pointers!

We'll consider our ELEMENTS and nodes to have the following types:

typedef char elementT; ... typedef struct nodeTag { elementT element; struct nodeTag *next; } nodeT;

and thus, the pointer to the beginning of the list will be:

nodeT *list;

Aside: Although list is a pointer, we won't use the convention of naming it "listP". That's because we want to be abstract about what "list" is. I.e., users of the list don't really care whether it is implemented as a linked list or array or whatever--when they want to access a list, they just call list functions on this variable.

When the list is empty, what value will the pointer to the beginning have?

Answer: There are no nodes to point to, so it will be NULL!

Different CASES:

There are a few steps to deleting a specific element from the list:

Find the node with the element (if it exists).

Remove that node.

Reconnect the linked list.

Update the link to the beginning (if necessary).

The order in which we perform these steps will depend on how we implement the deletion operation.

Note: For simplicity, if there are two elements with the value we want, we'll just remove the first one.

Finding the node in question is a matter of traversing the list and looking at each node's element.

Reconnecting the list once a node is to be removed is more interesting. Let's consider at least 3 cases:

Removing a node from the beginning.

Removing a node from the middle.

Removing a node from the end.

Removing from the beginning

When removing the node at the beginning of the list, there is no relinking of nodes to be performed, since the first node has no preceding node. For example, removing node with a:

list | v --------- --------- --------- | a | --+---> | b | --+---> | c | 0 | --------- --------- ---------

However, we must fix the pointer to the beginning of the list:

list | +-------------+ | v --------- --------- --------- | a | --+---> | b | --+---> | c | 0 | --------- --------- ---------

Removing from the middle

Removing a node from the middle requires that the preceding node skips over the node being removed. For example, removing the node with b:

list | v --------- --------- --------- | a | --+--+ | b | --+---> | c | 0 | --------- | --------- --------- | ^ +----------------+

This MEANS that we need some way to refer to the node before the one we want to remove.

Removing from the end

Removing a node from the end requires that the preceding node becomes the new end of the list (i.e., points to nothing after it). For example, removing the node with c:

list | v --------- --------- --------- | a | --+---> | b | 0 | | c | 0 | --------- --------- ---------

Note that the last two cases (middle and end) can be combined by saying that "the node preceding the one to be removed must point where the one to be removed does

Hi.


In computer science, the Floyd–Warshall algorithm is an algorithm for finding shortest PATHS in a weighted graph with positive or negative edge WEIGHTS (but with no negative cycles). A single execution of the algorithm will FIND the LENGTHS (summed weights) of shortest paths between all pairs of vertice

hope it HELPS u

To represent a queue using an array you need two index pointers: one for the head of the queue and one for the tail. Insertions are made by adjusting the tail pointer and DELETIONS by adjusting the head pointer. If either pointer advances beyond the valid array index then it is set to the opposite end of the array (making the array circular).

A COUNTER variable is usually unnecessary if we note that when the head pointer is equal to the tail pointer then the queue is empty while if the head and tail pointers differ by 1 then the queue is FULL. This presupposes that the head pointer points to the next element to be dequeued while the tail pointer points to the next vacant POSITION.

/﹋\_
(҂`_´)
<,︻╦╤─••••PLÉÃSÈ FÖLLÔW MÉ
_/﹋\_
100 %
██████████ HÉLPFÜL ✔




✔️✔️✔️✔️✔️✔️


●▬▬▬▬▬ஜ۩۞۩ஜ▬▬▬▬▬▬●


A queue is a certain 2-sided data structure. You can add new ELEMENTS on ONE side, and remove elements from the other side (as OPPOSED to a STACK that has only one side). Enqueuemeans to add an element, DEQUEUE to remove an element.


●▬▬▬▬▬ஜ۩۞۩ஜ▬▬▬▬▬▬●



●▬▬▬▬▬ஜ۩۞۩ஜ▬▬▬▬▬▬●


●▬▬▬▬▬ஜ۩۞۩ஜ▬▬▬▬▬▬●
●▬▬▬▬▬ஜ۩۞۩ஜ▬▬▬▬▬▬●

The TOWER of HANOI is a MATHEMATICAL GAME or puzzle invented by the French MATHEMATICIAN Edouard Lucas in 1883

Email is a great way of communicating with friends and family at the touch of a button, no matter where in the world you are

Read on to learn:

how to begin composing a new email
where to add recipients to your email
where to input your subject line
how to send your email or save it as a DRAFT, for later
The following steps show you how to send an email using a Gmail account. However, many email accounts or applications follow a similar process for creating and sending a new message.

You’ll need:

a computer with active internet connection
an email account set up and ready to send and receive emails.
Follow these step-by-step instructions to send an email

Step 1: Log in to your Gmail account so that you are on the dashboard (main page) of your mail account.

Step 2: Click Compose.

Gmail compose button screenshot

Step 3: A new blank email window will open up. In the ‘To’ box, type in the email address of the recipient.

Composing an email in Gmail







Step 4: You might want to include someone else in your email to ‘keep them in the loop’. You can do this by clicking Cc or Bcc, which will open another field. ‘Cc’ means ‘carbon copy’ and ‘Bcc’ means ‘blind carbon copy’. Adding an email address to the ‘Cc’ field means that that person will receive a copy of the email and all the other recipients will see their email address. If an email address is put into the 'Bcc’ field, the person will get a copy of the email but no other recipient will see that address.

If you are sending the same email to lots of different people, it’s a good idea to put all the email addresses in the ‘Bcc’ field to keep your ‘mailing list’ confidential. That way, there’s no chance that it could fall into the hands of a spammer or hacker.

Composing an email and adding a cc email address



Step 5: The subject field allows you to give the recipient an idea of the topic of your email, like a heading. You don’t have to put anything in the subject box, but it can help when viewing and SORTING email.

Step 6: Email text can be formatted in a similar way to text in a word DOCUMENT. You can change the font style, colour and size using the formatting icons. You can also create bullet points and check the spelling of your email. Choose your formatting from the menu shown.



Formatting options in Gmail

Step 7: Type your message in the main body field of your email.



You can format your email using the options that are available on the toolbar. To add a LINK in the body of your email click on the insert link icon, then add the 'Text to DISPLAY' and then a web or email address, finally click OK.

Insert a link



Step 8: When you’re happy with your email, click the blue Send button at the bottom of the compose window.

Sending an email in Gmail



Step 9: The email you’ve sent will now be stored in the ‘Sent Mail’ folder on your Gmail dashboard. You may have to run your mouse pointer over the Inbox folder link to see the other folders.



Step 10: You may start an email but then decide to come back to it later rather then sending it straightaway. Gmail saves your drafts automatically. So you can simply close the email and the unfinished email will be saved to your ‘Drafts’ folder. When you decide that you’re ready to send it, you can retrieve it from the ‘Drafts’ folder by clicking Drafts and then clicking the correct item in the ‘Drafts’ folder list. Finish the email and click Send as normal.

HOPE IT HELPS YOU
PLZ MARK ME AS BRAINELIST
#BE BRIANLY

A topology is a RELATIONSHIP exist between the links and linking DEVICES (nodes) to each other which is represented by a geometric representation. Star and Ring topology are the TYPES of network topologies. The crucial difference between star and ring topology is that the star topology is suitable for a primary-secondary TYPE of connection whereas ring topology is more convenient for the peer-to-peer connection.

The link is shared equally in the peer-to-peer connection. Inversely, in a primary-secondary relationship one device is used to control traffic and other devices must transmit the SIGNAL through it.

#include
#include
int main ()
{
clrscr();
int n, num, digit, REV = 0 ;
printf(INPUT the number:);
SCANF("%d"num) ;
n = num ;
do
{
digit = num % 10 ;
rev = ( rev * 10 ) + digit ;
num = num / 10 ;
}
while ( num != 0);
if( n == rev )
{
printf(The number is palindrome );
}
else
{
printf( The number is not palindrome );
}
return 0 ;
}

#include

int MAIN()
{
int i, j, n, fact, SIGN = - 1;
float x, p, SUM = 0;

printf("Enter the value of x : ");
SCANF("%f", &x);
printf("Enter the value of n : ");
scanf("%d", &n);

for (i = 1; i <= n; i += 2)
{
p = 1;
fact = 1;
for (j = 1; j <= i; j++)
{
p = p * x;
fact = fact * j;
}
sign = - 1 * sign;
sum += sign * p / fact;
}

printf("sin %0.2f = %f", x, sum);

return 0;
}


The output will be:
Enter the value of x : 2
Enter the value of n : 3
sin 2.00 = 0.666667