Computer Engineering Questions and Answers June 06, 2021

Write a client-server program using TCP or UDP where the client sends 10 numbers and server responds with the numbers in sorted order

Write a TCP Client-Server program to get the Date & Time details from Server on the Client request.

Explain Statement Interface with appropriate example.

Explain Prepared Statement with example.

Explain Callable Statement with example.

Explain JDBC Architecture

Explain methods of Result Set Interface.

Explain ResultsetMetaData Interface with Example

Explain DatabaseMetaData Interface with Example

Explain Transaction Management in JDBC with appropriate example.

Explain Batch Processing in JDBC

Write a Servlet program using doPost() to enter two numbers and find maximum among them.

Explain ServletConfig with example.

Explain ServletContext with example.

Explain Methods of HttpServletRequest with appropriate example.

Q.10 Write servlet which displayed following information of client. I. Client Browser II. Client IP address III. Client Port No IV. Server Port No V. Local Port No VI. Method used by client for form submission VII. Query String name and values

Write a Servlet program to authenticate user with userid and password, if user is authenticated then forward to welcome page else include message with invalid useridpassword.

Explain response.send Redirect() with appropriate example.

Write a Servlet program for Session Management using Cookie.

Write a servlet program for Session Management using HttpSession.

Q23. Write a Servlet Program that uses two filters i) ii) Authentication Filter Checks authentication value (useridpassword) Config Param Filter Checks value of config param in web.xml

Q25. Write a Servlet program which retrieves record from database

Draw the JSF request processing life cycle and briefly give the function of each phase.

Write a JSF program to authenticate user with given UID and Password

Explain JSF Database ACCESS

Draw and explain the architecture of Hibernate.

Explain architecture of Spring MVC Framework. Explain all modules in brief.

Briefly explain spring bean life cycle.

Develop small application using Spring MVC framework.

Find the minimum spanning tree for the following graph using Kruskals Algorithm. 2

Find the minimum spanning tree for the above graph using Prims Algorithm.

Example We are given 5 objects and weight carrying capacity of knapsack W 100. For each object, weight w and value vi are given in the following table. Object i Wi V ViWi 1 10 20 2.0 2 20 30 1.5 3 30 66 2.2 4 40 40 1.0 5 50 60 1.2

Example Huffmans greedy algorithm uses a table giving how often each character occurs (i.e., its frequency) to build up an optimal way of representing each character as a binary string. Suppose we have a 100,000character data file that we wish to store compactly. We observe that the characters in the file occur with the frequencies given by

Address binding: What is it? List the various times when address binding might happen.

Bobbys Bistro, a 24 hour, 7 days per week operation, specializes in a Super Deal Meal selling for a price in dollars and cents equal to twice the first two digits of your AUID divided by 10 (for example, 249109.80. The daily fixed costs of the operation are equal to the third through sixth digits of your AUID expressed in dollars (for example,

Q.5 Explain the different loT enabled Technologies in detail.CT 1 2022

Q.6 Write a note on loT Levels and Deployment Templates.

Q.3 Explain the Unique security Challenges in loT.

how to make a tic tac toe game using c++?

Overview With a few years as Java programmers you may have had an opportunity to use a Java PriorityQueue. In this assignment we will build our own priority queue. There are multiple ways to build this data structure. We have already built one last assignment when we built an ordered list. A (minimum) binary heap is a specialized data structure

Given the following relation, { ( A, A ), ( A, B ), ( A, D ), ( B, B ), ( B, C ), ( B, E ), ( C, B ), ( C, C ), ( C, D ), ( D, A ), ( D, B ), ( D, C ), ( D, E ), ( E, D ), ( E, E ) } i) Draw the digraph of the relation, ii) construct the matrix diagram for the relation, and iii) why or why not is the relation reflexive, symmetric, antisymmetric,

Select three (3) of the following eight problems. The entire essay should be no longer than 12 double-spaced pages and should be no shorter than 9 double-spaced pages. Basically 3 pages for each problem. The examination is an opportunity to apply what weve discussed in class to the optimization and delivery of technology at your (past or current)

Copyright is the legal protection afforded intellectual property, such as a song, book, or video game. Group of answer choices True False

Despite the passage of several laws defining and addressing computer crime, accessing a computer system without authorization is not yet a federal crime. Group of answer choices True C False

