1-Two notions serve as the basis for all torts: wrongs and compensation. True False 2-The goal of tort law is to put a defendant in the position that he or she would have been in had the tort occurred to the defendant. True False 3-Hayley is injured in an accident precipitated by Isolde. Hayley files a tort action against Isolde, seeking to recover for the damage suffered. Damages that are intended to compensate or reimburse a plaintiff for actual losses are: compensatory damages. reimbursement damages. actual damages. punitive damages. 4-Ladd throws a rock intending to hit Minh but misses and hits Nasir instead. On the basis of the tort of battery, Nasir can sue: Ladd. Minh. the rightful owner of the rock. no one. 4-Luella trespasses on Merchandise Mart’s property. Through the use of reasonable force, Merchandise Mart’s security guard detains Luella until the police arrive. Merchandise Mart is liable for: assault. battery. false imprisonment. none of the choice 6-The extreme risk of an activity is a defense against imposing strict liability. True False 7-Misrepresentation in an ad is enough to show an intent to induce the reliance of anyone who may use the product. True False 8-Luke is playing a video game on a defective disk that melts in his game player, starting a fire that injures his hands. Luke files a suit against Mystic Maze, Inc., the game’s maker under the doctrine of strict liability. A significant application of this doctrine is in the area of: cyber torts. intentional torts. product liability. unintentional torts 9-More than two hundred years ago, the Declaration of Independence recognized the importance of protecting creative works. True False 10-n 2014, Cloud Computing Corporation registers its trademark as provided by federal law. After the first renewal, this registration: is renewable every ten years. is renewable every twenty years. runs for life of the corporation plus seventy years. runs forever. 11-Wendy works as a weather announcer for a TV station under the character name Weather Wendy. Wendy can register her character’s name as: a certification mark. a trade name. a service mark. none of the choices 12-Much of the material on the Internet, including software and database information, is not copyrighted. True False 13-In a criminal case, the state must prove its case by a preponderance of the evidence. True False 14-Under the Fourth Amendmentt, general searches through a person’s belongings are permissible. True False 15-Maura enters a gas station and points a gun at the clerk Nate. She then forces Nate to open the cash register and give her all the money. Maura can be charged with: burglary. robbery. larceny. receiving stolen property. 16-Reno, driving while intoxicated, causes a car accident that results in the death of Santo. Reno is arrested and charged with a felony. A felony is a crime punishable by death or imprisonment for: any period of time. more than one year. more than six months. more than ten days. 17-Corporate officers and directors may be held criminally liable for the actions of employees under their supervision. True False 18-Sal assures Tom that she will deliver a truckload of hay to his cattle ranch. A person’s declaration to do a certain act is part of the definition of: an expectation. a moral obligation. a prediction. a promise. 19-Lark promises to buy Mac’s used textbook for $60. Lark is: an offeror. an offeree a promisee. a promisor. 20-Casey offers to sell a certain used forklift to DIY Lumber Outlet, but Casey dies before DIY accepts. Most likely, Casey’s death: did not affect the offer. shortened the time of the offer but did not terminated it. extended the time of the offer. terminated the offer.

1-Two notions serve as the basis for all torts: wrongs and compensation. True False 2-The goal of tort law is to put a defendant in the position that he or she would have been in had the tort occurred to the defendant. True False 3-Hayley is injured in an accident precipitated by Isolde. Hayley files a tort action against Isolde, seeking to recover for the damage suffered. Damages that are intended to compensate or reimburse a plaintiff for actual losses are: compensatory damages. reimbursement damages. actual damages. punitive damages. 4-Ladd throws a rock intending to hit Minh but misses and hits Nasir instead. On the basis of the tort of battery, Nasir can sue: Ladd. Minh. the rightful owner of the rock. no one. 4-Luella trespasses on Merchandise Mart’s property. Through the use of reasonable force, Merchandise Mart’s security guard detains Luella until the police arrive. Merchandise Mart is liable for: assault. battery. false imprisonment. none of the choice 6-The extreme risk of an activity is a defense against imposing strict liability. True False 7-Misrepresentation in an ad is enough to show an intent to induce the reliance of anyone who may use the product. True False 8-Luke is playing a video game on a defective disk that melts in his game player, starting a fire that injures his hands. Luke files a suit against Mystic Maze, Inc., the game’s maker under the doctrine of strict liability. A significant application of this doctrine is in the area of: cyber torts. intentional torts. product liability. unintentional torts 9-More than two hundred years ago, the Declaration of Independence recognized the importance of protecting creative works. True False 10-n 2014, Cloud Computing Corporation registers its trademark as provided by federal law. After the first renewal, this registration: is renewable every ten years. is renewable every twenty years. runs for life of the corporation plus seventy years. runs forever. 11-Wendy works as a weather announcer for a TV station under the character name Weather Wendy. Wendy can register her character’s name as: a certification mark. a trade name. a service mark. none of the choices 12-Much of the material on the Internet, including software and database information, is not copyrighted. True False 13-In a criminal case, the state must prove its case by a preponderance of the evidence. True False 14-Under the Fourth Amendmentt, general searches through a person’s belongings are permissible. True False 15-Maura enters a gas station and points a gun at the clerk Nate. She then forces Nate to open the cash register and give her all the money. Maura can be charged with: burglary. robbery. larceny. receiving stolen property. 16-Reno, driving while intoxicated, causes a car accident that results in the death of Santo. Reno is arrested and charged with a felony. A felony is a crime punishable by death or imprisonment for: any period of time. more than one year. more than six months. more than ten days. 17-Corporate officers and directors may be held criminally liable for the actions of employees under their supervision. True False 18-Sal assures Tom that she will deliver a truckload of hay to his cattle ranch. A person’s declaration to do a certain act is part of the definition of: an expectation. a moral obligation. a prediction. a promise. 19-Lark promises to buy Mac’s used textbook for $60. Lark is: an offeror. an offeree a promisee. a promisor. 20-Casey offers to sell a certain used forklift to DIY Lumber Outlet, but Casey dies before DIY accepts. Most likely, Casey’s death: did not affect the offer. shortened the time of the offer but did not terminated it. extended the time of the offer. terminated the offer.

