Differentiate between different loops in form of table and write a same logic programe by using all loops, programe mentioned below:
Programe: Write a programe that input value and range from user,
Display multiplication table up to a given range by using For ,while and do-while loops.
Describe in details the source of satay and information
Write a program that asks the user to enter an account number as a string. The account number consists of 8
characters and is divided as follows:
The first 2 characters are digits and represent the branch (00 for Beirut, 01 for Saida, 02 for Tripoli).
The remaining 6 characters represent the customer’s account number
A valid account number consists of exactly 8 characters. If the account is valid, the program prints the details
(branch and account number). If the account is not valid, the program displays a message to the user.
Given list of students’ records. Write a program with signature as below:
Method Name: getStudentsWithMarksMoreThan()
Input: marks – Integer
Output: List of Students having marks more than input
Also add Unit Test case – both positive and negative.(Any high level language like – Java,
Python, PHP, C#, JavaScript)
Write and apply the partition procedure of Quick Sort algorithm to the following array. Show all the intermediate steps. 25 27 15 35 13 50 33 14 40 27
Solve the following recurrence relation using recurrence tree and iteration methods
T(n) = T(n-1) + n
Define the recurrence relation of the following function
f(n)
{
If ( n= = 1)
return 1
else
return f( n/3
) + f( n/3)
) + f(n/3)
) + 13
}
Create an applet which take a number as input and display whether it is prime number or not. Use appropriate components, layout and formatting in your program in JAVA.
Differentiate between different loops in form of table and write a same logic programe by using all loops, programe mentioned below:
Programe: Write a programe that input value and range from user,
Display multiplication table up to a given range by using For ,while and do-while loops.
The sorting technique where array to be sorted is partitioned again and again in such a way that all elements less than or equal to partitioning element appear before it and those which are greater appear after it, is called