iamparvezkhan25 Goto Github PK

airbnb-clone

Building the AIRBNB Clone app with REACT JS!

array-programme

Frequently Asked Questions About Array Programme

bio-data

biodata-parvezkhan

It's all about Parvez Khan

budget-app-javascript-live

cabapi

class-based-view-django

This proggram is represent & implimentation of Class Based View(CBV) in DJango Framework!

crud-django

My DJango CRUD App

data-structure-algorithm

django-blog-post-project

django-easy-crud

This repository is shown CRUD Functionality in Django Framework

django-listview-detailview

Learning DJango 2.2 - List & Detail View

django-rest-framework-udemy

django-startup

Creating buildiwithpython website with Django

django_crud

Django CRUD Example Apps

html-css-js-my-stuff

iamparvezkhan25

Config files for my GitHub profile.

kahaar.github.io

learining-user-password

This is my first User Password Project

newsapp.github.io

My First python DJango WebApp Working with API

omni-food.github.io

This is my Front End Project Using HTML5 & CSS3

pig-game-javascript-live

python-access-specifier-practice-oops

python_file_tasks

queue-datastructure

To implement a queue using array, create an array arr of size n and take two variables front and rear both of which will be initialized to 0 which means the queue is currently empty. Element rear is the index upto which the elements are stored in the array and front is the index of the first element of the array. Now, some of the implementation of queue operations are as follows: Enqueue: Addition of an element to the queue. Adding an element will be performed after checking whether the queue is full or not. If rear < n which indicates that the array is not full then store the element at arr[rear] and increment rear by 1 but if rear == n then it is said to be an Overflow condition as the array is full. Dequeue: Removal of an element from the queue. An element can only be deleted when there is at least an element to delete i.e. rear > 0. Now, element at arr[front] can be deleted but all the remaining elements have to shifted to the left by one position in order for the dequeue operation to delete the second element from the left on another dequeue operation. Front: Get the front element from the queue i.e. arr[front] if queue is not empty. Display: Print all element of the queue. If the queue is non-empty, traverse and print all the elements from index front to rear.

registration-django

This is my first User based Registration Form

regler

MCA Sem 6 Project on Flutter

singlylinkedlistinsertionoperations

This is my learning Linked List Data Structure Work

spaceshipbattlepygame

stack-datastructure

Stack is a linear data structure which follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). Mainly the following three basic operations are performed in the stack: Push: Adds an item in the stack. If the stack is full, then it is said to be an Overflow condition. Pop: Removes an item from the stack. The items are popped in the reversed order in which they are pushed. If the stack is empty, then it is said to be an Underflow condition.