Compare and Contrast Mobile Device Management (MDM) and Mobile Application Management (MAM) tools.
In: Computer Science
Activity 1: Answer the following. 1. What are the benefits of VoIP? 2. How the voice is digitized and packetized? 3. What is conversation traffic and control traffic? 4. What are the components of IP Telephony system? 5. Brief on voice compression and coding techniques.
In: Computer Science
java code
In: Computer Science
Objective:
Create a program that uses the methods in the String and Math classes to do the following:
In: Computer Science
Convert these machine codes to MIPS instructions:
Ox29210003, and Ox8e460002
In: Computer Science
Objective:
Create a program that displays a design or picture for someone in your quarantine household/group: a pet, a parent, a sibling, a friend. Make them a picture using the tools in TurtleGraphics and run your program to share it with them!
Use a pen object, as well as any of the shape class objects to help you create your design. You must use and draw at least 5 shape objects.
You must use a minimum of 4 different colors in your design.
You must pick up the pen at least once in your code.
You mut put down the pen at least once in your code.
In: Computer Science
Is there a shortcut or simpler way to get the same output in C ?
#include <stdio.h>
#include <time.h>
#include <stdlib.h>
#define OFFSET 1
#define RANGE 53
int RandomInteger(int, int);
int PrintInstructions();
int main()
{
//six integer variables
int a, b, c, d, e, f;
//one integer for num of sets
int numSets;
srand(time(NULL));
while (1)
{
int i;
numSets = PrintInstructions();
if (numSets == 0)
{
printf("* You have choosen to exit the application.\n");
break;
}
for (i = 1; i <= numSets; i++)
{
a = RandomInteger(RANGE, OFFSET);
do
{
b = RandomInteger(RANGE, OFFSET);
} while (b == a);
do
{
c = RandomInteger(RANGE, OFFSET);
} while (c == a || c == b);
do
{
d = RandomInteger(RANGE, OFFSET);
} while (d == a || d == b || d == c);
do
{
e = RandomInteger(RANGE, OFFSET);
} while (e == a || e == b || e == c || e == d);
do
{
f = RandomInteger(RANGE, OFFSET);
} while (f == a || f == b || f == c || f == d || f == e);
printf("* Set # %d of six numbers is: %d %d %d %d %d %d\n", i, a, b, c, d, e, f);
}
}
return 0;
}
int RandomInteger(int range, int offset)
{
int randomNum = rand() % RANGE + OFFSET;
return randomNum;
}
int PrintInstructions()
{
int numSets = 0;
printf("*************************************************************************\n");
printf(" Enter in the number of randomly generated sets of numbers you want or \n");
printf(" enter in a 'q' or 'Q' to quit. \n");
printf("*************************************************************************\n");
printf("* Your Input: ");
scanf("%d", &numSets);
return numSets;
}
In: Computer Science
Discover classes for generating a student report card that lists all classes, grades, and the grade point average
for a semester. Create a UML diagram with constructors and methods. Implement the code including Javadoc comments.
In: Computer Science
Does the MAC address change or is it associated with a specific network interface? Is there a possibility where two hosts can have the same MAC address or is it globally unique? What about IP addresses, can a host have one set/unique IP address or does it change?
In: Computer Science
Problem Description
Tree cutting service providers are incredibly important for homeowners. Responsible for removal of unwanted trees. They additionally help property owners weekly,monthly and annual maintenance, including trimming and pruning. They will remove roots, stumps, fallen tree branches and entire trees. They are knowledgeable about local codes and regulations helping property owners to maintain operations legally. The problem is sometimes cutting a tree can damage the other trees which we don't want to cut.
It is recommended that the new system has a mobile application which can help in cutting unwanted trees properly without damaging the other trees by getting basic information regarding the tree's location.
System Capabilities
The new system should be capable of:
Collecting information of an area having trees to be cut down
Information about total number of trees on this particular area
Collecting the information about all trees regarding their height, width and measurement of fence around them if any.
Showing the nearby trees by using graphics.
After calculations,showing the number of trees can be cut without damaging the other trees and fence if any.
Showing the direction of where the tree falls after cutting.
Functioning as stand-alone without connection.
Customers can communicate and order your services through this system.
Business Benefits
It will be time saving system and easy to maintain
Accurate trees cutting without damaging other trees
Maintaining good relation with customers,easy communication
You can easily advertise and marketing about your tree cutting services
Main functional requirements
1.Audit Tracking
2.External Interfaces
3.Historical Data Management
4.Authorization Levels
5.Reporting Requirement
6.Admistrative function
Vendor Solutions
Both services have a way to schedule appointments with their customers. Rouge Tree service provides it through a scheduling tool while A Cut Above Tree Services only a number to call. They both allow some way to contact them if there is a problem with the service. Both service providers provide information and how it is done on their websites also.
Strengths
The ability to report any issues in an online forum allows your voice to be heard and for the company to address any issues that may have occurred.
Being able to provide information on what the type of service is being done will allow the customers to better understand what is going to be happening.
Weaknesses
The online forum may take a while for them to respond to you depending on their volume.
Main non-functional Requirements
Types of non functional requirement are Scalabitily, Capacity,Availability,Reliability,Recoverability etc.
(DISADVANTAGE)It may affect the various high level software subsystem
(ADVANTAGE)It helps you to ensure good user's experience and easy of operating the software
ISSUES
Putting in unjustified extra information that may confuse developer
Not putting sufficient details in the requirement document
You add rules or examples scoping statement or objective anything accepts the requirement itself
Requirements which are not mapped to an objective or principle.
Lab 3:
User Roles
Employee
Operates equipment
Communicates with customer and Manager
Manager
Updates information in the system
Produces history report of sales
Assigns employees to provide tree cutting service
Customer
Searches for tree cutting services
Provides information on what they want done
Views overall ratings and provides feedback of the service provided.
Part 2:
Identified noun |
Notes |
Customer |
Lots of details required |
Service Provided |
We know what service is being done. |
Summary Report |
Data of what service was done |
Geographical Data |
Data that is needed of the area. Needs more research |
Pricing |
Pricing based on the type of job |
Change request |
Remembering changes to the service that is being done. |
Part 3:
Part 4:
Using the information above and internet knowledge answer the following:
Part 1
Identify three user roles/personas for your business.
At least one persona should be an internal user (administrator,
employee etc.)
For each user persona identify the main use cases (use the user
goal technique)
Part 2
Identify the things in the problem domain by using the noun
technique.
Create a table of the identified nouns and the Notes on including
noun as a thing to store.
Part 3
Create domain model class diagram.
Part 4.
Verify use cases using the CRUD analysis
In: Computer Science
Consider this code snippet:
if (x < 512) {
y = 73;
} else {
y = 42;
}
Which of these goto-style code snippets is equivalent to that if/else code?
Consider this code snippet:
if (x < 512) {
y = 73;
} else {
y = 42;
}
Which of these goto-style code snippets is equivalent to that if/else code?
a.
if (x >= 512) goto Label1;
y = 73;
goto Label2;
Label1:
y = 42;
Label2:
b.
if (x < 512) goto Label1;
y = 73;
goto Label2;
Label1:
y = 42;
Label2:
c.
if (x < 512) goto Label1;
Label1:
y = 42;
goto Label3;
Label2:
y = 73;
goto Label3;
Label3:
d.
if (x < 512) goto Label1;
Label1:
y = 73;
goto Label2;
y = 42;
Label2:
In: Computer Science
Implement the recursive LU factorization algorithm in Python. Use plenty of
comments to explain your code. While you are coding, it is helpful to break up your code into sub-functions and test the sub-functions as you go along.
In: Computer Science
In: Computer Science
I will be creating a simulation of the reception of a bank in C++ (based off the requirements listed below). I plan to develop a test plan that I will use to make sure the key requirements are all covered by a test case.
*I just need help defining how each of the requirements below can be tested. I can use a numbering system to map each requirement to the appropriate test case(s). High level information would be appreciated. I can elaborate on the details. I just need assistance identifying how I can test the requirements below.
Requirements for my simulation are as follows:
In: Computer Science
NEed UML diagram for this java code:
import java.util.ArrayList; import java.util.Scanner; class ToDoList { private ArrayList<Task> list;//make private array public ToDoList() { //this keyword refers to the current object in a method or constructor this.list = new ArrayList<>(); } public Task[] getSortedList() { Task[] sortedList = new Task[this.list.size()];//.size: gives he number of elements contained in the array //fills array with given values by using a for loop for (int i = 0; i < this.list.size(); i++) { sortedList[i] = this.list.get(i); } //sorting values in array using bubble sort Task temp;//temp var to hold sorted values for (int i = 0; i < sortedList.length; i++) { for (int j = 1; j < (sortedList.length - i); j++) { if (sortedList[j].isEarlier(sortedList[j - 1])) { temp = sortedList[j - 1]; sortedList[j - 1] = sortedList[j]; sortedList[j] = temp; } } } return sortedList; }//end of getSortedList public void addTask(Task task) { this.list.add(task);//.add to add elements in the list } public void deleteTask(int taskID) { //delete tasks using task ID for (int i = 0; i < this.list.size(); i++) { if (this.list.get(i).getTaskID() == taskID) { this.list.remove(i); } } } public void deleteAllTasks() { this.list.clear(); } public int getTaskNumber() { return this.list.size(); } public void printList(Task[] tasks) { System.out.println("-------------------------"); for (Task task : tasks) { task.printTask(); } System.out.println("-------------------------"); } public static void displayMenu() { System.out.println("1)Add tasks"); System.out.println("2)List tasks"); System.out.println("3)Delete Tasks"); System.out.println("4)Delete all tasks"); System.out.println("5)Exit"); } public static void main(String[] args) { Scanner in = new Scanner(System.in); ToDoList toDoList = new ToDoList(); boolean run = true; while (run) {//will continue to loop until user chooses a valid option displayMenu(); int choice = in.nextInt(); switch (choice) { //nextLine() method advances this scanner past the current line and returns the input that was skipped case 1: in.nextLine(); System.out.print("Task Name: "); String taskTitle = in.nextLine(); System.out.print("Task Deadline (dd mm yyyy): "); int taskDay = in.nextInt(); int taskMonth = in.nextInt(); int taskYear = in.nextInt(); in.nextLine(); System.out.print("Time Deadline (hh mm): "); int taskHour = in.nextInt(); int taskMin = in.nextInt(); in.nextLine(); System.out.print("Is task Regular or Important?: "); String taskImportant = in.nextLine(); //Task ID made with all info set up neatly Task newTask = new Task(new Time(taskHour, taskMin), new Date(taskDay, taskMonth, taskYear), taskTitle, taskImportant, toDoList.getTaskNumber() + 1); //Adds the new task to the list toDoList.addTask(newTask); //Display the sorted tasks System.out.printf("Task %d is added. The To-Do list is as follows:\n", newTask.getTaskID()); toDoList.printList(toDoList.getSortedList()); break; case 2: //List all tasks toDoList.printList(toDoList.getSortedList()); break; case 3: //Delete a task toDoList.printList(toDoList.getSortedList()); in.nextLine(); System.out.print("Enter ID number to delete task: "); int taskID = in.nextInt(); toDoList.deleteTask(taskID); System.out.printf("\nTask %d is deleted. The new list is:\n", taskID); toDoList.printList(toDoList.getSortedList()); break; case 4: //Delete all tasks toDoList.deleteAllTasks(); System.out.println("Tasks Deleted"); break; case 5: //Exit program System.out.println("Exiting program, goodbye."); run = false; break; } } } } class Date { private int day; private int month; private int year; //Default constructor for date, public Date() { this(0, 0, 0); } public Date(int day, int month, int year) { this.day = day; this.month = month; this.year = year; } //accessors and mutators public int getDay() { return this.day; } public int getMonth() { return this.month; } public int getYear() { return this.year; } public void setDay(int day) { this.day = day; } public void setMonth(int month) { this.month = month; } public void setYear(int year) { this.year = year; } public String toString() { return String.format("%d/%d/%d", this.day, this.month, this.year); } //Returns whether this date is earlier than another date provided as parameter. If they are the same, returns false public boolean isEarlier(Date date) { //If the years are the same, narrow the comparison down the months if (this.year == date.year) { //Repeat the same thing as years, but narrowed down for months if (this.month == date.month) { if (this.day == date.day) { //Returns false because if they are the same date, then one is not earlier than the other return false; } else if (this.day < date.day) { return true; } else { return false; } } else if (this.month < date.month) { return true; } else { return false; } } else if (this.year < date.year) { return true; } else { return false; } } } class Time { private int hour; private int min; //Default constructor for time public Time() { this(0, 0); } public Time(int hour, int min) { this.hour = hour; this.min = min; } //Accessors and mutator methods for hour and min attributes public int getHour() { return this.hour; } public int getMin() { return this.min; } public void setHour(int hour) { this.hour = hour; } public void setMin(int min) { this.min = min; } //Returns time in HH:MM format public String toString() { return String.format("%d:%d", this.hour, this.min); } //Returns whether or not this time is earlier than the time provided as a parameter. Returns false if both same public boolean isEarlier(Time time) { //If they are the same hour, narrow the comparison down to the minute if (this.hour == time.hour) { //Exact same process, but for min if (this.min == time.min) { //Returns false because if they're the same time, one is not earlier than the other return false; } else if (this.min < time.min) { return true; } else { return false; } //If this hour is less than the other hour, it is earlier, so return true } else if (this.hour < time.hour) { return true; //Otherwise, the time isn't earlier } else { return false; } } } class Task { private Time time; private Date date; private String title; private String Important; private int taskID; //Default constructor leaves attributes blank public Task() { this(null, null, null, null, 0); } public Task(Time time, Date date, String title, String Important, int taskID) { this.time = time; this.date = date; this.title = title; this.Important = Important; this.taskID = taskID; } //accessors and mutators for time, date, title, Important, and taskID public Time getTime() { return this.time; } public Date getDate() { return this.date; } public String getTitle() { return this.title; } public String getImportant() { return this.Important; } public int getTaskID() { return this.taskID; } public void setTime(Time time) { this.time = time; } public void setDate(Date date) { this.date = date; } public void setTitle(String title) { this.title = title; } public void setImportant(String Important) { this.Important = Important; } //Prints task date public void printTask() { System.out.printf("* Task %d: %s, %s, %s, %s\n", this.taskID, "title: ", this.title, this.date.toString(), this.time.toString(), this.Important); } //Returns true if this task is earlier than task provided as parameter. public boolean isEarlier(Task task) { //If the other task's date is earlier than this task's date, it must be earlier if (this.date.isEarlier(task.getDate())) { return true; //However, if the dates are the same, narrow the check down to the tasks' times } else if (!this.date.isEarlier(task.getDate()) && !task.getDate().isEarlier(this.date)) { return this.time.isEarlier(task.time); } return false; } }
In: Computer Science