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

Write a procedure that produces independent stack, Write a procedure (make-...

Write a procedure (make-stack) that produces independent stack objects, using a message-passing style, e.g. (define stack1 (make-stack))  (define stack2 (make-stack)) W

Make adjacency matrix for un-directed graph, Q. Describe the adjacency matr...

Q. Describe the adjacency matrix and make the same for the given undirected graph.    Ans: The representation of Adjacency Matrix: This representation consists of

Explain almost complete binary tree, Almost Complete Binary Tree :-A binary...

Almost Complete Binary Tree :-A binary tree of depth d is an almost whole binary tree if: 1.Any node and at level less than d-1 has two children. 2. for any node and in the tree wi

Train reorganising, A freight train from Melbourne is approaching Sydney, c...

A freight train from Melbourne is approaching Sydney, carrying n cars of cargos. The cargos are to be delivered to n different cities in the metropolitan area of Sydney - one car f

Program for linear search, Program for Linear Search. Program: Linear S...

Program for Linear Search. Program: Linear Search /*Program for Linear Search*/ /*Header Files*/ #include #include /*Global Variables*/ int search; int

Define dynamic programming, Define Dynamic Programming  Dynamic  progra...

Define Dynamic Programming  Dynamic  programming  is  a  method  for  solving  problems  with  overlapping  problems.  Typically, these sub problems arise from a recurrence rel

What is a linear array, What is a linear array? An array is a way to re...

What is a linear array? An array is a way to reference a series of memory locations using the similar name. Every memory location is shown by an array element. An  array elemen

Computational complexity, Generally, Computational complexity of algorithms...

Generally, Computational complexity of algorithms are referred to through space complexity (space needed for running program) and time complexity (time needed for running the progr

Computer arhitecture, The controversy of RISC versus CISC never ends. Suppo...

The controversy of RISC versus CISC never ends. Suppose that you represent an advocate for the RISC approach; write at least a one-page critic of the CISC approach showing its disa

Primitive data structure, Primitive Data Structure These are the basic ...

Primitive Data Structure These are the basic structure and are directly operated upon by the machine instructions. These in general have dissimilar representations on different

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