+1-316-444-1378

## NumberAnalysis

Write a program that simulates a lottery.     The program shall have an array of five integers named lottery and should generate a random number in the range of 0 through 9 for each element in the array.    The user shall enter five digits, which are stored in Read more…

## Level 1 Activity 5

For this activity, you will be creating a questionnaire (the list of questions used for a survey). The ASU PR team has asked you to create this questionnaire to evaluate an upcoming campaign they are planning. The overall goal of the campaign is to increase the number and dollar amount Read more…

## heap

Imagine a university wants to keep track of the following data about each student: First nameLast nameaddress line 1address line 2citystatezip codedate of birth monthdate of birth daydate of birth yearanticipated completion monthanticipated completion dayanticipated completion yeargpacredit hours completedIt is obvious that we will need a student class to contain Read more…

## Programming

Imagine a “black box” data structure you can push data into it and pop data out, but you cannot look at the implementation. Write a program to consider a series of push commands and expected pop values, then report on the nature of the black box structure. It might be:

## how the internet works website

The objective of this assignment is to get you familiarized with how the Internet works. You need to work individually for this assignment. You need to create a website (like one in the History of the Internet assignment) and explain some of the following topics: Domain names and ICANNIP Addresses, Read more…

## Subject Selection By Greedy Optimization

The Institute hired you to implement the program. They asked you to implement a greedy method (greedyAdvisor) to formulatea list of subjects that satisfies each students constraint (the amount of work student is willing to do).The algorithm should pick the best subjects first. The notion of best is determined by Read more…

## Prog1

The implementation of a simple but efficient randomized algorithmfor finding the ith order statistic, using divide and conquer.Definition 1. The ith order statistic of an array A of n numbers is (1) the ith smallest numberin A, if i n; or (2) not defined, otherwise.Note that the given array A Read more…