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

Assignment Help:

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.

 

 


Related Discussions:- Elaborate the symbols of abstract data type

Algorithm, Describe different methods of developing algorithms with example...

Describe different methods of developing algorithms with examples.

Graph, Multilist Representation of graph

Multilist Representation of graph

Calculation of time complexity, Example: Assume the following of code: ...

Example: Assume the following of code: x = 4y + 3 z = z + 1 p = 1 As we have been seen, x, y, z and p are all scalar variables & the running time is constant irrespective

Algorithm, algorithm to search a node in linked list

algorithm to search a node in linked list

How to measure the algorithm efficiency, How to measure the algorithm's eff...

How to measure the algorithm's efficiency? It is logical to examine the algorithm's efficiency as a function of some parameter n showing the algorithm's input size. Instance

Binary search tree, Objectives The purpose of this project is to give yo...

Objectives The purpose of this project is to give you significant exposure to Binary Search Trees (BST), tree traversals, and recursive code. Background An arbitrary BST i

Explain b- tree, B- Tree  A B-tree of order m is an m-way true in which...

B- Tree  A B-tree of order m is an m-way true in which  1)  All leaves are on the similar level 2)  All internal nodes except the root have at most m-1(non-empty) childre

Kruskal algorithm for minimum spanning, Implementations of Kruskal's algori...

Implementations of Kruskal's algorithm for Minimum Spanning Tree. You are implementing Kruskal's algorithm here. Please implement the array-based Union-Find data structure.

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd