iamparvezkhan25 Goto Github PK
Name: Parvez Khan Pathan
Type: User
Bio: You Know Who I Am.
Twitter: iamParvezKhan25
Name: Parvez Khan Pathan
Type: User
Bio: You Know Who I Am.
Twitter: iamParvezKhan25
Building the AIRBNB Clone app with REACT JS!
Frequently Asked Questions About Array Programme
It's all about Parvez Khan
This proggram is represent & implimentation of Class Based View(CBV) in DJango Framework!
My DJango CRUD App
This repository is shown CRUD Functionality in Django Framework
Learning DJango 2.2 - List & Detail View
Creating buildiwithpython website with Django
Django CRUD Example Apps
Config files for my GitHub profile.
This is my first User Password Project
My First python DJango WebApp Working with API
This is my Front End Project Using HTML5 & CSS3
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.
This is my first User based Registration Form
MCA Sem 6 Project on Flutter
This is my learning Linked List Data Structure Work
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.
A declarative, efficient, and flexible JavaScript library for building user interfaces.
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
An Open Source Machine Learning Framework for Everyone
The Web framework for perfectionists with deadlines.
A PHP framework for web artisans
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
Some thing interesting about web. New door for the world.
A server is a program made to process requests and deliver data to clients.
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
Some thing interesting about visualization, use data art
Some thing interesting about game, make everyone happy.
We are working to build community through open source technology. NB: members must have two-factor auth.
Open source projects and samples from Microsoft.
Google ❤️ Open Source for everyone.
Alibaba Open Source for everyone
Data-Driven Documents codes.
China tencent open source team.