COMS 4771 SP21 HW4 Due: Fri Apr 09, 2021 at 11:59pm This homework is to be done alone. No late homeworks are allowed. To receive credit, a type- setted copy of the homework pdf must be uploaded to Gradescope by the due date. You must show your work to receive full credit. Discussing possible solutions […]
COMS 4771 (SPRING 2021) EXAM 2 APRIL 16, 2021 Name & UNI: Instructions • You have a 24 hour period (from Friday April 16, 2021 00:01 AM EDT to Friday April 16, 2021 11:59 PM EDT) to take this exam. You may open the exam at any time in this 24 hour period, but as
COMS 4771 Exam 2.pdf Read More »
COMS 4771 (Fall 2017) Final Exam December 07, 2017 Name & UNI: 1. (15 points) State True or False. No justification needed! Please show all your work! Answers without supporting work will not be given credit. Write your answers in spaces provided. There are total 13 pages including two blank pages at the end for
COMS 4771 (Fall 2017) Final Exam December 07, 2017 Read More »
Task #1 (5%): To make informed recommendations, you are required to first select a group of stocks (at least ten stocks) from Yahoo! Finance API. You are required to justify your selections. For example, a scenario could be that you are interested in newly listed companies and their performance in the market. As a result,
Your task is to design and implement a circuit in hdl which takes two 2-bit numbers as input and produces a 3-bit output. The circuit has 6 inputs (fi. fo, A, B, C, D) and 3 outputs (E, F, G). The function of the circuit is determined by two of the inputs fi and fo.
// Implementation of the Map ADT #include #include #include #include #include #include “Map.h” struct map { * Creates a new map with the given number of cities * Assumes that `numCities` is positive Map MapNew(int numCities) { return NULL; * Frees all memory allocated to the given map void MapFree(Map m) { * Returns the
// COMP2521 23T2 Assignment 1 #ifndef MSET_STRUCTS_H #define MSET_STRUCTS_H // DO NOT CHANGE THE NAME OF THIS STRUCT struct node { int item; // DO NOT CHANGE/REMOVE THIS FIELD int count; // DO NOT CHANGE/REMOVE THIS FIELD struct node *left; // DO NOT CHANGE/REMOVE THIS FIELD struct node *right; // DO NOT CHANGE/REMOVE THIS FIELD
COMP2521 23T2 Assignment 1 Read More »
// Implementation of the Multiset ADT using a balanced BST // COMP2521 23T2 Assignment 1 #include #include #include #include #include “Mset.h” #include “MsetStructs.h” //////////////////////////////////////////////////////////////////////// // Basic Operations * Creates a new empty mset Mset MsetNew(void) { return NULL; * Frees all memory allocated to the given mset void MsetFree(Mset s) { * Inserts one of
COMP2521 23T2 Assignment 1 Read More »
// Main program for testing the Map ADT #include #include #include #include #include “Map.h” void testSetName(void); void testInsertRoad(void); void testGetRoadsFrom(void); int main(int argc, char *argv[]) { testSetName(); testInsertRoad(); testGetRoadsFrom(); void testSetName(void) { Map m = MapNew(5); char name1[] = “sydney”; assert(strcmp(MapGetName(m, 0), “unnamed”) == 0); MapSetName(m, 0, name1); // Overwriting the name1 string with something
Assignment 1 Efficient Multiset ADT All important changes to the assignment specification and files will be listed here. [20/06 09:00] Assignment released [20/06 14:05] Added the definition of struct cursor to MsetStructs.h and fixed a typo in testMset.c [21/06 23:05] Added some clarifications about the expected behaviour of MsetCursorNext and MsetCursorPrev To implement a multiset
COMP2521 23T2 Assignment 1 Read More »