C++
 Computer >> Computer tutorials >  >> Programming >> C++

  1. Construct a Turing machine for L = {aibjck | i< j< k; i ≥ 1}

  2. Construct a Turing machine for L = {aibjck | i>j>k; k ≥ 1}

  3. Construct a Turing Machine for language L = {0n1n2n | n≥1}

  4. Construct a Turing Machine for language L = {ww | w ∈ {0,1}}

  5. Construct a Turing Machine for language L = {wwr | w ∈ {0, 1}}

  6. Construct BST from given preorder traversal - Set 1 in C++

  7. Construct BST from given preorder traversal - Set 2 in C++

  8. Construct BST from its given level order traversal in C++

  9. Convert a given Binary tree to a tree that holds Logical AND property on C++

  10. Convert a given Binary Tree to Doubly Linked List (Set 1) in C++

  11. Convert a given Binary Tree to Doubly Linked List (Set 2) in C++

  12. Convert a normal BST to Balanced BST in C++

  13. Convert a number into negative base representation in C++

  14. Convert a number m to n using minimum number of given operations in C++

  15. Convert a number of length N such that it contains any one digit at least 'K' times in C++

  16. Convert a sentence into its equivalent mobile numeric keypad sequence in C++

  17. Convert a String into a square matrix grid of characters in C++

  18. Convert a string to hexadecimal ASCII values in C++

  19. Convert a tree to forest of even nodes in C++

  20. Convert all lowercase characters to uppercase whose ASCII value is co-prime with k in C++
Total 5992 -Computer  FirstPage PreviousPage NextPage LastPage CurrentPage:116/300  20-Computer/Page Goto:1 110 111 112 113 114 115 116 117 118 119 120 121 122