1-Two notions serve as the basis for all torts: wrongs … Read More...
– 1 – Fall 2015 EECS 338 Assignment 2 Due: Oct. 1st, 2015 G. Ozsoyoglu Concurrent Programming with Semaphores; 140 points (100 pts) 1. Priority-based Searchers/Inserters/Deleters Problem without starvation. Three types of processes, namely, searchers, inserters, and deleters share access to a singly linked list L, and perform search, insert, or delete operations, respectively. The list L does not have duplicate values. a) Searchers merely search the list L, and report success (i.e., item searched is in L) or no-success (i.e., item searched is not in L) to a log file. Hence they can execute concurrently with each other. b) Inserters add new items to the end of the list L, and report success (i.e., item is not in L, and successfully inserted into L) or no-success (i.e., item is already in L, and no insertion takes place) to a log file. Insertions must be mutually exclusive to preclude two inserters from inserting new items at about the same time. However, one insert can proceed in parallel with any number of searches. c) Deleters remove items from anywhere in the list, and report success (i.e., the item is found in L and deleted) or no-success (i.e., item is not in L, and could not be deleted) to a log file. At most one deleter can access the list L at a time, and the deletion must be mutually exclusive with searches and insertions. d) Initial start. Searcher, inserter, and deleter processes are initially launched as follows. A user process that needs a search/insertion/deletion operation to the list L first forks a process, and then, in the forked process, performs an execv into a searcher/ inserter/deleter process. e) Log maintenance. Upon start, each searcher/inserter/deleter writes to a log file, recording the time of insertion, process id, process type (i.e., searcher, inserter, or deleter), and the item that is being searched/inserted/deleted. f) Termination. Upon successful or unsuccessful completion, each searcher/inserter/deleter writes to the same log file, recording the time and the result of its execution. g) Priority-based service between three types. Searchers, inserters, and deleters perform their search, insert, delete operations, respectively, on a priority basis (not on a first-come-first-serve (FCFS) basis) between separate process types (i.e., searchers, inserters, deleters) as follows. Searchers search with the highest priority; inserters insert with the second highest priority (except that one inserter can proceed in parallel with any number of searchers), and deleters delete with the lowest priority. h) FCFS service within a single type. Processes of the same type are serviced FCFS. As an example, among multiple inserters, the order of insertions into L is FCFS. Similarly, among multiple deleters, the order of deletions into L is FCFS. Note that, among searchers, while the start of search among searchers is FCFS, due to concurrent searcher execution, the completions of multiple searchers may not be FCFS. i) Starvation avoidance. In addition to the above priority-based search/insert/delete operations, the following starvation-avoidance rule is enforced. o After 10 consecutive searchers search the list L, if there is at least one waiting inserter or deleter then newly arriving searchers are blocked until (a) all waiting inserters are first serviced FCFS, and, then (b) all waiting deleters are serviced FCFS. Then, both the standard priority-based service between process types and the FCFS service within a process type resume. You are to specify a semaphore-based algorithm to synchronize searcher, inserter and deleter processes. Note:  Explain your algorithm.  Make sure to state any assumptions you make in your solution.  Specify the initial states of your variables and semaphores.  Specify whether your semaphores are binary or nonbinary.  Do not bother specifying algorithms for sequential tasks: simply specify a well-defined function/procedure (i.e., one with well-defined input/output/functional specification). – 2 – (40 pts) 2. Four-of-a-Kind Problem is defined as follows.  There is a deck of 24 cards, split into 6 different kinds, 4 cards of each kind.  There are 4 players (i.e., processes) ??,0≤?≤3; each player can hold 4 cards.  Between each pair of adjacent (i.e., seated next to each other) players, there is a pile of cards.  The game begins by o someone dealing four cards to each player, and putting two cards on the pile between each pair of adjacent players, and o ?0 starting the game. If ?0 has four-of-a-kind, ?0 wins. Whoever gets four-of-a-kind first wins.  Players take turns to play clockwise. That is, ?0 plays, ?1 plays, ?2 plays, ?3 plays, ?0 plays, etc.  Each player behaves as follows. o So long as no one has won, keep playing. o If it is my turn and no one has won:  Check for Four-of-a-Kind. If yes, claim victory. Otherwise discard a card into the pile on the right; pick up a card from the pile on the left; and, check again: If Four-of-a-Kind, claim victory; otherwise revise turn so that the next player plays and wait for your turn.  There are no ties; when a player has claimed victory, all other players stop (when their turns to play come up). You are to specify a semaphore-based algorithm to the Four-of-a-Kind problem. Note:  Explain your algorithm.  Make sure to state any assumptions you make in your solution.  Specify the initial states of your variables and semaphores.  Specify whether your semaphores are binary or nonbinary.  Do not bother specifying algorithms for sequential tasks: simply specify a well-defined function/procedure (i.e., one with well-defined input/output/functional specification). P1 P0 P2 P3 pile 1 pile 2 pile 3 pile 0

