Explain about the String Abstract data type operations

Symbol ADT has no concatenation operations, but presuming we have a full-featured String ADT, symbols can be concatenated by converting them to strings, concatenating strings, then converting result back to a symbol. In the same way, String ADT operations can be used to do other manipulations. This explains why Symbol ADT has a rather odd mix of operations: Symbol ADT models the Symbol class in Ruby, and this class only has operations often used for Symbols, with most string operations appearing in String class.

 

Posted Date: 9/19/2013 5:13:55 AM | Location : United States

Ask an Expert

Related Discussions:- Explain about the string abstract data type operations, Assignment Help, Ask Question on Explain about the string abstract data type operations, Get Answer, Expert's Help, Explain about the string abstract data type operations Discussions

Write discussion on Explain about the string abstract data type operations
Your posts are moderated

Write your message here..

Related Questions

Prefix and Postfix Expressions, Q.   Draw the expression tree of the infix ... Q.   Draw the expression tree of the infix expression written below and then  convert it intoPrefix and Postfix expressions. ((a + b) + c * (d + e) + f )* (g + h )

Non-recursive implementation of binary tree traversals, As we have seen, as... As we have seen, as the traversal mechanisms were intrinsically recursive, the implementation was also easy through a recursive procedure. Though, in the case of a non-recursive me

How conquer technique can be applied to binary trees, How divide and conque... How divide and conquer technique can be applied to binary trees?  As the binary tree definition itself separates a binary tree into two smaller structures of the similar type,

Entity relationship diagram, This question is based on the requirements of ... This question is based on the requirements of a system to record band bookings at gigs. (A 'gig' is an event at which one or more bands are booked to play). You do not need to know

Trees, What is AVL Tree? Describe the method of Deletion of a node from and... What is AVL Tree? Describe the method of Deletion of a node from and AVL Tree ?

Array implementation of a queue, Since the stack is list of elements, the q... Since the stack is list of elements, the queue is also a list of elements. The stack & the queue differ just in the position where the elements may be added or deleted. Similar to

Draw a flowchart that takes temperatures input, Write an algorithm in form ... Write an algorithm in form of a flowchart that takes temperatures input over a 100 day period (once per day) and outputs the number of days when temperature was below 20C and numbe

Declaring a two dimensional array, Declaring a two dimensional array   A... Declaring a two dimensional array   A two dimensional array is declared same to the way we declare a one-dimensional array except that we state the number of elements in both di

Depth of complete binary tree, What will be depth do , of complete binary t... What will be depth do , of complete binary tree of n nodes, where nodes are labelled from 1 to n with root as node and last leaf node as node n

Algorithm for dfs, Step 1: Choose a vertex in the graph and make it the sou... Step 1: Choose a vertex in the graph and make it the source vertex & mark it visited. Step 2: Determine a vertex which is adjacent to the source vertex and begun a new search if