Write a function that converts an input string to uppercase. The argument to the function is a string. The function then returns the string in uppercase. Use your function in a main program where you ask the user to enter a string and then you output the string in uppercase. Do not use the strupr or toupper functions. You have to use a loop. Hint: Characters in C are stored as integers using the American Standard Code for information interchange ( ASCII). The lower case characters are given the integers 97 to 122 where ‘a’=97, ‘b’=98,… The uppercase characters are represented by the integers 65 to 95 where ‘A’=65, ‘B’=66…If you have the statement putchar (97) in your program, then the character ‘a’ is output on the screen. Since characters are integers, then it is possible to do some basic mathematics with them e.g’a’+ 2=99 which is equal to c

February 5, 2016

The Fibonacci series has the following form: 0, 1,1,2,3,5,8…. It can be solved recursively fib(n)=fib(n-1) + fib(n-2) i.e the nth fibonacci number is defined as shown b the above expression. Write a function using recursion that calculates the nth recursive number. For instance fib(3) = 1 i.e 1 + 0 and fib(4) = 2 i.e 1 + 1. Tip; The base case: fib(0)=0 and fib(1)=1. Use your function in a main program where you ask the user to a number n and then you output the nth Fibonacci number.

February 5, 2016

Consider this prolog program rainy(vancouver) rainy(sept_iles). snowy(x) :- rainy(x), cold(x) Draw the search tree for the query snowy(C) The search begins at snowy(C) and finds the rule snowy(X), which then becomes the goal, with C unified to X. Prolog must then establish both rainy(X) and cold (X). It establishes rainy (X) by finding rainy(vancouver), thus (temporarily) unifying X with vancouver. But then it must also find cold(vancouver). Because this fails, prolog backtracks and so it unifies rainy with sep tiles. Going back up the tree, it finds cold(sep tiles) and returns snowy(sept iles).

February 5, 2016

Describe the following with examples: i. Assignment-free language ii. Declarative languages (non procedural languages iii. A meta-circular iv. A self-interprete

February 5, 2016

There are many approaches to formal semantics which can be grouped to three major classes. Explain them as listed i. Denotational semantics ii. Operational semantics iii. Axiomatic semantics

February 5, 2016

Distinguish between the following set of terms: i. Semantics and syntax ii. Static semantics and dynamic semantics iii. Typed and untyped languages iv. Static versus dynamic typing v. Weak and strong typing

February 5, 2016

Event driven programming is widely used in graphical user interfaces. The design of the toolkits has been criticized for promoting an over-simplified model of event-action, leading programmers to create error 2 prone, difficult to extend and excessively complex application code. Such an approach is fertile ground for bugs for at least three reasons. Identify the reasons.

February 5, 2016

Giving examples differentiate between Linear and Tree Recursion.

February 5, 2016

Explain the benefits of functional programming

February 5, 2016

Giving examples where need, explains the following terms as used in programming paradigmi. Imperative programming ii. Functional programming iii. Structured programming iv. Event-based v. Declarative programming vi. Automat-based programming vii. Object oriented programming (OOP) viii. Recursion ix. A programming paradigm x. Programming language theory (PLT)

February 5, 2016

UniversityEssayServices.com

All papers are meant to be used in further research only and thus attribution must be provided.

We Accept: Visa, MasterCard, Debit/Credit cards

Plagiarism-free! Unique! On-time Delivery!

Follow Us:

Contact us:

© 2022 UniversityEssayServices.com. All rights reserved.