QUESTION 1 1.1 Study Text A called “Fears and Phobias”…

QUESTION 1 1.1 Study Text A called “Fears and Phobias”. What gives you the creeps or makes you scared? What gives you bad dreams at night?   Write a letter to a friend, telling them about a bad dream that you had one night: ·         Use the correct format of a Friendly Letter. ·         Remember to include an introduction, body and conclusion (3 paragraphs). ·         Each of your paragraphs must include at least two sentences and you must use good spelling, grammar and punctuation. ·         Type your letter in the answer box below. (20)

INSTRUCTIONS: 1.  Read the questions carefully.  2.  An…

INSTRUCTIONS: 1.  Read the questions carefully.  2.  Answer all of the questions. 3.  Remember to give answers worthy of the mark allocation. 4.  Write in full sentences where necessary and always check your spelling. 5.  No copying of any sources is allowed. All work submitted must be the student’s own, original work. 6.  Plagiarism will result in zero marks being awarded for the relevant. By writing this test, the student agrees to this condition. 7.  If you encounter any problems with the examination, PLEASE USE THE EXAM CONNECT BUTTON.  If this does not help, you must email support@teneoschool.co.za  DURING THE EXAMINATION in order to receive a valid ticket number. Queries without a unique ticket number, or emailed outside of the examination time, will not be considered valid. 8.  At the end of each paper, there is an extra blank question: an essay question, for any additional problems. 9.  All the best! 

Problem 5 (20 Points) Create the controller to implement the…

Problem 5 (20 Points) Create the controller to implement the pseudocode below using the provided datapath. The pseudocode finds the largest prime number less than or equal to n. The output should be 1 when n is equal to 0 or 1. Do not write VHDL and instead create the FSM in graphical form (i.e., state machine with corresponding operations in each state). Make sure to specify all operations and state transitions. Answer this on one of your scratch papers, label the question and submit it after the exam. // inputs: go, n// outputs: output, done// reset valuesdone = 0;while(1){    // wait for go to start the circuit    while(go == 0);    done = 0;    //Load your input into a register    tempLargestPrime = 1;    regN = n;    regI = 2;    //Find largest prime number

SECTION A: ESSAY WRITING QUESTION 1: DESCRIPTIVE ESSAY Th…

SECTION A: ESSAY WRITING QUESTION 1: DESCRIPTIVE ESSAY There are a lot of beautiful places in the world. You might have seen some of these beautiful places in reality, or even on TV. Use your descriptive skills to write a detailed DESCRIPTIVE ESSAY on the most beautiful place you have ever seen in reality, or on TV. Use your 5 senses and make sure your reader feels like they are there experiencing this beautiful place. Figurative language such as similes, metaphors, and personification may be useful for making your descriptions come alive. Your descriptive essay: must be a minimum of 140 words and a maximum of 150 words. (You will be allowed to go a few words over 150) must include a word count in square brackets at the end of your descriptive essay. Your word count will not be added towards your final mark. must be given a suitable title. must have a minimum of 4 paragraphs. must include an introduction, body, and conclusion Remember: to adhere to the 5 steps of the writing process (planning, drafting, revising, editing, final). to be creative and paint a picture with words.  you only have to type out and submit your final copy below. Click the button below to open up a picture that you can use as a guide when thinking of the most beautiful place you have ever seen. But you do not have to use these pictures provided.      PICTURE 1      

SECTION B: TRANSACTIONAL WRITING QUESTION 2: A FRIENDLY LETT…

SECTION B: TRANSACTIONAL WRITING QUESTION 2: A FRIENDLY LETTER Thank an everyday hero: Think about someone who inspires you. For example a parent, friend, nurse, teacher, or policeman (it is your choice – choose anyone who you look up to). Write a FRIENDLY LETTER to that person and address the following in your letter:  1.    Why have you chosen this person?2.    Why do you admire/appreciate them? Give some examples.3.    Thank them for whatever it is they do. Especially the things that you admire about them. Your friendly letter should: be about 80 – 100 words. (Remember that it is okay if you write a few more than 100 words, you will not be penalised if you slightly exceed the word count.) Your word count will not be added towards your final mark. consists of an INTRODUCTION, BODY, and CONCLUSION.   be structured by using paragraphs (minimum of 3 paragraphs). Remember: to make use of the writing process and ensure that you have checked your spelling, punctuation, and grammar many times before you are ready to submit. to stay on topic and lay your work out using the correct format for a friendly letter.      

Problem 2 (20 Points): Part 1: Create a VHDL type new_array…

Problem 2 (20 Points): Part 1: Create a VHDL type new_array for a one-dimensional unconstrained array where each element is 32 bit (std_logic_vector).  Part 2: Create a signal temp_array that is an instance of new_array with 100 total elements.  Part 3: If I wanted to output a clock with a 100 ns period, what ratio (scaling factor) would I use if I were using the on-board 50MHz clock? What would be the value of the counter that toggles the derived clock?

Problem 5 (20 Points) Create the controller to implement the…

Problem 5 (20 Points) Create the controller to implement the pseudocode below using the provided datapath. The pseudocode finds the largest prime number less than or equal to n. The output should be 1 when n is equal to 0 or 1. Do not write VHDL and instead create the FSM in graphical form (i.e., state machine with corresponding operations in each state). Make sure to specify all operations and state transitions. Answer this on one of your scratch papers, label the question and submit it after the exam. // inputs: go, n// outputs: output, done// reset valuesdone = 0;while(1){    // wait for go to start the circuit    while(go == 0);    done = 0;    //Load your input into a register    tempLargestPrime = 1;    regN = n;    regI = 2;    //Find largest prime number