Showing posts with label Data Structure CPP. Show all posts
Showing posts with label Data Structure CPP. Show all posts

Wednesday, 11 March 2015

How to solve signal SIGSEGV segmentation fault in c++

                         SIGSEGV segmentation fault in c++

A segmentation fault occurs when a program attempts to access a memory location that it is not allowed to access, or attempts to access a memory location in a way that is not allowed (for example, attempting to write to a read-only location, or to overwrite part of the operating system).

Tuesday, 10 March 2015

Implementation of doubly linklist in c++

                 CREATION OF DOUBLY LINKEDLIST


In computer science, a doubly-linked list is a linked data structure that consists of a set of sequentially linked records called nodes. Each node contains two fields, called links, that are references to the previous and to the next node in the sequence of nodes. The beginning and ending nodes' previous and next links respectively, point to some kind of terminator, typically a sentinel node or null, to facilitate traversal of the list. If there is only one sentinel node, then the list is circularly linked via the sentinel node. It can be conceptualized as two singly linked lists formed from the same data items, but in opposite sequential orders.


Sunday, 8 March 2015

Stack implementation using array


Implementation of stack using array have methods 

push(),pop(),reverse() and display.


Impementation of stack using linked list in c++

/*

    Implementation of stack using linklist
    Methods included are:
    push();
    pop();
    reverse();
    display();
    topofstack();


@author: vikas bek
   
*/