This java program on dequeue implements the concept using an array.

Dequeue or Double Ended Queue is a generalized version of Queue data structure that allows insert and delete at both ends.

# ISC Computer

## Write a program to implement an array based queue

The following java program on queue is written to help you understand the details on the working of the queue based on an array.

Queue Operations:

push: Adds an item onto the end of the queue.

front: Returns the item at the front of the queue.

pop: Removes the item from the front of the queue.

## Write a program to implement an array based STACK

a stack is an abstract data type that serves as a collection of elements, with two principal operations:

push, which adds an element to the stack, and

pop, which removes the most recently added element that was not yet removed.

## ISC – Java Program to implement a linked list

A linked list is a way to store a collection of elements. Like an array these can be character or integers. Each element in a linked list is stored in the form of a node.

## ISC Computer – Recursion – Fibonacci Series

A class Recursion has been defined to find the Fibonacci series upto a limit.

## ISC 2018 – Computer Practical Question 2 Solution

ISC 2018 Computer Practical Write a program to declare a matrix A[ ] [ ] of order (M xN) where ‘M’ is the number of rows and ‘N’ is the number of columns such that the values of both ‘M’ and ‘N’ must be greater than 2 and less than 10. Allow the user to […]