joker081s,joker081s,github

👋 Hi, I’m @joker081s
👀 I’m interested in learning new things...
🌱 I’m currently learning Java, C++ and C language, in future I'll learn more things and more languages...

joker081s's Projects

basiccalculator

This is basic calculator which perform some operations like addition, subtraction etc.

binarysearchtreeoperations

Operations on the binary search tree. The operations are insertion of node, searching of the data in the tree, deleting of the node and lastly, inorder traversing of tree.

infixtopostfixexpression

This is code which converts infix expression like A+

namepattern

This code is about printing name through Stars. It just prints Sahil Nandal.

pwlabrepostory

This is just an clone of repository of programs that I created in the PW labs.

Queue is a type of Array, through which you can store the data. Queue uses first-in-first-out mechanism to push and pop the data. Queue is array in which we push the value one by one and pop the value which was pushed first because it uses first-in-first-out means element first pushed will come out first.

queue-through-pointer

Pointer is a concept which stores the address of another variable to perform operations. So, in this implementation we don't have to declare global variables instead of that we can use local variable and pass them to the method using pointer to perform operation on array (or for Queue).

stack-operations

Stack is a type of array in which we use LIFO mechanism means last-in first-out. So, in this project I made the simple stack, which can perform simple opertions like push(), pop() etc. using JAVA. But, I didn't use the STACK Class in it.

stack-operations-stackclass

This is just same as Stack-Operations but with some changes like in this project, I used a different class and called it Stack. Then I used that class to perform operation of push and pop. Make an instance of that class in the main method. I make the global variables to perform operations in Stack Class

Recommend Projects