Recommended
Recommended
More Related Content
Similar to NameRESEARCHARGUMENTATION PAPERENGL 1301This will be you.docx
Similar to NameRESEARCHARGUMENTATION PAPERENGL 1301This will be you.docx (20)
More from roushhsiu
More from roushhsiu (20)
Recently uploaded
Recently uploaded (20)
NameRESEARCHARGUMENTATION PAPERENGL 1301This will be you.docx
- 1. Name: RESEARCH/ARGUMENTATION PAPER ENGL 1301 This will be your final process paper. You will submit an 800 words essay using MLA documentation. The paper should have a minimum of three in-text citation and work cited. All resources used must be appropriately documented. Topic: In this paper, you will frame for yourself a controversial topic. Then, you are required to take a position on your topic, frame a thesis, and write an argumentation paper with a minimum of 3 supporting evidence and at least two refutations on an opposing evidence. Prewriting process for Final Paper B. i.State your choice of controversial topic: _____________________________________________________ ____________ ii. Write a research question. _____________________________________________________ __________ iii. State your position on the topic. _____________________________________________________ __________ iv. Frame your thesis. The thesis must meet the element of agreeability, scope, public resonance, and revelation. Sample thesis development:
- 2. Topic: Banning Books in Schools Level 1: Simple Thesis: Topic + Opinion Banning books in schools should be discouraged. Level 2: Complex Thesis: Topic+ Opinion + Reasons (Main Premises) Banning books in schools should be discouraged because it limits students’ exposure, diminishes one’s freedom of choice, and deters controversial/free thinking. Level 3: Level 2 + meet the element of agreeability, scope, public resonance, and revelation. Even though we can all agree that not all books are suitable reading material for everyone, banning literary texts in American public schools may be detrimental to the mission of general education as it limits students reading exposure, freedom of choice, and free thinking. _____________________________________________________ ________ _____________________________________________________ _____________ _____________________________________________________ _____________ _____________________________________________________ _____________ v. List 3 reasons/arguments in support of your point of view and 2 opposing views/ antithesis. Reason/Argument 1: Topic + Reason 1 Evidence 1: “Use a quote” (Author’s last name pg. number). Warrant 1:
- 3. Reason/ Argument 2: Evidence 2: Warrant 2: Reason/Argument 3: Evidence 3: Warrant 3: Opposing Reason/Antithesis 1: Evidence 1: Refutation 1: Opposing Reason/Antithesis 2: Evidence 2: Refutation 2: C. State specific text/excerpts that you are intending to use in your essay. You may either paraphrase or quote the text, but be sure that the distinction is obvious. Please document this using the note cards in Noodle Tools. Also remember to have the author’s late name and page number cited in the parenthesis. Example: Quote Vance Smith claims, “Menopause is experienced by many women at a much younger age” (2). In Busting the Myths of Menopausal Age, the author states
- 4. “women go through menopausal symptoms as early as in their twenties” (Smith 2). Example: Paraphrase A recent article on women’s health suggest that many women undergo signs of menopause two decades earlier than what many would perceive as menopausal age (Smith 2). 1441 1fb9 1629 14e3 1f7b 1a2c 141a 20bd 1945 14b9 1fcb 1844
- 16. Push 2.5 Pop M0 Push 3.0 Push M0 Add Pop M1 Push M1 Push 1.0 Sub Pop M2 Push 3.14 Push M1 Mul Pop M3 Push M3 Push 2.0 Div
- 17. Pop M4 © Paul Koester, Dallas County Community College, 2018 COSC 2425 – Computer Organization Lab #4 – MARIE Program Create a MARIE assembly program which inputs two integers, X and Y, computes 3X + 4Y, and outputs the result. Requirements 1. The program must be written in MARIE Assembly Language. 2. It must use a subroutine to perform the multiplications. 3. You do not need to prompt for the input, just use the Input instruction. The user will need to know to enter X first and then Y. 4. Similarly no text is required with the output, just use the Output instruction. Hints 1. Lesson 4 has information on downloading the MARIE simulator. 2. Activity 4 will introduce you to MARIE.
- 18. 3. Example 4.5 in the textbook has an example of using a subroutine. It has one Parameter. You will need two for the multiply routine. Do that by adding another labelled memory location before the Subroutine label. 4. The subroutine will need to use a loop to perform the multiply. There is an example of a loop in Example 4.4. Upload: Your MARIE assembly file (.mas) Sample Output: When 4 and 6 are entered © Paul Koester, Dallas County Community College, 2018 COSC 2425 – Computer Organization Lab #6 – Virtual Memory Create a Java program which translates a virtual address to a physical address for a hypothetical computer. The input is a text file with a list of 16-bit virtual addresses in Hexadecimal. The output is a
- 19. text file with the corresponding physical addresses. Each page fault will also result in a message to the console. This computer is byte-addressable with 16-bit virtual addresses, 2KB of physical memory, and a 256 byte page size. It uses a FIFO page replacement policy. Requirements 1. The program must be written in Java. 2. It reads Hexidecimal address from the virtual.txt file and writes physical addresses to the physical.txt file. 3. When a page is not in physical memory. A page fault occurs. The program must display a message to the console indicating which page (if any) was swapped out of physical memory and which physical memory frame the new page was loaded into. 4. To implement the FIFO page replacement policy a queue is required. You may implement the queue yourself or use the one provided by the Java API. Hint: The UML Class diagram below describes one way to organize the program. Extra Credit (up to 10 points)
- 20. In addition to using the FIFO replacement policy, run the same data using an LRU policy. Calculate and display the hit ration for that. © Paul Koester, Dallas County Community College, 2018 Upload: Your Java source file (.java) Sample Output Last few lines of console output for provided virtual.txt Page Fault: Page 1f loaded in frame 4 replaces page 1e Page Fault: Page 17 loaded in frame 5 replaces page 14 Page Fault: Page 14 loaded in frame 6 replaces page 21 Page Fault: Page 21 loaded in frame 7 replaces page e Page Fault: Page 15 loaded in frame 0 replaces page 1d Page Fault: Page 13 loaded in frame 1 replaces page 11 Page Fault: Page 18 loaded in frame 2 replaces page 20 File physical.txt closed Hit ratio: 0.49047619047619045
- 21. © Paul Koester, Dallas County Community College, 2018 COSC 2425 – Computer Organization Lab #7 – Set Associative Cache Programs for embedded devices are often written in assembly language. Some embedded processors have limited instructions, like MARIE. Create a MARIE program which determines whether a given address is a cache hit or not. For this assignment, the cache is 2-way set associative, addresses are 8 bits, blocks are 8 bytes, and the cache has 8 blocks. Requirements 1. The program must be written in MARIE. 2. The input is a hex address (2 hex digits), the output is 1 for a cache hit and 0 for a cache miss. 3. The cache table is Set 0 1 5 Set 1 2 4 Set 2 3 2
- 22. Set 3 6 0 Tags 4. Unlike a real memory system, for this assignment, the cache table won’t change on a cache miss. Hints: 1. You have already written a multiply subroutine for MARIE. You could use a similar integer divide subroutine for this. It could return both a quotient and a remainder. 2. I recommend writing this in Java or C++ first to test your algorithm. Write the divide method using repeated subtraction as you will in MARIE. 3. The textbook describes the LoadI instruction, but the MARIE simulator does not recognize that. You can accomplish the same thing using Clear and AddI. Upload: Your MARIE source file (.mas) Sample Output Input: B5, Output: 0 Input: A5, Output: 1 Input: 6C, Output: 0
- 23. Input: 7D, Output: 0 Input: 8B, Output: 1 © Paul Koester, Dallas County Community College, 2018 COSC 2425 – Computer Organization Lab #3 – Moore Machine Create a Java program which implements this Moore machine. Requirements 1. The program must be written in Java. 2. It must request the initial state and the input. It displays the machine’s output and the final state, as in the example below. 3. The input is a string of zeros and ones only. 4. If the initial state or input is invalid, an error message is produced. The program may, but is not required to use Java exceptions in this case
- 24. 5. The program must implement the entire Moore machine, not just the inputs below. The instructor will test it with different input Hint: There are many different ways to do this, but consider using an array of state objects. One way is to declare this class, // This class represents one state in a Moore machine public class Moore { private char state; // The name of the state private String output; // The output displayed when this state is entered int zero; // The index of the next state given an input of 0 int one; // The index of the next state given an input of 1 // Public constructors and methods here Then in main you can create the array of states like Moore[] mooreStates = new Moore[5];
- 25. mooreStates[0] = new Moore(' ', "", 0, 0); mooreStates[1] = new Moore('A', "00 ", 2, 4); mooreStates[2] = new Moore('B', "01 ", 2, 3); mooreStates[3] = new Moore('C', "11 ", 4, 3); mooreStates[4] = new Moore('D', "10 ", 3, 1); Upload: Your Java (.java) file. Sample Output Please enter the initial State: D Please enter the input: 111 The output is: © Paul Koester, Dallas County Community College, 2018 10 00 10 00 The final State is: A Please enter the initial State:
- 26. A Please enter the input: 10010100 The output is: 00 10 11 10 00 01 11 10 11 The final State is: C © Paul Koester, Dallas County Community College, 2018 COSC 2425 – Computer Organization Lab #5 – Stack Machine Create a Java program which implements a simple stack machine. The machine has 6 instructions; Push operand Puts a value on the stack. The operand is either a floating point literal or one of 10 memory locations designated M0 – M9 Pop operand Pops the value on the top of the stack and moves it to the memory location M0-M9
- 27. Add Pops the top two values off the stack, performs the operation, then pushes the result on the Sub stack. Note that the value that was pushed first comes first in the operation. Sub works like this, Mul t2 = pop(), t1 = pop(), t3 = t1 – t2, push(t3). Div Requirements 1. The program must be written in Java. It may implement its own stack, or it may use the Java API Stack class. Only floating point values are stored on the stack and in memory. 2. The instructions are read from the machine.txt file. 3. In addition to moving a value from the stack to memory, the Pop operation must display a message on the console. 4. This program does not have to deal with error conditions like stack underflow or invalid input. 5. The program needs work for any valid input file. The instructor will test it with data that is different from this sample data.
- 28. Hints 1. Java’s Stack class works great for this. Google “Java stack class” for documentation and examples. 2. You can use the second character as an index into an array which holds your 10 memory locations., like this, Memory[str.charAt(1) - '0']. Upload: Your Java source file (.java) Sample machine.txt Push 2.5 Pop M0 Push 3.0 Push M0 Add Pop M1 Sample Output 2.5 Stored in location M0 5.5 Stored in location M1 4.5 Stored in location M2 17.27 Stored in location M3 8.635 Stored in location M4 © Paul Koester, Dallas County Community College, 2018
- 29. Push M1 Push 1.0 Sub Pop M2 Push 3.14 Push M1 Mul Pop M3 Push M3 Push 2.0 Div Pop M4 © Paul Koester, Dallas County Community College, 2018 COSC 2425 – Computer Organization Lab #2 – Hamming Code Attached to this assignment is a Java program that converts a text file to a list of hexadecimal numbers. Each of those hexidecimal numbers represents the bit pattern of a character from the file with the parity bits (even parity) for a hamming code inserted. Each text character
- 30. takes 8 bits and the hamming code adds 4 bits. This hamming code provides single-bit error correction. Requirements 1. The program must be written in Java. If you have not used Java before, you can learn it enough to do this assignment, by looking at the provided program. 2. You can use Eclipse to write, compile and test your program, but you may also use any other development environment you like. Only the .java file will be submitted. 3. The program will use the provided Hamming class. It will implement the decode function. The decode function is the reverse of the encode function, but it also performs single bit correction when necessary. 4. Display a message to the console when an error is corrected, as in the example below. 5. The main function must be rewritten to read hexidecimal numbers from hamming.txt file and write decoded and corrected text to output.txt.
- 31. 6. Test the program with different input files. The instructor will test it with a hamming.txt file different from the one provided. Hint: The Java hasNextInt(16) and nextInt(16) input functions are helpful in reading hexadecimal numbers from a file. Upload: Your Java (.java) file. Sample Output File hamming.txt opened Error in bit 9 corrected in character 2 Error in bit 3 corrected in character c Error in bit 10 corrected in character p File output.txt closed Note: In addition to the output shown above, the output of this program includes the decoded text written to output.txt.