Web development and programming

1. Consider a situation in which you want to model mazes and be able to write a

1. Consider a situation in which you want to model mazes and be able to write a program that will find a path through a maze. For example, consider the ASCII representation of a m…

1. Consider a struct type Node whose members are Node* link and int val (the dat

1. Consider a struct type Node whose members are Node* link and int val (the data stored in that node). Implement the following functions: // Remove first node after *f whose val …

1. Consider a swapping system in which memory consists of the holes as shown in

1. Consider a swapping system in which memory consists of the holes as shown in Fig. 1. Note that A to I represent processes in memory, and Hi to Hs are eight holes. Process Pl, P…

1. Consider a system that produces budget reports for your department at work. A

1. Consider a system that produces budget reports for your department at work. Alternatively, consider a registration system that produces enrollment reports for a department at a…

1. Consider a system with a byte-addressable virtual address space of 65536 byte

1. Consider a system with a byte-addressable virtual address space of 65536 bytes, and a physical address space of 64 32-bit words. a. Assume that said system has an 8 entry cache…

1. Consider a table T which stores information about a dog competition using the

1. Consider a table T which stores information about a dog competition using the following attributes: dog_number, dog_name, kennel_code, kennel_name, kennel_location, trick_id, t…

1. Consider a text file. Each line of the file has the following form: firstName

1. Consider a text file. Each line of the file has the following form: firstName lastName An example of the file, with name example.txt, is Allen Turing John McCarthy Dennis Ritch…

1. Consider a two way set associative cache with 8K memory for storing data. Eac

1. Consider a two way set associative cache with 8K memory for storing data. Each line in the cache stores 4 bytes of data. a. How many lines and how many sets does the cache have…

1. Consider a typical data path of a CPU. The Program Counter (PC) contents are

1. Consider a typical data path of a CPU. The Program Counter (PC) contents are copied to MAR. What happens next?      Select one:      a. Contents of IR are decoded.      b. IR r…

1. Consider a very large class of students. The instructor wants to help student

1. Consider a very large class of students. The instructor wants to help students know more people in the class, thus she decides to form x number of study groups. Each student id…

1. Consider alternative strategies for the Experiment Generator module of In par

1. Consider alternative strategies for the Experiment Generator module of In particular, consider strategies in which the Experiment Generator suggest new board positions by: o Ge…

1. Consider an L1 cache that has 8 sets, is direct-mapped (1-way), and supports

1. Consider an L1 cache that has 8 sets, is direct-mapped (1-way), and supports a block size of 16 bytes. For the following memory access pattern (shown as byte addresses), show w…

1. Consider an access control policy consisting of the following two rule: Rule1

1.   Consider an access control policy consisting of the following two rule: Rule1: A subject S can write to an object O only if security_level(O) security_level(S) Rule 2: If a s…

1. Consider an algorithm for twoprocess with the exit section the same as in the

1. Consider an algorithm for twoprocess with the exit section the same as in theDekker's algorithm for ME, and with thefollowing entry section, where either i = 0 or i = 1: entry …

1. Consider an ellipse in the x, y-plane. Let a be the semi-majoraxis and b be s

1. Consider an ellipse in the x, y-plane. Let a be the semi-majoraxis and b be semi-minor axis of the ellipse. The center of theellipse is located at (x0, y0). If the major axis c…

1. Consider an unpipelined or single-stage processor design like the one discuss

1. Consider an unpipelined or single-stage processor design like the one discussed in slide 4 of lecture 16. At the start of a cycle, a new instruction enters the processor and is…

1. Consider an unpipelined or single-stage processor design like the one discuss

1. Consider an unpipelined or single-stage processor design like the one discussed in slide 4 of lecture 16. At the start of a cycle, a new instruction enters the processor and is…

1. Consider an unpipelined or single-stage processor design like the one discuss

1. Consider an unpipelined or single-stage processor design like the one discussed in slide 4 of lecture 16. At the start of a cycle, a new instruction enters the processor and is…

1. Consider function getint() documented below in pseudocode. getint() has one p

1. Consider function getint() documented below in pseudocode. getint() has one parameter, prompt, which is the address of a string to be displayed on the output window. It display…

1. Consider information in question 14 above, assume the miss penalty from L2 ca

1. Consider information in question 14 above, assume the miss penalty from L2 cache to the main memory is 200 cycles, the hit time to L2 cache is 10 clock cycles, the hit time of …

1. Consider maintaining a collection of lists of items on which the following op

1. Consider maintaining a collection of lists of items on which the following operations can be performed: (i) Given two lists L1 and L2, form their concatenation L (destroying L1…

1. Consider memoizing this function: Suppose the memoized version is called with

1. Consider memoizing this function: Suppose the memoized version is called with an initial value of 7. What is the irst recursive call that performs a table look up and inds a pr…

1. Consider sorting n numbers stored in array A by first finding the smallest el

1. Consider sorting n numbers stored in array A by first finding the smallest element of A and exchanging it with the element in AŒ1. Then find the second smallest element of A, a…

1. Consider the Bicycle Rental database below. For each of the following relatio

1. Consider the Bicycle Rental database below. For each of the following relational algebra expressions, (1) describe the data request in English (for example, "all Rentals before…

1. Consider the Fibonacci sequence. (Fibonacci sequence starts from 1. Please in

1. Consider the Fibonacci sequence. (Fibonacci sequence starts from 1. Please include both the codes and the OUTPUT) (1). Write a ‘for’ loop to generate the Fibonacci sequence, an…

1. Consider the Java code identified below. Does this code use a checked or unch

1. Consider the Java code identified below. Does this code use a checked or unchecked exception? How do you know? In your answer explain the difference between a checked and unche…

1. Consider the MIPS pipeline discussed in class, suppose the register between t

1. Consider the MIPS pipeline discussed in class, suppose the register between the Instruction Decode and Execute stages were removed. a. How would this affect the clock cycle? b.…

1. Consider the MIPS “load word” instruction as implemented on the datapath abov

1. Consider the MIPS “load word” instruction as implemented on the datapath above: lw R2, 8(R1) // Reg[2] <- memory[ Reg[1] + 8 ] Circle the correct value 0 or 1 for the contro…

1. Consider the Premier Products database and come up with an additional table t

1. Consider the Premier Products database and come up with an additional table that could be added to the database. Specify the new table's NAME, its primary key and other attribu…

1. Consider the array: s( 0 ) = 7 s( 1 ) = 0 s( 2 ) = -12 s( 3 ) = 9 s( 4 ) = 10

1. Consider the array: s( 0 ) = 7 s( 1 ) = 0 s( 2 ) = -12 s( 3 ) = 9 s( 4 ) = 10 s( 5 ) = 3 s( 6 ) = 6 The value of s( s( 6 ) - s( 5 ) ) is: a. 0. b. 3. c. 9. d. 0. 2. Consider th…

1. Consider the binary numbers x = 10011011 and y = 10111010. Decomposing x usin

1. Consider the binary numbers x = 10011011 and y = 10111010. Decomposing x using a = 1001, b = 1011 and y using c = 1011, d = 1010, compute the product xy using the ordinary way …

1. Consider the class BasketballTeam above. What is the output of the following

1. Consider the class BasketballTeam above. What is the output of the following demo driver program? BOX IN YOUR ANSWER public class BigGame { public static void main(String[ ] ar…

1. Consider the code given below. sub simple calc Dim num As Integer num 20 Call

1. Consider the code given below. sub simple calc Dim num As Integer num 20 Call Double It ((num) MsgBox num End Sub Sub Double It (var As Integer) var var 2 End Sub When this pro…

1. Consider the domain model class diagram shown in Figure 4-16—the refined diag

1. Consider the domain model class diagram shown in Figure 4-16—the refined diagram showing course enrollment with an association class. Does this model allow a student to enroll …

1. Consider the factorial fact program given in Appendix A.6 on Pages A-27-A29.

1. Consider the factorial fact program given in Appendix A.6 on Pages A-27-A29. Make it more efficient by decreasing its instruction count. What address is this program stored in …

1. Consider the follow ing function for reversing the elements of a list: def re

1. Consider the follow ing function for reversing the elements of a list: def reverseClat s- Seack for x in 1nt s push (x) while rlst.appendC.pop)) return rlat What is the runtime…

1. Consider the following (incorrect) function which removes the head node in a

1. Consider the following (incorrect) function which removes the head node in a globally defined list called my_list. The struct grade_node is used to represent a node containing …

1. Consider the following 2-dimensional array. Select the statement that gives t

1. Consider the following 2-dimensional array. Select the statement that gives the number of columns in the third row. int[][] counts = { { 0, 0, 1 }, { 0, 1, 1, 2 }, { 0, 0, 1, 4…

1. Consider the following Ada skeletal program: procedure Main is X: Integer; pr

1. Consider the following Ada skeletal program: procedure Main is X: Integer; procedure Sub3; -- declaration of Sub1. It allows Sub1 to call it. procedure Sub1 is X: Integer; proc…

1. Consider the following C-code fragment: int main(int argc, char *argv[]){ cha

1.   Consider the following C-code fragment: int main(int argc, char *argv[]){           char passwd[8];           int continue = 0;           strcpy(passwd, argv[1]);           i…

1. Consider the following FDs: PROJECT-NO START-DATE, PLANNED-END-DATE PROJECT-N

1. Consider the following FDs: PROJECT-NO START-DATE, PLANNED-END-DATE PROJECT-NOITEM-NO QTY-USED ITEM-NO-COST and the relation PROJECT-USE in Figure PROJECT NO ITEM NO OTY USED S…

1. Consider the following GRADEBOOK relational schema describing the data for a

1. Consider the following GRADEBOOK relational schema describing the data for a grade book of a particular instructor. The attributes A, B, C, and D of COURSES store grade cutoffs…

1. Consider the following JavaScript program (6pts) vaX, y, Z; function sub1 { v

1. Consider the following JavaScript program (6pts) vaX, y, Z; function sub1 { var.a, y, Z, function sub2 ( var a, b, z; function sub3 (X List all the variables, along with the pr…

1. Consider the following MIPS loop: Loop: slt $t2, $zero, $t1 beq $t2, $zero, D

1. Consider the following MIPS loop: Loop: slt $t2, $zero, $t1 beq $t2, $zero, Done addi $t1, $t1, -1 addi $s2, $s2, 2 j Loop Done: a. Assume that the register $t1 is initialized …

1. Consider the following SQL statement: CREATE TABLE tab1 ( COL1 SERIAL, COL2 C

1. Consider the following SQL statement: CREATE TABLE tab1 ( COL1 SERIAL, COL2 CHAR(20) ) FRAGMENT BY ROUND ROBIN IN dbspace1, dbspace2, dbspace3 EXTENT SIZE 9000 NEXT SIZE 3000; …

1. Consider the following SQL statements: CREATE TABLE orders ( order_num SERIAL

1. Consider the following SQL statements:    CREATE TABLE orders (    order_num SERIAL,    order_date DATE,    PRIMARY KEY (order_num) CONSTRAINT pk_orders);    CREATE TABLE items…

1. Consider the following algorithm to find the distance between the two closest

1. Consider the following algorithm to find the distance between the two closest elements in an array of numbers. Algorithm MinDistance (A[0..n-1]) //Input: Array A[0..n-1] of num…

1. Consider the following algorithm: Algorithm Sum( m , n ) //Input: A positive

1. Consider the following algorithm: Algorithm Sum(m, n) //Input: A positive integer n and another positive integer m n //Output: ? sum = 0 for i=m to n do for j=1 to i do sum = s…

1. Consider the following algorithm: Algorithm Sum( m , n ) //Input: A positive

1. Consider the following algorithm: Algorithm Sum(m, n) //Input: A positive integer n and another positive integer m n //Output: ? sum = 0 for i=m to n do for j=1 to i do sum = s…

1. Consider the following algorithm: Algorithm Sum( m , n ) //Input: A positive

1. Consider the following algorithm: Algorithm Sum(m, n) //Input: A positive integer n and another positive integer m n //Output: ? sum = 0 for i=m to n do for j=1 to i do sum = s…