Monthly Archives: July 2019

by E-Computer Concepts 1 year ago

Computer Hardware Components

A typical personal computer consists of a case or chassis in a tower shape (Desktop) and the following parts : Motherboard It is the body or main frame of the computer, through which all other components interface Motherboard...

by E-Computer Concepts 1 year ago

Linked List Vs Arrays

The data structure that linked lists compete directly with it the array. Each data structure has its own strengths and weaknesses. So the choice of a particular data structure depends upon the requirements of a problem. Linked list is...

by E-Computer Concepts 1 year ago

What is Rearpeek opeartion?

Rearpeek The rearpeek operation is used to return the element from the rear of the queue without altering the queue. As only access opeartion is performed so there is no change in the number of the elements in queue. ...

by E-Computer Concepts 1 year ago

What is Frontpeek operation?

Frontpeek In Some cases, you may want to inspect the element at the front of queue without actually removing it. This is accomplished using the Frontpeek operation. The fronkpeek operation returns the element from the front of the queue...

by E-Computer Concepts 1 year ago

What is Dequeue operation in queue?

Dequeue The Dequeue operation is used to remove an existing element from the front of the queue. If the queue contains more than one element then after removing the element from the front, the next older element becomes the front of...

by E-Computer Concepts 1 year ago

What is Enqueue?

Enqueue The Enqueue operation is used to insert a new element to the rear if the queue. After the enqueue operation, the element that has just been inserted becomes the rear. Each enqueue operation inceases in the number of elements...

by E-Computer Concepts 1 year ago

What is queue data structure?

A Queue is a linear data structure in which new elements are inserted at one end and elements are deleted from the other end. By convention, the end where insertions are performed is called the rear of the queue and the other end where...

by E-Computer Concepts 1 year ago

Queue

A Queue is a linear data structure in which new elements are inserted at one end and elements are deleted from the other end. By convention, the end where insertions are performed is called the rear of the queue and the other end where...

by E-Computer Concepts 1 year ago

What is Stacktop operation in stack?

STACK TOP OR PEEK In some cases, you want to inspect the element at the top of a stack without actually removing it. This is accomplished using the stack top or peek operation. The stacktop (or peek) operation returns the element at...

by E-Computer Concepts 1 year ago

What is Pop operation in Stack?

POP The pop operation on a stack is just the reverse of the push operation. In this operation, we remove the element from the top of the stack and return it to the user. If stack contains more than one element then after removing the...