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

Month: September 2013

Posted onSeptember 30, 2013September 23, 2015Algorithms

Insert into a Binary Tree

by RobinLeave a comment on Insert into a Binary Tree

[wpdm_package id=’1373′] Algorithm: Use the level order traversal or Breadth First Traversal. Insert the element where we find the left/right node as NULL. [sourcecode lang=”cpp”]…

Read More
Posted onSeptember 30, 2013September 23, 2015Algorithms

Checking if a String is Palindrome using Stacks

by RobinLeave a comment on Checking if a String is Palindrome using Stacks

[wpdm_package id=’1375′] Algorithm: Create a Stack. Till the half of the string length, push the characters of the string into the stack. If it is…

Read More
Posted onSeptember 30, 2013September 23, 2015Algorithms

Middle Element of Linked List

by RobinLeave a comment on Middle Element of Linked List

[wpdm_package id=’1377′] Algorithm – Keep two pointer c and m. Always move c pointer at twice the speed of m pointer. If the linked list…

Read More
Posted onSeptember 29, 2013September 23, 2015Algorithms

Breadth First Traversal of a Tree

by RobinLeave a comment on Breadth First Traversal of a Tree

[wpdm_package id=’1379′] Algorithm: visit the root. While traversing level l, keep all the elements at level l+1 in queue. Go to the next level and…

Read More
Posted onSeptember 29, 2013September 23, 2015Algorithms

Linked List Length Even or Odd

by RobinLeave a comment on Linked List Length Even or Odd

[wpdm_package id=’1386′] [wpdm_package id=’1390′] Algorithm Move the pointer 2 nodes at a time. If it points to a null node means Linked list is of…

Read More
Posted onSeptember 28, 2013September 23, 2015Algorithms

Print Linked List in Reverse order

by RobinLeave a comment on Print Linked List in Reverse order

[wpdm_package id=’1388′] [wpdm_package id=’1390′] [sourcecode lang=”cpp”] int Print_Reverse_LinkedList(intnode *c){ if(c==NULL) return 0; Print_Reverse_LinkedList(c->next); cout<<c->data<<"\t"; return 1; } [/sourcecode]

Read More
Posted onSeptember 24, 2013September 23, 2015Data Structures

Circulary Linked List

by RobinLeave a comment on Circulary Linked List

[wpdm_package id=’1410′] Inserting element at end: [sourcecode lang=”cpp”] void insertAtEnd(int d) { node *current=head; node *temp=new node(d); if(head==NULL) { head=temp; temp->next=temp; } else { for(;current->next!=head;current=current->next);…

Read More
Posted onSeptember 23, 2013April 8, 2015Interview

SAP Labs India hires me!!

by Robin20 Comments on SAP Labs India hires me!!

On September 21, 2013 Some of us attended placement process for SAP Labs India. First round was an on-line test conducted on a website. Online…

Read More
Posted onSeptember 23, 2013September 23, 2015Algorithms

Merge Two Sorted Linked Lists

by RobinLeave a comment on Merge Two Sorted Linked Lists

[wpdm_package id=’1398′] Algorithm: [sourcecode lang=”cpp”] node *MergeList(node *a,node *b) { node *result=NULL; if(a==NULL) return b; if(b==NULL) return a; if(a->data<=b->data) { result=a; result->next=MergeList(a->next,b); } else {…

Read More
Posted onSeptember 22, 2013September 23, 2015Algorithms

Efficient method for Finding Nth element from the end of a Linked List

by RobinLeave a comment on Efficient method for Finding Nth element from the end of a Linked List

[wpdm_package id=’1343′] [wpdm_package id=’1345′] Algorithm: Use 2 pointers ptr and newptr. Initially both points to head node of the list. Move ptr ‘n’ times. After…

Read More

Posts navigation

Page 1 Page 2 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