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

Depth first search and breadth first search, Q. Illustrate the result of ru...

Q. Illustrate the result of running BFS and DFS on the directed graph given below using vertex 3 as source.  Show the status of the data structure used at each and every stage.

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

Dynamic memory management, How memory is freed using Boundary tag method in...

How memory is freed using Boundary tag method in the context of Dynamic memory management? Boundary Tag Method to free Memory To delete an arbitrary block from the free li

B-tree, Unlike a binary-tree, each node of a B-tree may have a number of ke...

Unlike a binary-tree, each node of a B-tree may have a number of keys and children. The keys are stored or saved in non-decreasing order. Each key has an related child that is the

Find the adjacency matrix, Consider the digraph G with three vertices P1,P2...

Consider the digraph G with three vertices P1,P2 and P3 and four directed edges, one each from P1 to P2, P1 to P3, P2 to P3 and P3 to P1. a. Sketch the digraph. b. Find the a

Hashing, explain collision resloving techniques in hasing

explain collision resloving techniques in hasing

Flowchart, conversion of centrigral to frahenhit

conversion of centrigral to frahenhit

Program insertion of a node into any circular linked list, Program Insertio...

Program Insertion of a node into any Circular Linked List Figure depicts a Circular linked list from which an element was deleted. ALGORITHM (Deletion of an element from a

Define approximating smooth surfaces with polygon nets, Approximating smoot...

Approximating smooth surfaces with Polygon nets Networks of polygons are used to represent smooth surfaces. They are, of course, only an approximation to the true surface, but

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