IN PSEUDOCODE and C++

Program 1: Stay on the Screen! Animation in video games is just like animation in movies – it’s drawn image by image (called “frames”). Before the game can draw a frame, it needs to update the position of the objects based on their velocities (among other things). To do that is relatively simple: add the velocity to the position of the object each frame.

For this program, imagine we want to track an object and detect if it goes off the left or right side of the screen (that is, it’s X position is less than 0 and greater than the width of the screen, say, 100). Write a program that asks the user for the starting X and Y position of the object as well as the starting X and Y velocity, then prints out its position each frame until the object moves off of the screen. Design (pseudocode) and implement (source code) for this program.

Sample run 1:

Enter the starting X position: 50

Enter the starting Y position: 50

Enter the starting X velocity: 4.7

Enter the starting Y velocity: 2

X:50    Y:50

X:54.7 Y:52

X:59.4 Y:54

X:64.1 Y:56

X:68.8 Y:58

X:73.5 Y:60

X:78.2 Y:62

X:82.9 Y:64

X:87.6 Y:66

X:92.3 Y:68

X:97    Y:70

X:101.7 Y:72

Sample run 2:

Enter the starting X position: 20

Enter the starting Y position: 45

Enter the starting X velocity: -3.7

Enter the starting Y velocity: 11.2

X:20    Y:45

X:16.3 Y:56.2

X:12.6 Y:67.4

X:8.9   Y:78.6

X:5.2   Y:89.8

X:1.5   Y:101

X:-2.2 Y:112.2

JAVA PROGRAMMING ASSIGNMENT - MUST USE ARRAYLIST TO SOLVE. OUTPUT MUST BE EXACT SAME FORMAT AS SAMPLE OUTPUT.

In this assignment, you will create a program implementing the functionalities of a standard queue in a class called Queue3503. You will test the functionalities of the Queue3503 class from the main() method of the Main class. In a queue, first inserted items are removed first and the last items are removed at the end (imagine a line to buy tickets at a ticket counter).

The Queue3503 class will contain:

a. An int[] data filed named elements to store the int values in the queue.

b. An int data field named size that stores the number of elements in the queue.

c. A no-arg constructor that creates a Queue object with default capacity 0.

d. A constructor that takes an int argument representing the capacity of the queue.

e. A method with signature enqueue(int v) that adds the int element v into the queue.

f. A method with signature dequeue() that removes and returns the first element of the queue.

g. A method with signature empty() that returns true if the queue is empty. h. A method with signature getSize() that returns the size of the queue (return type is hence int)).

The queue class you develop should be tested using the following steps: (In other words, your program named Main will consist of the following)

a. Start your queue with an initial capacity of 8.

b. When the dequeue() method is called, an element from the queue at the beginning of the queue must be removed.

c. The main() method in your Main class should consist of statements to:

i. Create a queue object;

ii. Call enqueue() to insert twenty integers (taken from the user) into the queue.

iii. After the above task is completed, include a for-loop that will print out the contents of the queue.

d. After printing the queue filled with twenty integers, call dequeue() repeatedly to remove the beginning element of the queue.

e. Print the contents of the queue after removing every fifth number.

f. For your reference, the execution of the Main program is shown below. User inputs for populating the Queue is shown in the first line. Next, your program outputs are shown.

Sample Run

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

Initial content: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

After removing 5 elements: 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

After removing 5 elements: 11 12 13 14 15 16 17 18 19 20

After removing 5 elements: 16 17 18 19

(write a program that get the numbers from user and search the file numbers.text for that value. in C++)
numbers.txt:
10
23
43
5
12
23
9
8
10
1
16
9

you must to have the exact output:

Enter a number: 10
10 last appears in the file at position 9
Enter a number: 29
29 does not appear in the file
Enter a number: 9
9 last appears in the file at position 12
Enter a number:

Please, write code in c++. Using iostream library

Most modern text editors are able to give some statistics about the text they are editing. One nice statistic is the average word length in the text. A word is a maximal continuous sequence of letters ('a'-'z', 'A'-'Z'). Words can be separated by spaces, digits, and punctuation marks. The average word length is the sum of all the words' lengths divided by the total number of words.

For example, in the text "This is div2 easy problem". There are 5 words: "This"is"div"easy" and "problem". The sum of the word lengths is 4+2+3+4+7 = 20, so the average word length is 20/5 = 4.

Given a text, return the average word length in it. If there are no words in the text, return 0.0.

Input
The first line will contain the text of length between 0 and 50 characters inclusive. Text will contain only letters ('a'-'z', 'A'-'Z'), digits ('0'-'9'), spaces, and the following punctuation marks: ',', '.', '?', '!', '-'. The end of text will be marked with symbol '#' (see examples for clarification).

Output
Output should contain one number - the average length. The returned value must be accurate to within a relative or absolute value of 10^-9.

Samples:

Compare Google and Yahoo in the impact of data sharing and data privacy on on-line consumers in the U.S.

(100 words min )

Write a Scheme function that takes two integers and returns the list of all integer numbers between these two integers (inclusively) in increasing order. (numbers 10 20) (10 11 12 13 14 15 16 17 18 19 20)

Please explain every step.

