Virtual Lab 2: Matlab Online Module

Virtual Lab 2: Matlab Online Module

This is an online module for ENGG1811 on the topic of Matlab. Matlab is a numerical computing package commonly used by engineers. Some of the courses that you will do in the later years will be based on Matlab. Matlab and Python are similar in many aspects. You can use many concepts that you have learnt in Python (e.g. assignment, loops, conditional etc.) on Matlab. However, the syntax of Matlab and Python can be different sometimes and you need to pay attention to that. Read More

ENGG1811 Assignment 2: Simulation and Design of Biofuel Production

ENGG1811 Assignment 2: Simulation and Design of Biofuel Production

  • Due date: 11pm, Friday Sunday of Week-10 .
  • Late Penalty: Late submissions will be penalised at the rate of 10% per day (including weekends). The penalty applies to the maximum available mark. For example, if you submit 2 days late, maximum available marks is 80% of the assignment marks. Submissions will not be accepted after 11pm Tuesday of Week-11.

Read More

ENGG1811 Assignment 2: Simulation and Design of Biofuel Production

ENGG1811 Assignment 2: Simulation and Design of Biofuel Production (draft)

  • Due date: 11pm, Friday Sunday of Week-10 .
  • Late Penalty: Late submissions will be penalised at the rate of 10% per day (including weekends). The penalty applies to the maximum available mark. For example, if you submit 2 days late, maximum available marks is 80% of the assignment marks. Submissions will not be accepted after 11pm Tuesday of Week-11.
Change log :

  • 09pm Thursday 11 April: Deadline is now extended to 11pm Sunday (ealier it was Friday) of Week-10
  • 09pm Thursday 11 April: There was typo in the file "test_3.py" at line 82,
    replace ", best_alpha_b: " by ", best_alpha_p: ". The values printed were correct, just the message had typo!
    You can download the revised test_3.py (click right mouse and select “save as” or similar)

Read More

ENGG1811 Assignment 1: Pattern detection

ENGG1811 Assignment 1: Pattern detection
Due date: 5pm, Wednesday of Week-08 .
Late Penalty: Late submissions will be penalised at the rate of 10% per day (including weekends). The penalty applies to the maximum available mark. For example, if you submit 2 days late, maximum available marks is 80% of the assignment marks.
Submissions will not be accepted after 9am Monday of Week-09.

Read More

ENGG1811 Lab 13: Programming Practice

ENGG1811 Lab 13: Programming Practice

Summary

You will be working on some Python programming questions to give you some practice for the exam.

Note that the same set of questions will be used for all the lab session this week. If you seriously want to check how you are doing, then you should not ask your classmates, who have attended an earlier lab, what the questions are.

There is no online assessment this week. Read More

COMP2521: Assignment 2 Simple Search Engines

COMP2521: Assignment 2
Simple Search Engines

 

Change log:
  • [04:35pm 23/Oct] : Instructions on how to submit the assignment are now available, see “Submission”.
  • [01:50pm 23/Oct] : Just a reminder, as mentioned in the lecture and in the hints, you need to use BST to implement your inverted index in 1B. See hints on “How to Implement Ass2 (Part-1)” , as discussed in the lecture.
  • [01:50pm 23/Oct] : In 1C, as per the specs you need to “find page with one or more search terms and outputs (to stdout) top 30 pages in descending order of number of search terms found and then within each group, descending order of Weighted PageRank. The example for 1C is now appended to match with the sample data in 1B, to make it easy to understand.
  • [02:40pm 11/Oct] : Due date is changeed to “11:59:00 pm Thursday Week-13”, as discussed in the lecture.
  • [08:00am 11/Oct] : In 1.B, for the expected output, earlier “url101 was at the end (incorrectly), revised to ” mars url101 url25 url31 “
  • [08:00am 11/Oct] : In the 1.A algorithm, “iteration++;” is moved to the end of the loop body to improve readability

Objectives

Read More

ICT285 Databases S2 2018 Assignment 2

If you want to get this answer, please chat with us by the chat box or submit your requirement by the table below:

ICT285 Databases
S2 2018
Assignment 2
Worth: 20% of your final grade.
Due: Wednesday 31 October 2018 11:55PM
**note this is a short extension to the date in the Unit Information Guide**
Submit to: LMS, via the Assignments tool. Submit Parts 1 and 2, Part 3 sample data and Part 4 CREATE VIEW statements as a SINGLE Word document. Parts 3 and 4 should be completed in Oracle on arion. Ensure you complete the declaration that is part of the submission process. You do not need to include a separate cover sheet but you should include your name and student number as part of your document filename. Your name and student number should also be included within in the assignment document. Read More

COMP1511: Assignment 2 Card Game UNSW

ChangeLog

  • [02:55pm 18/Oct] : Instructions on how to test player.c updated, the required files are now available.
  • [01:50pm 17/Oct] : Instructions added on how to test your player.c. We are no longer going to run competitions, because they will not properly evaluate your player.c, to be discussed in the lecture.
  • [06:55am 10/Oct] : Sample file for a player “player_sample.c” (as discussed in the lecture) is now available.
  • [06:55am 10/Oct] : Sample testing file for “stage2” (as discussed in the lecture) is now available.
  • [07:55am 09/Oct] : See the revised list of functions (as discussed in the lecture) not available to player.c, added “getHandCard”, “playerCardCount” and “playerPoints”. The following comment added (as discussed in the lecture) to the functions that return “Card”
    // If no such card exists, the function returns NULL.
  • [07:45am 09/Oct] : Sample testing file for “stage1” is now available.
  • [02:45pm 03/Oct] : Mark breakdown chanegd to Game.c (50%) and testGame.c (20%).
  • [02:40pm 03/Oct] : Penalty of 3% of the marks awarded to you for this assignment will be applied for each missed submission (for weeks 10, 11 and 12).
  • [12:18pm 02/Oct] : one argument (Game) added to the functions getDeckCard, getDiscardPileCard and getHandCard in Game.h.
  • [07:30am 02/Oct] : Functions getDeckCard, getDiscardPileCard and getHandCard are added to Game.h, useful for testing (testGame.c).
  • [02:40pm 24/Sep] : FAQ added
  • [12:20pm 24/Sep] : Function getActiveDrawTwos is added to Game.h.
  • [12:40pm 22/Sep] : Function getTopDiscardTurnNumber is added to Game.h .
  • [06:30pm 21/Sep] : Clarifications for “first card in the discard pile at the start” added as list item 5 in the section “Playing the Game” .
  • [11:30am 21/Sep] : I have added more information and rephrased some text to improve clarity in the section “Playing the Game”.
  • [11:30am 21/Sep] : The following functions are added to Game.hgetNumberOfTwoCardsAtTop, getCurrentColor, getPreviousTurnPlayer. Read comments in the file Game.h for more details on these three functions .

Read More

ENGG1811 Lab11

If you want to check your answers, some of them are here.

Exercise 2: Determining which segments contain walking data using a (for or while) loop

Let us assume that you store the total acceleration in a vector called vec_acc_total. This vector has 49910 rows. (You may wish to check the size of the vector to confirm.) We will partition the elements in this vector into segments where each segment contains 60 elements. With this partition, we have:

  • Segment 1 contains elements 1 to 60
  • Segment 2 contains elements 61 to 120
  • Segment 3 contains elements 121 to 180, and so on

Read More

Registration

Forgotten Password?