ashu102's Stars
spoorthybalaji/Daily_Status
ashu102/Program2
jayanaik9090/OpenGL-1
This repository contains all my openGl projects
jayanaik9090/OpenGl
Tic Tac Toe Game for 2 player
jayanaik9090/Dijkstra
Find the shortest path using Dijkstra algorithm (Crossplatform: Qt4.8.4 + OpenGL)
jayanaik9090/OpenGL-project
A project using OpenGL to show a walk-in simulation through the campus of my college
jayanaik9090/sorting-algorithm-visualizer
Computer Graphics project to visualize various sorting algorithms using OpenGL and C++.
jayanaik9090/Dijkstra-opengl-network-simulation
This repository consists of an OpenGL network simulation of Dijkstra's alogorithm.
jayanaik9090/CG-Mini-Project
VTU 6th sem mini project for Computer Graphics
jayanaik9090/Simulaton-Of-Dijkstras-Algorithm
A simple simulation of Dijkstra's Algorithm using OpenGL
jayanaik9090/Dijkstras-Algorithm
Simulation of Dijkstra's Algorithm written in C using OpenGL graphics library.
jayanaik9090/DijkstraGL
OpenGL Mini Project for VI sem
jayanaik9090/sample
jayanaik9090/abc
jayanaik9090/sampl
jayanaik9090/priya3028.Github.io
jayanaik9090/jayanaik9090.github.io
jayanaik9090/CG_PBL
Computer Graphics project in OpenGL.
jayanaik9090/mautic_open_source
jayanaik9090/bootstrap_report
jayanaik9090/drupal_report
jayanaik9090/opensorce_report
jayanaik9090/program
jayanaik9090/CGV_LAB_PROJECT
JayrajShah/Memorise-Me
Arijit is a brilliant boy. He likes memory games. He likes to participate alone but this time he has to have a partner. So he chooses you. In this Game , your team will be shown N numbers for few minutes . You will have to memorize these numbers. Now, the questioner will ask you Q queries, in each query He will give you a number , and you have to tell him the total number of occurrences of that number in the array of numbers shown to your team . If the number is not present , then you will have to say “NOT PRESENT” (without quotes).
pallavi056/problem1
Apeksha12appu/hacker.java
Hacker and traffic lights Zolo is stuck in a traffic due to dysfunctional traffic light. Zolo is a professional hacker and he can get into the system and change the state of the light. His planet has different types of traffic lights such that there are N bulbs on the traffic board and only when all of them are green(G) the cars can pass. there are 2 other states also which the bulb can show; i.e. Red(R) & Yellow(Y). Note that the lights are designed such that they follow a state change cyclic pattern as follows: R------>Y------>G------->R Once Zolo gets into the system he can select any position i and update all elements between i to min(N, i + K - 1) by increasing their state by 1.This whole process takes 1 sec and he can repeat this process any no. of times until he gets all lights = G . Find the minimum time to do the process as Zolo is getting late for work.
kavya-shetty765/BubbleSort
You have been given an array A of size N . you need to sort this array non-decreasing oder using bubble sort. However, you do not need to print the sorted array . You just need to print the number of swaps required to sort this array using bubble sort Input Format The first line consists of a single integer N denoting size of the array. The next line contains N space separated integers denoting the elements of the array. Output Format Print the required answer in a single line
akshatkhandelwal1/Last-Occurance
nachi0106/nachi0106.github.io