This is certainly an offbeat post from me. I wanted to give an option for users to save posts as text in another weblog, I’d find no plugin for this, so came up with one and sharing now with community. Description Post can be saved as text and can also be saved as html. Download Save Post as Text [...]

OpenAsthra introducing c, c++, programming, os, data structures quizzes http://quiz.openasthra.com/ (note: We didn’t not upload all of our quizzes, we put some samples for now, however framework is fully functional, we will upload soon) Please submit your quizzes to [openasthra AT gamil DOT com]) Assess Your C Skills is back You can use same authentication information (user [...]

Browse Man Pages : http://manpages.openasthra.com/ Search Man Pages : http://manpages.openasthra.com/search.php/

Here is algorithm for swapping two nodes in linked list.. //A complete swap algorithm which cares of //several scenarios while swapping two nodes in //a linked list which doesn't have any special nodes //scenarios considered while swapping //1)two nodes which are far away //2)two nodes which are far away, one is node is at // beginning of the list //3)two node which [...]

An AVL (adelson-velskii-landis) tree also known as balanced tree is a binary search tree with a balance condition. The balance condition is that for every node in the tree, the height of left and right subtrees can differ by at most 1. The condition ensures that the depth of the tree is O(log N). [...]

Welcome Welcome to the OpenAsthra QuestionPatterns. This exam contains 10 questions of which you’ll have to answer at least 7 correct to pass.Please do not use any back button while doing this testPlease press the button below to continue to the first question.

Here we are not going to discuss what binary trees are (please refer this, if you are looking for binary search trees), or their operations but printing them in ascii. The below routine prints tree in ascii for a given Tree representation which contains list of nodes, and node structure is this struct Tree { Tree [...]

A binary tree is a tree in which no node can have more than two children. The property that makes a binary tree into a binary search tree is that for every node, X, in the tree, the values of all the keys in its left subtree are smaller than the key value in X, [...]

Please refer Lesson 10.. 11. SOME INDIVIDUAL TOPICS 11.1 DOS Keyboard Characteristics 11.2 Detach Method for Wrapper Classes 11. SOME INDIVIDUAL TOPICS 11.1 DOS Keyboard Characteristics When any key on the keyboard is pressed, a parameter in the operating system is set, and this parameter can be checked through method [...]

Please refer Lesson 9.. 10. ANSI/ISO C++ STANDARD LANGUAGE ADDITIONS 10.1 bool 10.2 Four Casts 10.3 Namespace 10.4 Run-Time Type Information (RTTI) 10.5 Operator Keywords 10.6 explicit Constructor 10.7 mutable [...]