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

Explain stacks, What are stacks? A stack is a data structure that organ...

What are stacks? A stack is a data structure that organizes data similar to how one organizes a pile of coins. The new coin is always placed on the top and the oldest is on the

Difference in grounded header and circular header Link List, Q. State the d...

Q. State the difference between a grounded header link list and a circular header link list?     Ans: A header linked list is a linked list which all the time c

Data searching, In file access: what is the difference between serial, seq...

In file access: what is the difference between serial, sequential and indexed sequential searching

Algorithm, implement multiple stacks in a single dimensional array. write a...

implement multiple stacks in a single dimensional array. write algorithm for various stack operation for them

Hash table, Q. Make the 11 item hash table resulting from hashing the given...

Q. Make the 11 item hash table resulting from hashing the given keys: 12, 44, 13, 88, 23, 94, 11, 39, 20, 16 and 5 by making use of the hash function h(i) = (2i+5) mod 11.

Explain the linked list implementation of stack, Question 1 Explain the fo...

Question 1 Explain the following? Arrays Stack Trees Question 2 Explain the Linked list implementation of stack Question 3 What is a binary tree? Expla

space, What is Space complexity of an algorithm? Explain

What is Space complexity of an algorithm? Explain.

Threaded Binary Tree, If a node in a binary tree is not containing left or ...

If a node in a binary tree is not containing left or right child or it is a leaf node then that absence of child node can be represented by the null pointers. The space engaged by

Linked list, How to creat ATM project by using double linked list?

How to creat ATM project by using double linked list?

Create accessors for this data structure, Create a Money data structure tha...

Create a Money data structure that is made up of amount and currency. (a) Write a constructor for this data structure (b) Create accessors for this data structure (c) Writ

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