C++, Need to create a code that will calculated the statistics for character input?

This is the prompt for the code. I truly understand nothing of what it's asking.

Ask the user for one character (terminated by a carriage return).Using flow control, classify the character into one of these categories:

1)           vowel

2)           consonant

3)           digit (0-9)

4)           other

Output the character input, its numeric decimal value, and the classification. Total up the number of each type of character entered. After the character is entered, ask the user if they want to continue (Y/N). When they enter N, you can stop prompting for more characters. Make sure to validate for Y or N data entry. Then display the total number of each type of characters entered.

For the following Paging configuration discuss what must be done to ensure a processes address space is not violated.
Process with five pages of 2048 words.

Find the bit length of a LAN if the data rate is 1 Gbps and the medium length in meters for a communication between two stations is 200 m. Assume the propagation speed in the medium is 2 *10^8 m/s.

Objectives

• To use selection statements
• To use repetition statement

Problem Specification

Skip by 7’s and 9’s

1. Generate n numbers between -100 and 100.

2. If the value is multiple of 7 or 9, replaced by *

3. Then change to new line after the multiple of 7 or 9 is appeared

Design Specification

• Use if
• Use if … else
• Use while

Example:

Given an IP address and mask of 192.168.0.0 /24 (address / mask), design an IP addressing scheme that satisfies the following requirements. Network address/mask and the number of hosts for Subnets A and B will be provided by your instructor.

The 0^th subnet is used. No subnet calculators may be used. All work must be shown on the other side of this page.

Host computers will use the first IP address in the subnet. The network router will use the LAST network host address. The switch will use the second to the last network host address.

Write down the IP address information for each device:

In java please, thank you :) For this assignment, you will continue your practice with dynamic structures. Specifically, you will be implementing a different version of a linked-list, called a Queue. Queues are very important and useful linear structures that are used in many applications. Follow the link below for a detailed description:

tutorialspoint - Queue (Links to an external site.)

The queue description above uses an array implementation for examples. As usual you will be not be using arrays, you will be using linked-lists. Specifically a singly-linked list.

Our job will be to implement the four basic queue methods which are enqueue(), dequeue(), peek() and isEmpty() as described in the tutorial mentioned above. You will not need to implement the isFull() method since we will be using linked-lists and linked-lists are theoretically never full.

For this assignment we will need to implement an uncommon version of enqueue(). In our version, if the element that is being processed is already in the queue then the element will not be enqueued and the equivalent element already in the queue will be placed at the end of the queue.

Additionally, you will be implementing a special kind of queue called a circular queue. A circular queue is a queue where the last position is connected back to the first position to make a circle. Therefore it does not have the traditional front and back data elements. It only has one data element, called rear that keeps track of the last element in the queue.

This structurally similar to a circular singly-linked list described here:

tutorialspoint - Circular Linked List (Links to an external site.)

The program's input will a single string that consists of single-character elements. You program will process each character in the string according the descriptions below. Where "->" signifies the front of the queue (blue designates input, red designates output):

• 'A' - 'Z': Puts the character on the queue.

  ABCD
  (nothing will be outputted)
  
  ABCDA* 
  B C D A

• '*': displays the elements of the queue separated by a space.

  ABCD*
  -> A B C D
  

• '$': prints the element at the front of the queue.

  ABCD$
  peek: A 
  

• '#': empties out the queue.

  ABCD#*
  -> 
  

• '!': deletes an element from the queue.

  ABCD!*
  -> B C D
  

• all other characters: prints an error message for each element, does not put the element in the queue and clears the queue.

  a
  The illegal character 'a' was encountered in the input stream. 

Programming Notes:

1. You can not delete any code in the Queue class.
2. If you need additional methods you must add them to the MyQueue class.
3. If you do not need any additional methods then you can delete the myQueue class.
4. You must use a singly-linked list with only a rear pointer.
5. Do not assume any maximum length for any input string.
6. You need not test for the null or empty string ("") cases.

Programming Rules:

1. You are not allowed to add any arrays or ArrayLists or any Java built-in (ADTs), such as Lists, Sets, Maps, Stacks, Queues, Deques, Trees, Graphs, Heaps, etc. Or add any class that inherits any of those ADTs.
2. For your node and list class you can use the code that was used in the book, video and lecture notes related to the node and lists class examples.
3. You are not allowed to use Java Generics.
4. If hard-coding detected in any part of your solution your score will be zero for the whole assignment.  

Please use started code:

import java.util.Scanner; // Import the Scanner class

public class Homework7 {
  
public static void main(String[] args) {
// place your solution here
}

}

class SLLNode {
  
public char data;
public SLLNode next;

public SLLNode(char c) {
data = c;
next = null;
}

}

class Queue {
  
public SLLNode rear;
  
public Queue() {
// place your solution here
}
  
public void enqueue(char c) {
// place your solution here
}
  
public SLLNode dequeue() {
// place your solution here
}
  
public char peek() {
// place your solution here
}
  
public boolean isEmpty() {
// place your solution here
}

}
  

    2.1) What is the kernel mode?

    2.2) What is the user mode?

    2.3) Which mode has more different instructions?

    2.4) Why do we need these two modes in designing an operating system?