Network economics Group of answer choices C balances the high cost of adding new members to a community against the lower cost of using network infrastructure. C applies traditional economics to networked users. sees the cost of adding new members as inconsequential. C applies the law of diminishing returns to communities of users.

Which of the following statements should be used to obtain a remainder after dividing 3.14 by 2.1 A. rem 3.14 2.1 B. rem modf (3.14, 2.1) C. rem fmod(3.14, 2.1) D. Remainder cannot be obtain in floating point division.

Explain basic concept of OOP.

List out benefits of OOP. And list out Applications of OOP.

What is noise in data Explain how it effects hypothesizes on the basis of the following graph. 2,400 2,000 1,600 1,200 800 9 11 13 15 Value X 17 19 21 Feb 25, 2018, 117 PM VERDAZO

Explain the significance of ROC with a diagram.

Explain the general MLE method for estimating the parameters of a probability distribution.

A Chinese restaurant wants to have a computer based search system that will display a recipe for each dish. The owner of the restaurant wants the system to be flexible in that its recipes are stored in a text file. This way, the number of dishes can be expanded by adding more entries to the text file without changing any program code. The

What is security of web server and data directory. Technology: ownCloud

What is operating System? Explain the abstract view of the components of a computer system.

SHERRI DONATES 5000 TO THE UNIVERSITY IN EXCHANGE FOR THE RIGHT TO PURCHASE TICKETS FOR THE UPCOMING FOOTBALL SEASON. HOW SHOULD SHE TREAT THE CONTRIBUTION A DEDUCTION IS NOT ALLOWED, B SHE MAY DEDUCT5,000 AS A BUSINESS EXPENSE. C SHE MAY DEDUCT 5,000 AS A CHARITABLE CONTRIBUTION D SHE MUST LIMIT THE DEDUCTION TO 50 OF THE COST

Please answer using DataGridView and LINQ query 35. Famous Athletes Display a table showing all the people in the file SportsStars.txt who were born between 50 and 60 years ago along with their nicknames and the days of the week they were born. See Fig. 7.57. Note: The output will depend on when the program is executed. Figure 7.57 was obtained on

The LINQ query above is usually written in the style Dim queryName From var In arrayName Where condition on var Select var

Prove or disprove the following (a) Every interior point of AC R is a limit point of A. (b) Every connected metric space with at least two points is uncountable. (c) If (n) and (yn) are Cauchy sequences in a metric space X, then (d(xn, Yn)) converges. 3 x 10 30

Give example and justify your answer to the following statements (a) A bijective map f 0, 1 (0, 1). (b) A subset of R with exactly 7 limit points. (c) Closed and bounded subset in a subspace of R that is not complete.

A 400MHz processor was used to execute a program with 150000 floating point instructions with clock cycle count of 1. Determine the execution time and MIPS rate for this program ?

State Amdahls law. Write an expression for the overall speed up.

Discuss the schematic representation of a generalized multiprocessor system.

1.Consider the execution of a program of 15,00,000 instructions by a linear pipeline processor with a clock rate of 1000 MHz. Assume that the instruction pipeline has five stages and that one instruction is issued per cycle. The penalties due to branch instruction and out-of-order execution are ignored. a) Calculate the speedup factor in using

