Zama Codes

I am a BS(CS) student and my aim is to spread knowledge. If you face any issue you can contact me on ali323029@gmail.com

"Infix to Post-fix" conversion and "parenthesis check using "User define" stacks C++

#include<iostream> using namespace std; char stack[100]; // char postfix[100]; char exp[100]; // mathematical expression ...
LinkedList implementation in JAVA

import java.util.Scanner; class Node { int data; Node next; } //**********************LinkedList Class******************...
Insertion sorting using pointers and function

Write a program for insertion sorting. #include <iostream> using namespace std; void insertionSort(int *p,int siz...
For Each Loop in Java: A Beginner's Guide

The "for each loop in Java" is a powerful tool for iterating through arrays and collections. In this guide, we will learn how to ...
Tree traversal (preorder,inorder,postorder) using linklist (c++)

#include<iostream> using namespace std; struct node { int data; struct node *left; struct node *right; }; /*...
Selection sorting Dynamically

Worst-Complexity: n ^ 2 Average-Complexity: n ^ 2 Best-Complexity: n ^ 2 Space-Complexity: 1 #include<iostream...
Declaration of one dimensional array of numbers and characters in JAVA

-Declare and initialize two one dimensional arrays with 1) Numbers 2) Characters 1.1-Print the content of both arrays 1.2-Get the l...
Computer fundamental | Pradeep K. Sinha and Priti Sinha | Notes for BS(cs)

This is the notes of computer fundamentals which is written by "Pradeep K. Sinha and Priti Sinha". Notes for the followin...