Skip to content

Learn & Lead

Man is still the most extraordinary computer of all

Menu
  • Home
  • Algorithms
    • Sorting Algorithms
    • String Algorithms
    • Kadane’s Algorithm
  • 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
    • Linked List
    • Queues
    • Stacks
    • Trees
  • Networking
    • Linux Assembly Language Premier
      • Part – 1 System Organization
      • Part – 2 Virtual Memory Organization
    • Socket Programming
      • Socket Programming – Part 1
      • Socket Programming – Part 2
    • TCP Client program in C language
    • TCP Server program in C language
    • UDP Client program in C language
    • UDP Server program in C language
  • About Me

Category: Data Structures

Posted onMay 1, 2019May 6, 2019Algorithms

GDB useful commands for C-program debugging

by RobinLeave a comment on GDB useful commands for C-program debugging

To debug a C-program in gdb, compile the program and use the following command to enter into gdb mode in linux terminal – gdb ./your_program…

Read More
Posted onApril 10, 2015September 23, 2015Algorithms

Matrix Multiplication

by RobinLeave a comment on Matrix Multiplication

[wpdm_package id=’1153′]  

Read More
Posted onSeptember 29, 2014April 10, 2015Algorithms

Bubble Sort on Linked List

by RobinLeave a comment on Bubble Sort on Linked List

[wpdm_package id=’1161′] We have seen sorting on numbers in arrays. Now what about sorting a linked list using bubble sort? Before we continue, we must…

Read More
Posted onSeptember 19, 2014September 23, 2015Algorithms

Appending a Linked List to Another

by RobinLeave a comment on Appending a Linked List to Another

[wpdm_package id=’1177′] Appending a linked list onto another is pretty easy. All you have to do is, make the last node’s next pointer of the…

Read More
Posted onSeptember 15, 2014September 23, 2015Algorithms

Removing Duplicates from a Sorted Linked List

by RobinLeave a comment on Removing Duplicates from a Sorted Linked List

[wpdm_package id=’1405′] Algorithm: [sourcecode lang=”cpp”] void RemoveDuplicates(intnode* head) { intnode* current = head; if (current == NULL) return; // do nothing if the list is…

Read More
Posted onSeptember 14, 2014September 23, 2015Algorithms

Decimal to Binary Conversion using Stack

by RobinLeave a comment on Decimal to Binary Conversion using Stack

[wpdm_package id=’1413′] We had discussed here a few applications of stack. And here is another one. Converting positive decimals to binary using a stack. You…

Read More
Posted onOctober 20, 2013September 23, 2015Algorithms

Check if two Trees are Structurally Similar

by RobinLeave a comment on Check if two Trees are Structurally Similar

[wpdm_package id=’1352′] Algorithm: Use Recursion. If both the trees are NULL, return true. If only one of the trees is NULL return false. Recursively find…

Read More
Posted onOctober 10, 2013September 23, 2015Algorithms

How to Delete a Tree

by RobinLeave a comment on How to Delete a Tree

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

Read More
Posted onOctober 9, 2013September 23, 2015Algorithms

Check if two Trees are Mirrors of each other

by RobinLeave a comment on Check if two Trees are Mirrors of each other

[wpdm_package id=’1359′] Algorithm: Return true if both the trees are empty. Return false if only one of the tree is empty. Return false if root…

Read More
Posted onOctober 7, 2013September 23, 2015Algorithms

Find the level with Maximum Sum in a Binary Tree

by RobinLeave a comment on Find the level with Maximum Sum in a Binary Tree

[wpdm_package id=’1361′] 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())…

Read More

Posts navigation

Page 1 Page 2 … Page 4 Next Page

Categories

  • Abroad Studies
  • Algorithms
  • Android
  • Bitwise Programming
  • Computer Graphics
  • Conference Paper
  • Data Structures
  • How to do?
  • Interview
  • Linux
  • Netcentric Programming
  • Networking
  • Open Source
  • Operating Systems
  • Parallel system Architecture
  • Technology
  • Uncategorized
  • Web Development

Archives

  • April 2020
  • May 2019
  • December 2016
  • November 2016
  • September 2016
  • August 2016
  • April 2015
  • September 2014
  • August 2014
  • April 2014
  • November 2013
  • October 2013
  • September 2013
  • August 2013
  • July 2013
  • June 2013
  • May 2013
  • April 2013
  • March 2013
  • February 2013

Recent Comments

  • priya on SAP Labs India hires me!!
  • robin on SAP Labs India hires me!!
  • robin on Simple Login Authentication Application with Session using JSP / JSTL
  • robin on SAP Labs India hires me!!
  • robin on SAP Labs Coding Interview Question 1
Amphibious Theme by TemplatePocket ⋅ Powered by WordPress