Elaborate the symbols of abstract data type, Data Structure & Algorithms

Elaborate the symbols of abstract data type

length(a)-returns the number of characters in symbol a.

capitalize(a)-returns the symbol generated from a by making its first character uppercase and making its remaining characters lowercase.

downcase(a) -returns the symbol generated from a by making all characters in a lowercase.

upcase(a)-returns the symbol generated from a by making all characters in a uppercase.

swapcase(a)-returns the symbol generated from a by making all lowercase characters in a uppercase and all uppercase characters in a lowercase.

charAt(a,i)-returns the one character symbol consisting of the character of symbol a at index i (counting from 0); the result is undefined if  i is less than 0 or greater than or equal to the length of a., ignoring case, and returns -1 if a

length(a)-returns the number of characters in symbol a.

capitalize(a)-returns the symbol generated from a by making its first character uppercase and making its remaining characters lowercase.

downcase(a) -returns the symbol generated from a by making all characters in a lowercase.

upcase(a)-returns the symbol generated from a by making all characters in a uppercase.

swapcase(a)-returns the symbol generated from a by making all lowercase characters in a uppercase and all uppercase characters in a lowercase.

charAt(a,i)-returns the one character symbol consisting of the character of symbol a at index i (counting from 0); the result is undefined if  i is less than 0 or greater than or equal to the length of a.

 

charAt(a,i,c)-returns substring of symbol a beginning at index i (counting from 0), and continuing for c characters; result is undefined if i is less than 0 or greater than or equal to length of a, or if c is negative. If i+c is greater than the length of a, result is the suffix of symbol a beginning at index i.

succ(a)-returns the symbol which is the successor of symbol a. If a comprise characters or letters, successor of  a is found by incrementing the right-most letter or digit according to the Unicode collating sequence, carrying leftward if required when last digit or letter in collating sequence is encountered. If a has no letters or digits, then right-most character of a is incremented, with carries to the left as necessary.

toString(a)-returns a string whose characters correspond to the characters of symbol a.

toSymbol(a)-returns a symbol whose characters correspond to the characters of string a.

 

 

Posted Date: 9/19/2013 5:12:35 AM | Location : United States







Related Discussions:- Elaborate the symbols of abstract data type, Assignment Help, Ask Question on Elaborate the symbols of abstract data type, Get Answer, Expert's Help, Elaborate the symbols of abstract data type Discussions

Write discussion on Elaborate the symbols of abstract data type
Your posts are moderated
Related Questions
The location of a node in a binary search tree is defined as a string such as LLRRL, which represents the node that you find by starting at the root, and traversing Left, traverse

algorithm to search a node in linked list

Optimal solution to the problem given below. Obtain the initial solution by VAM Ware houses Stores Availibility I II III IV A 5 1 3 3 34 B 3 3 5 4 15 C 6 4 4 3 12 D 4 –1 4 2 19 Re

How many recursive calls are called by the naïve recursive algorithm for binomial coefficients, C(10, 5) and C(21, 12) C(n,k){c(n-1,k)+c(n-1,k-1) if 1 1 if k = n or k = 0

After learning this, you will be able to: understand the concept of algorithm; understand mathematical foundation underlying the analysis of algorithm; to understand se

List areutilized to maintainPOLYNOMIALS in the memory. For example, we have a functionf(x)= 7x 5 + 9x 4   - 6x³ + 3x². Figure depicts the representation of a Polynomial by means o

Q. Define the graph, adjacency matrix, adjacency list, hash function, adjacency matrix, sparse matrix, reachability matrix.

Define tractable and intractable problems Problems that can be solved in polynomial time are known as tractable problems, problems that cannot be solved in polynomial time are

Game trees An interesting application of trees is the playing of games such as tie-tac-toe, chess, nim, kalam, chess, go etc. We can picture the sequence of possible moves by m

What is the time complexity of Merge sort and Heap sort algorithms? Time complexity of merge sort is O(N log2 N) Time complexity of heap sort is   O(nlog2n)