## Matrix in Spiral order

Download Here

- Home
- Algorithms
- Computer Graphics
- Lab 1 – Print Green Window
- Lab 2 – Sierpinski Triangle
- Lab 3 – Two Dots
- Lab 4 – Square in Square
- Lab 5 – Qaudrilateral
- LAB 6- e^(-x)*cos(2*x*π ) Graph
- Lab 7 – sin(x)/x Graph
- Lab 8 – Dot on Click
- Lab 9 – (i) Chess Board
- Lab 9 – (ii) Colored Chess Board
- Lab 10 – Freehand Drawing
- Lab 11 – Mouse Click Polyline
- Lab – 12. Color Freehand Drawing

- Data Structures
- Networking
- About Us

Man is still the most extraordinary computer of all

Download Here

Question: You are given a decimal number x as input. If g(x) is defined as number of 1s in the binary representation of the decimal number, we can see that… Read more »

We had Verizon placement test at our college. It comprised of 4 rounds. CS, ECE and EEE branches were eligible to attend with a cutoff of 7 cgpa with no… Read more »

During the month of Septeber We attended Infosys On-Campus placements. Infosys had 2 rounds. 1st was the Online test and 2nd was the technical Interview. The details of those rounds… Read more »

We had a placement test for Samsung R&D at our college. The first round was an online test which was 30 minutes long and comprising of 30 objective questions. Questions… Read more »

Algorithm: Use Recursion. If both the trees are NULL, return true. If only one of the trees is NULL return false. Recursively find if all pairs of corresponding left nodes… Read more »

Algorithm: [sourcecode lang=”cpp”] void DeleteBinaryTree(tree_node *root) { if(!root) return; DeleteBinaryTree(root->left); DeleteBinaryTree(root->right); free(root); } [/sourcecode]

Algorithm: Return true if both the trees are empty. Return false if only one of the tree is empty. Return false if root data of one tree is different from… Read more »

Algorithm: [sourcecode lang=”cpp”] int FindLevelWithMaxSum() { tree_node *temp; int level=0, maxLevel=0; std::queue<tree_node *> Q; int currentSum=0, maxSum=0; if(!root) return 0; Q.push(root); Q.push(NULL); while(!Q.empty()) { temp=Q.front(); Q.pop(); if(temp==NULL) { if(currentSum>maxSum) {… Read more »