Parvez Khan Pathan's repositories
airbnb-clone
Building the AIRBNB Clone app with REACT JS!
Array-Programme
Frequently Asked Questions About Array Programme
biodata-ParvezKhan
It's all about Parvez Khan
Class-Based-View-DJango
This proggram is represent & implimentation of Class Based View(CBV) in DJango Framework!
CRUD-DJango
My DJango CRUD App
DJango-Easy-CRUD
This repository is shown CRUD Functionality in Django Framework
DJango-ListView-DetailView
Learning DJango 2.2 - List & Detail View
Django-Startup
Creating buildiwithpython website with Django
iamParvezKhan25
Config files for my GitHub profile.
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
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
SinglyLinkedListInsertionOperations
This is my learning Linked List Data Structure Work
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.
Template-Filters-Coding-example
This is my custome made Template-Filter example.
TemplateView-Example-DJango
This is programme is present and implimentation of Template-View Example of DJango