Aakash Yadav AakashCode12

🎯

Focusing

Developer| Full Stack Developer + Testing+ Cloud

AakashCode12 / Practical-7 || CG || Line Clipping ALgorithm.cpp

Last active September 28, 2020 22:34

Finally Done

AakashCode12 / Practical-8 | DS | Circular Linked List.c

Created September 26, 2020 10:16

	#include <stdio.h>
	#include <stdlib.h>

	//todo Strcuture Definition
	struct node
	{
	int data;
	struct node *next;
	};
	struct node head, newnode, temp, prev, prev1, temp2;

AakashCode12 / DS Practical-9 || Queue Using Linked List.c

Created September 16, 2020 14:14

Stacks and Queue using Linked List data Structure

	#include <stdio.h>
	#include <stdlib.h>
	//todo structure & pointers declaration
	struct node
	{
	int data;
	struct node *next;
	};
	struct node front, rear, newnode, temp;
	int flagforstart=0;//?this zero indicates that there is no element in queue at start

AakashCode12 / Practical-7 || DS || Linked list.c

Created September 2, 2020 15:30

	#include <stdio.h>
	#include <stdlib.h>

	//todo Strcuture Definition
	struct node
	{
	int data;
	struct node *next;
	};
	struct node head, newnode, temp, prev, prev1, temp2;

AakashCode12 / Practical-6 || CG || 2D Transformations.cpp

Last active September 10, 2020 18:07

Done Finally by Matrix style

	#include <stdio.h>
	#include <iostream.h>
	#include <conio.h>
	#include <math.h>
	#include <stdlib.h>
	#include <dos.h>
	#include <graphics.h>

	//!global Variables
	int arr[2][2], scale[2][2], rotationAngle, shearx[2][2], shearY[2][2];

AakashCode12 / Practical -6 || DS || Circular Queue .c

Last active August 26, 2020 16:53

	//** open in Vs Code with better comments extension for better view
	/*
	* Queue using Array program Practical-4
	*/
	// todo standard lib / definitions
	#include <stdio.h>
	#define N 3
	int queue[N];
	int front = -1;
	int rear = -1;

AakashCode12 / Practical- 5 || DS || Queues using Array.c

Last active August 26, 2020 13:47

	//** open in Vs Code with better comments extension for better view
	/*
	* Queue using Array program Practical-5
	*/
	// todo standard lib / definitions
	#include<stdio.h>
	#define N 5
	int queue[N];
	int front =-1;
	int rear=-1;

Last active August 26, 2020 11:18

	#include <iostream.h>
	#include <graphics.h>
	#include <dos.h>
	#include <conio.h>
	//!Boundary Fill Algorithm with 4 points checking
	int boundaryFill(int x, int y, int fillcolor, int backgroundcolor)
	{
	int current = getpixel(x, y);
	if (current != backgroundcolor && current != fillcolor)
	{

AakashCode12 / C Linked List.c

Created August 19, 2020 07:54

	#include <stdio.h>
	#include <stdlib.h>

	//todo structure & pointers declaration
	struct node
	{
	int data;
	struct node *next;
	};
	struct node head, newnode, temp, backtemp;

AakashCode12 / Practical OOPS || String Buffer.java

Created August 18, 2020 08:31

	import java.util.Scanner;
	class StringBufferDemo
	{
	public static void main(String[] args)
	{
	Scanner sc = new Scanner(System.in);
	StringBuffer s = new StringBuffer(20);

	System.out.print("Enter The String:");
	s.append(sc.nextLine());