– 1 – Fall 2015 EECS 338 Assignment 2 Due: Oct. 1st, 2015 G. Ozsoyoglu Concurrent Programming with Semaphores; 140 points (100 pts) 1. Priority-based Searchers/Inserters/Deleters Problem without starvation. Three types of processes, namely, searchers, inserters, and deleters share access to a singly linked list L, and perform search, insert, or delete operations, respectively. The list L does not have duplicate values. a) Searchers merely search the list L, and report success (i.e., item searched is in L) or no-success (i.e., item searched is not in L) to a log file. Hence they can execute concurrently with each other. b) Inserters add new items to the end of the list L, and report success (i.e., item is not in L, and successfully inserted into L) or no-success (i.e., item is already in L, and no insertion takes place) to a log file. Insertions must be mutually exclusive to preclude two inserters from inserting new items at about the same time. However, one insert can proceed in parallel with any number of searches. c) Deleters remove items from anywhere in the list, and report success (i.e., the item is found in L and deleted) or no-success (i.e., item is not in L, and could not be deleted) to a log file. At most one deleter can access the list L at a time, and the deletion must be mutually exclusive with searches and insertions. d) Initial start. Searcher, inserter, and deleter processes are initially launched as follows. A user process that needs a search/insertion/deletion operation to the list L first forks a process, and then, in the forked process, performs an execv into a searcher/ inserter/deleter process. e) Log maintenance. Upon start, each searcher/inserter/deleter writes to a log file, recording the time of insertion, process id, process type (i.e., searcher, inserter, or deleter), and the item that is being searched/inserted/deleted. f) Termination. Upon successful or unsuccessful completion, each searcher/inserter/deleter writes to the same log file, recording the time and the result of its execution. g) Priority-based service between three types. Searchers, inserters, and deleters perform their search, insert, delete operations, respectively, on a priority basis (not on a first-come-first-serve (FCFS) basis) between separate process types (i.e., searchers, inserters, deleters) as follows. Searchers search with the highest priority; inserters insert with the second highest priority (except that one inserter can proceed in parallel with any number of searchers), and deleters delete with the lowest priority. h) FCFS service within a single type. Processes of the same type are serviced FCFS. As an example, among multiple inserters, the order of insertions into L is FCFS. Similarly, among multiple deleters, the order of deletions into L is FCFS. Note that, among searchers, while the start of search among searchers is FCFS, due to concurrent searcher execution, the completions of multiple searchers may not be FCFS. i) Starvation avoidance. In addition to the above priority-based search/insert/delete operations, the following starvation-avoidance rule is enforced. o After 10 consecutive searchers search the list L, if there is at least one waiting inserter or deleter then newly arriving searchers are blocked until (a) all waiting inserters are first serviced FCFS, and, then (b) all waiting deleters are serviced FCFS. Then, both the standard priority-based service between process types and the FCFS service within a process type resume. You are to specify a semaphore-based algorithm to synchronize searcher, inserter and deleter processes. Note:  Explain your algorithm.  Make sure to state any assumptions you make in your solution.  Specify the initial states of your variables and semaphores.  Specify whether your semaphores are binary or nonbinary.  Do not bother specifying algorithms for sequential tasks: simply specify a well-defined function/procedure (i.e., one with well-defined input/output/functional specification). – 2 – (40 pts) 2. Four-of-a-Kind Problem is defined as follows.  There is a deck of 24 cards, split into 6 different kinds, 4 cards of each kind.  There are 4 players (i.e., processes) ??,0≤?≤3; each player can hold 4 cards.  Between each pair of adjacent (i.e., seated next to each other) players, there is a pile of cards.  The game begins by o someone dealing four cards to each player, and putting two cards on the pile between each pair of adjacent players, and o ?0 starting the game. If ?0 has four-of-a-kind, ?0 wins. Whoever gets four-of-a-kind first wins.  Players take turns to play clockwise. That is, ?0 plays, ?1 plays, ?2 plays, ?3 plays, ?0 plays, etc.  Each player behaves as follows. o So long as no one has won, keep playing. o If it is my turn and no one has won:  Check for Four-of-a-Kind. If yes, claim victory. Otherwise discard a card into the pile on the right; pick up a card from the pile on the left; and, check again: If Four-of-a-Kind, claim victory; otherwise revise turn so that the next player plays and wait for your turn.  There are no ties; when a player has claimed victory, all other players stop (when their turns to play come up). You are to specify a semaphore-based algorithm to the Four-of-a-Kind problem. Note:  Explain your algorithm.  Make sure to state any assumptions you make in your solution.  Specify the initial states of your variables and semaphores.  Specify whether your semaphores are binary or nonbinary.  Do not bother specifying algorithms for sequential tasks: simply specify a well-defined function/procedure (i.e., one with well-defined input/output/functional specification). P1 P0 P2 P3 pile 1 pile 2 pile 3 pile 0

– 1 – Fall 2015 EECS 338 Assignment 2 Due: … Read More...