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

The quick sort algorithm exploit design technique, The quick sort algorithm... The quick sort algorithm exploit design technique Divide and Conquer

Infix expression to postfix form using the stack function, Q. Convert the f... Q. Convert the following given Infix expression to Postfix form using the stack function: x + y * z + ( p * q + r ) * s , Follow general precedence rule and suppose tha

What is a data structure, Question 1 What is a data structure? Discuss bri... Question 1 What is a data structure? Discuss briefly on types of data structures Question 2 Explain the insertion and deletion operation of linked list in detail Question

Explain backtracking, Explain Backtracking The  principal idea is to co... Explain Backtracking The  principal idea is to construct solutions single component  at a time  and evaluate such  partially constructed candidates as follows. If a partiall

Abstract type, define abstract type define abstract type

Implementation of queue by using a single linked list, Q. Perform implement... Q. Perform implementation of a queue using a singly linked list L. The operations INSER and DELETE should take O (1) time.

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

Time required to delete a node x from a doubly linked list, The time needed... The time needed to delete a node x from a doubly linked list having n nodes is O (1)

Files structures, The structures of files vary from operating system to ope... The structures of files vary from operating system to operating system. In this unit, we will discuss the fundamentals of file structures with the generic file organisations. A

Complexity of algorithm, The simplest implementation of the Dijkstra's algo... The simplest implementation of the Dijkstra's algorithm stores vertices of set Q into an ordinary linked list or array, and operation Extract-Min(Q) is just a linear search through