homeworkdave

[homeworkdave]

ECE357:Computer Operating Systems PS 7

ECE357:Computer Operating Systems PS 7

ECE357:Computer Operating Systems PS 7 Problem 1 — Short Answer 1A) A user mode process attempts to makeasystem call with the system call number set to -1. Refer to the X86-32 entry.S code in the lecture notes and explain what happens. 1B) After a system call is completed and the kernel returns control to the user-level process which invoked the system call, how does the user/supervisor privilege…

[homeworkdave]

Computer Operating Systems PS 6

Computer Operating Systems PS 6

ECE357:Computer Operating Systems PS 6 Problem 1 — Short Answer The following pseudo-code represents an attempt to enforce mutual exclusion in a critical region void f() { /* DISABLE_INTERRUPTS is a generic name for an assembly-level instruction that saves the current hardware interrupt mask and disables all interrupts */ existing_mask=DISABLE_INTERRUPTS; /* Perform critical region operation…

[homeworkdave]

ECE357:Computer Operating Systems PS 5

ECE357:Computer Operating Systems PS 5

ECE357:Computer Operating Systems PS 5 Problem 1 — Pag e Tables We envision a semi-hypothetical computer architecture (it is just an idealization of the actual X86-32 bit) with the following description of its page table structure (this is essentially identical to what is presented in lecture notes): 1) 32 bit virtual and physical addresses with 4K pages, 2-level page table structure split 10/10…

[homeworkdave]

ECE357:Computer Operating Systems PS 4

ECE357:Computer Operating Systems PS 4

ECE357:Computer Operating Systems PS 4 Problem 1 — Q&A 1A) What key sequence would you use to cause a foreground process to terminate and dump core (if possible)? 1B) When would a signal SIGTTOU be sent to a process? What happens to the process when it receives it (assuming that this signal’s disposition is default)? 1C) Process “A” sends (using the kill system call) signal #40 to process “B”. It…

[homeworkdave]

ECE357:Computer Operating Systems PS 3

ECE357:Computer Operating Systems PS 3

ECE357:Computer Operating Systems PS 3 Problem 1 — Short Answers Examine the following program: main() { int ws= -1; f1(); if (fork()==0) f1(); f1(); wait(&ws); return (ws>>8)&255; } void f1() { static int i=10; printf(“%d\n”,i); i++; } 1A) In which memory region would we find the variable i ? 1B) You can certainly run this program and see what it prints out. Explain why are there 4 lines of…

[homeworkdave]

ECE357:Computer Operating Systems PS 2

ECE357:Computer Operating Systems PS 2

ECE357:Computer Operating Systems PS 2 Problem 1 — File allocation The following diagram depicts part of the information contained inside an inode which represents an ordinary file. Specifically, it shows the block allocation area of the inode and the size. Also shown is one data block which is being used as an indirect block. This is a Linux EXT3 filesystem and block sizes are the default 4K.…

[homeworkdave]

ECE357:Computer Operating Systems PS 1

ECE357:Computer Operating Systems PS 1

ECE357:Computer Operating Systems PS 1/ Problem 1 — What is kernel mode / what is user mode? Explain for each of the following items whether they can be accomplished entirely within user mode, or require a system call? If the latter, identify what system call or calls would be used. a) getting input from the keyboard b) allocating memory via malloc (trick question) c) calling a function d)…

[homeworkdave]

Assignment #2 Create a class called "heap"

Assignment #2 Create a class called “heap”

Data Structures and Algorithms II Programming Assignment #2 You are going to create a class called “heap” that provides programmers with the functionality of a priority queue using a binary heap implementation. Each item inserted into the binary heap will specify a unique string id, an integer key, and optionally any pointer. The implementation of the class should use pointers to void in order to…

[homeworkdave]

Assignment #2 program that sorts the nodes of a linked list

Assignment #2 program that sorts the nodes of a linked list

Data Structures and Algorithms I Programming Assignment #2 You are going to complete a program that sorts the nodes of a linked list. The program will load data from an input file specified by the user and create a linked list of pointers to data objects using the provided C++ list class. Each data object will consist of four fields. The first two fields will be unsigned 32-bit integers (but…

[homeworkdave]

Assignment 6 CISC 220

Assignment 6 CISC 220

Bonus Assignment Assignment 6 CISC 220 Administrative Notes: This assignment is a bonus assignment. You will not lose marks toward the 100 marks of the course if you do not do it. Conversely, if you do it correct, you will gain as much as any other assignment weight in top of what you get out of the 100 total marks of the course marking. All of the administrative notes from previous assignments…

[homeworkdave]

Assignment #4- 1998 regional ACM Programming Contest

Assignment #4- 1998 regional ACM Programming Contest

Data Structures and Algorithms II Programming Assignment #4 This problem came from the 1998 regional ACM Programming Contest. As I described in class, it was the only question my Columbia team did not complete in the time limit. We had a solution which would work given infinite time, but we did not realize it was an exponential time solution for contrived input. I am letting you know that the…

[homeworkdave]

COSC 311 - Lab 1

COSC 311 – Lab 1

COSC 311 – Lab 1 1 Objectives 1. Gain familiarity with the Python programming language 2. Gain familiarity with Jupyter notebooks and the Jupyter hub cloud system 3. Practice efficiently manipulating data with Python 2 Tasks 1. Log in to the Jupyter hub environment at jupyterhub.salisbury.edu. When prompted, select the “Data Science” environment in order to get access to many common data…

[homeworkdave]

COSC 311 - Lab 2

COSC 311 – Lab 2

COSC 311 – Lab 2 1 Objectives 1. Gain familiarity with the Python programming language 2. Use the OOP aspects of Python 3. Do some basic data plotting and visualization 2 Tasks 1. Write a Python class called Vector to represent a 2-dimensional point/vector, with x and y coordinates (a) Include methods to overload addition and subtraction with other vectors (b) Include a method to compute the dot…

[homeworkdave]

COSC 311 - Lab 3

COSC 311 – Lab 3

COSC 311 – Lab 3 1 Objectives 1. Practice efficiently manipulating data with Python 2. Use the matplotlib, pandas libraries 3. Gain familiarity with data import and plotting 2 Tasks 1. Download the “Adult” data set from the UCI Machine Learning data repository: https://archive. ics.uci.edu/ml/datasets/Adult. This dataset is record of adults, along with various occupational and lifestyle…

[homeworkdave]

COSC 311 - Lab 4

COSC 311 – Lab 4

COSC 311 – Lab 4 1 Objectives 1. Practice efficiently manipulating data with Python 2. Use the matplotlib, pandas libraries 3. Gain familiarity with statistical tools 2 Tasks 1. You may submit this lab in groups of one or two. 2. Download the “Adult” data set from the UCI Machine Learning data repository: https://archive. ics.uci.edu/ml/datasets/Adult. This dataset is record of adults, along with…

[homeworkdave]

COSC 311 - Lab 5

COSC 311 – Lab 5

COSC 311 – Lab 5 1 Objectives 1. Practice efficiently manipulating data with Python 2. Use the matplotlib, pandas libraries 3. Gain familiarity with statistical tools 2 Tasks 1. You may submit this lab in groups of one or two. 2. Download the “Iris” dataset from the UCI Machine Learning data repository: https://archive.ics. uci.edu/ml/datasets/Iris. This dataset is record of some flowers, along…

[homeworkdave]

COSC 311 - Lab 6

COSC 311 – Lab 6

COSC 311 – Lab 6 1 Objectives In this lab, we will 1. Work on developing some simple supervised machine learning algorithms 2. Practice visualizing and presenting the behavior of a complex algorithm on data 3. Continue developing skills with Python, Jupyter notebooks, and data-processing libraries 2 Tasks 1. Begin by implementing the k-Nearest Neighbors (kNN) classification algorithm (a) Use a…