11 a) Discuss the Bernstein`s conditions for checking the parallelism among a set of processes. b) Analyze the data dependences among the following statements and construct a dependency graph. Also detect the parallelism embedded in them. S1 : Load R1 , M(100) / R1 ? Memory(100) / S2 : Move R2 , R1 / R2 ? (R1 ) / S3 : Inc R1 / R1 ? (R1 ) + 1 / S4

Discuss how data quality can be assessed.

Discuss different Data Mining Task.

Explain Knowledge Discovery Process (KDD).

What do you mean by distance based algorithm? Design algorithm for K Nearest Neighbors.

What are the issues in classification problem?

We claimed that its demonstration crucially depended on the conjunction of three factors offpolicy updating, bootstrapping, and generalisation. In this question, we consider the effect of removing one of these factors specifically we replace the offpolicy update with an onpolicy update. Refer to the MDP in the counterexample on Slide 9 of the

Both relate to the prediction task say policy is being evaluated on MDP (S, A, T, R, 7). Assume the MDP is continuing and ergodic also assume standard conditions for annealing the learning rate. R1. TD (0) in the tabular setting (that is, with a separate entry for each state) converges to the underlying value function V. R2. Linear TD(X), for A

A learning agent interacts with an MDP (S, A, T, R, 7), where S A a1, a2, a3). No discounting is used (y 1). The agent begins with the Qtable given below as initialisation Q. S 1 82 83 Q(s, a) a1 220 a a2 3 2 1 a3 1 2 1 81, 82, 83) and The agent uses egreedy exploration with 0.15, and a learning rate a 0.1 (both are con stants, not annealed

The figure below shows a Markov chain, which is defined by its states and transition probabilities. A Markov chain is what we get by fixing a policy for a given MDP (and ignoring the rewards and discount factor). The Markov chain in the figure has two states, s and 82. State 81 loops back to itself with probability p 0, 1, and transitions to s2

This question calls for a straightforward application of definitions introduced in the Week 6 lecture. Consider the MDP shown in the figure below. It has two states s1 and s2 and three actions a, b, and c. Action a is deterministic, always leading to state s action b is also deterministic, but always leading to state s2. Action c, on the other

For an MDP (S, A, T, R,y), let Vo SR be an initial guess of the optimal value function V. Suppose that this guess is progressively updated using Value Iteration that is, by setting Vt1B (Vt) for t 0, 1, 2,.... Recall that B is the Bellman optimality operator. In this question, we examine the design of a stopping condition for Value Iteration. As

we derived Bellman equations for policy evaluation. If M (S, A, T, R, ) is our input MDP, we showed for every policy SA and state s S T(S, T(S), s)R(s, n(s), s) V (s). V (s) SES This question considers four variations in our definitions or assumptions regarding the input MDP M and policy. In each case write down Bellman equations after making

Question. A 2armed bandit instance I has as the mean rewards of its arms P, P2 0, 1, where P1 P2A 0. Both arms produce 0 and 1 rewards (that is, from Bernoulli distributions). Suppose we are given A, but we do not know which arm has the higher mean reward. Our aim is to determine the optimal arm with probability at least 16. In order to do so, we

In this question, we consider bandit instances in which the number of arms n 10 assume the set of arms is A 0, 1, 2, ..., 9. blobhttpsadmin.solutioninn.com204a1237aaa348928768e0979f885823Each arm yields rewards from a Bernoulli distribution whose mean is strictly less than 1. Call this set of bandit instances I. Now consider a family of

Consider a 2armed bandit instance B in which the rewards from the arms come from uniform distributions (recall that the lectures assumed they came from Bernoulli distributions). The rewards of arm 1 are drawn uniformly at random from a, b, and the rewards of arm 2 are drawn uniformly at random from c, d, where 0 a c b d 1. Observe that this

Consider a stochastic narmed bandit, n 2, in which the arms give 01 (Bernoulli) rewards. We restrict our attention to instances I in which the means of the arms all lie in (0,1), and moreover, no two arms have the same mean. In any such instance I, let a2 be the arm with the second highest mean, and let u be a random variable denoting the number

You are right outside the entrance to a cave, as seen in the figure below. The cave has n 1 chambers numbered 1, 2,..., n. You (denoted Y in the figure) are in chamber 0, a convenient name for just outside. The cave is linear, with each chamber connected to one on the left and one on the right (except that the last chamber, n, has no right

Consider a run of value iteration on MDP M (S, A, T, R, y). The initial value function guess is V SR, and for t 0, we set Vt1 B(V), where B is the Bellman optimality operator. Prove or disprove each of the following statements. Proof of truth must hold for every MDP M, whereas a single (counterexample) MDP can establish the falsity of a

Consider the prediction problem on the MDP shown below, with transitions according to policy. The sole nonterminal state s has a selfloop with probability 1e, yielding reward 1. With probability , the episode terminates with a 0reward. Assume (0, 1) and no discounting. 1E, 1 8,0 Suppose at some time step t 0, we are in state s. Let our current

We consider the use of a singlehiddenlayer neural network for representing a stochas tic policy or a value function in RL. The input to the neural network are features of state. The weights of the neural network are the parameters to be updated. There is one output corresponding to each action in the control setting, and a single output in the

In the lectures, both in the planning and learning settings, we only considered MDPS in which the set of actions is discrete and enumerable. In practice one often finds tasks that have a continuous action space (with an infinite number of actions). Take Sarsa as an illustrative method. What major changes would be needed in practice to apply the

Solve the following recurrence using the Master theorem. Verify the result using the substitution method (i.e. induction). T(n) 4 T(n2) (n).

Solve the following recurrence using the recursion tree method. T(n) 4.T(n2) n. lg(n). (Do not verify the answer using the substitution method.) Can Master theorem be used to solve this recurrence Please give a reason.

An array A1..n is called unimodal if there is exactly one index 1

Answer whether each of the following statements is true or false. Justify your answer by giving reason.

(2 marks) Given a undirected, edgeweighted graph G (V, E, w) and a MST TCE of G, if we transform G to G by squaring the edgeweights, then T is an MST of G also. Recall that edge weights are real numbers.

Villages all occur along a straight line as coordinates V, V2,... Un. A telecom tower at coordinate t on the line services a village v, if the absolute distance vj til 4. (A single tower can service multiple villages in its range.) Give an algorithm to place a minimal set of towers on the line (i.e. output t, t2,..., tr with least possible r)

Recall the algorithm for counting number of inversions in an array A1..n. Let a pair (i, j) be called a significant inversion if i 2. Aj. Give an O(nlg(n)) algorithm for counting the number of significant inversions in A. Justify the correctness and complexity informally.

We have n jobs to schedule. The jobs take durations C1 each, to complete. Also, each job has an associated penalty Li. If a job i is completed at a time t, the total penalty can be calculated as P Lieti (this is called exponential penalty). We can perform only one job at a time. Find an algorithm to schedule the jobs so that the total penalty is

A subset of nodes S of an undirected graph is called indepen dant if for any u, ve S if u v then (u, v) E. Given a tree of n nodes (with undirected edges) design an O(n) algorithm to find the maximum sized independant set of nodes. Argue that your solution is correct and analyse its time complexity. (Hint Think of some special type of nodes which

(3 marks) Given a connected edge weighted undirected graph with n vertices and n edges, give an O(n) time algorithm (strategy only) to find the minimum spanning tree.

Consider the modified rod cutting problem. Given a rod of length n and a price table which for each piece of rod of length i gives corresponding price pi, we want to maximize the total revenue obtained by cutting rod into pieces and selling each part at price in the price table. Each cut of the rod incurs a cost of c. Formulate a dynamic

A word over alphabet AZ is a palindrome if it reads same in forward or the backward direction. E.g. BOB is a palindrom but DOG is not a palindrome. Give a dynamic programming based efficient algorithm to find the longest palindrome subsequence of given word w. (A subsequence need not consist of contiguous letters E.g. MODEM has palindrome

Let G, c be a flow network and let f be the maximum integral flow through the network. We increase the capacity of one of the edges in G by 1 to give a flow network G, c. Give an O(VE) algorithm to find the value of the maximum flow f in G, c by using f. Compare the values of flows v(f) and v(f).

Given a graph G (V, E) and integer k, we say that G k LengthCycle, if G has a simple cycle with k or more edges. Show that kLengthCycle problem is NPComplete. Assume that HAMILTONCY CLE, SAT, 3CNFSAT and 3COLOR are all known to be NPComplete.

(EQUALSUM problem) Given a set of n positive integer numbers S a,..., an decide whether there exists a partition (S1, S) of S into two disjoint sets such that (EES, a) (Ebe S b). Show that EQUALSUM is NPComplete. Assume that the SUBSETSUM problem is NPComplete.

(Hitting set) Given a collection C (S1, S2,..., Sn) of sub sets of U let HCU be called a hitting set if HS is nonempty for each Si, 1 i n. Show that the problem of deciding whether C has a hitting set of given size k is NPComplete. You may assume that SAT, 3CNFSAT, kClique, kVertex Cover, kIND, HAMILTONCYCLE are NPComplete.

Give a randomized algorithm with expected time complexity O(n) for finding the median element in an array of n integers where all elements are distinct. (Hint solve the general problem of finding kth smallest element for any given k. Recall randomized quicksort.)