0% found this document useful (0 votes)
63 views9 pages

End Sem Paper

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
0% found this document useful (0 votes)
63 views9 pages

End Sem Paper

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 9
IV" Sem. B. Tech Course work END-SEMESTER EXAMINATION, May, 2022 Course Code: CACSC11 Course Title: Artificial Intelligence Time: 3 Hours ae Note: Attempt all the five questions. Missing data / information (if any), Max. Marks: 40 may be suitably assumed and \ | : mentioned in the answer. = | Q.No. estion Marks | CO | Qi “Attempt any 2 parts of the following. : | Ta] What is Aviad Intelligence? Explain various milestones in the history of AI. Write [ 4 | CO? | | risks and benefits of AI in brief. z - | Tb What is Al environment? Explain various types of Al environments. What is PEAS | 4 | CO1) {| model? | II Te {Define ideal talonal agent? What is the structure of AI agent? Explain goal based | 4 | Ol il agent with the help of a diagram. : | jg2 ‘Attempt any 2 parts of the following =041 | a7 | Write an algorithm Tor A* searching technique. Explain with the help of suitable example, 4 |CO4) || 2b.) What are the heurisiies and what is their importance? Deseribe their (yPes with the) 4 | CO4) | help of examples. i onl | [Je] What is steepest-ascent and simulated annealing hill climbing algorithm? Draw a neat 4 [Cco4 1 and clean state space diagram for hill climbing. What is the use of online search agent i in unknown environment? i ‘Attempt any 2 parts of the following Yi! ‘What is game theory? Explain Different types of games. Explain Nash Equilibrium] 4 | CO5| | with the help of a payoff matrix. iz }} ‘What is Alpha-Beta pruning? Explain the working of Alpha-Beta pruning. What is[~ 4 [ COS / ‘worst and ideal ordering in Alpha-Beta pruning? {| What are the features of constraint satisfaction problem? Using constraint satisfaction] 4 | CO4] | procedure, solve the crypt-arithmetic problem: SEND + MORE = MONEY. | i Attempt any 2 parts of the following 1 What is @ script? Write a script for a customer going to the bank to withdraw some | 4 | CO3 |) money from his saving account. 1} ‘What are various knowledge representation issues? Draw a semantic network | 4 | CO3]| representing the following knowledge: Ram has a cycle, Ram is a boy. Cycle has a \| bell. Ram is 12 years old. Cycle has two paddles. \| Fe | What is meant by knowledge based system? Describe the basic components of at 4 | CO3|| knowledge based system. Mention the various levels of knowledge representation. i] Qs ‘Attempt any 2 parts of the following 1 ‘Sa 1 | What is the difference between forward chaining and backward chaining? Consider! 4 | COS |} the facts: "As per the law, it is a crime for an American to sell weapons to hostile | | nations. Country A, an enemy of America, has some missiles, and all the missiles were t sold to itby Robert, who is an American citizen." i Convert these facts into First Order Logic (FOL). | Sb | What is resolution? What are various steps in 7 i | Aoi eater ea relent resolution? Explain resolution in| 4 | COD | | Se | What is reasoning in AI? Explain various types of reasoning with suitable examples. 4 | co4 | | IV" Sem-B.Tech END-SEMESTER EXAMINATION, MAY, 2029 Co ae me Code. copcci2/ cAECCI2/ CDECCI2 Course Title- Data Communication Time- 3 Hours Max. Marks- 40 Note: - Attempt any 2 (out of 3) parts in all the 5 questions. Missing data/ information (if any), may tably assumed & mentioned in the answer. aa | A Speech signal is varying from -5 t0 45 volt which sampled at Nyquist rate. Bach sample | 4 is quantized and represented by 8 bits, Find the number of quantization levels required to ‘ Teduce the quantization noise by a factor of 4 be suit a 1b | Find out whether the signals s1(1), s2(0), and si(t), shown in Figure.1. are forming q orthogonal set or not. Using the Gram-Schmidt orthogonalization procedure, find a set of orthonormal basis functions to represent the three signals si(t), S2(0), and s3(t) shown in Figure 1. a oe col i aaah 8 SE 3 Figure | = 1g | Coherent orthogonal binary FSK modulation is used to transmit two equi-probable symbol waveforms S,(t) = aCos(2nf;t) and S,(t) = aCos(2mf,t) where, a = 4 mv. ‘Assume an AWGN channel with two-sided noise power spectral density %? = 0.5 x 10722 W/Hz. Find the bit error rate for a data rate of 500 kbps. Use the following data, if required. Exie(x) | 2 [0.0047 2v2__ | 6.3342 x10°° | 4 1.5417 x 10-* 2a of syndrome computation at receivet assuming there are no errors. 4 ‘pb | Draw Manchester and Polar NRZ. codes for sequence 101101. What are the advantages | 4| of Manchester scheme over Polar NRZ ? co2 2€ | Explain i$0-OSI model and briefly state the role of each layer, 7 a Consider sending yo 5 ian 7 Intemet phone), Hogi a er SDE ee aie to.a digital 64 kbp pp hace Host A then 8toups the pics into 48-byte packets, There is OMe link betWeEN host Aang By, its ransmission Tate is IMbps and its propagation delay is 2 msec. AS SoOn as Host A gathers @ packet, it sends it to Host B. As soon as Host B receives an entire packet, it coverts the packet's bits to an analog signal. How much time lapses from When a pit is created (from the original analog signal at A) until abt is decoded (as Patt of he analog | signal at B)? A 64-Kiloyte message is to be transmitted from source f0 destination as shown in Figure 2. The network limits packets to a maximum size of two kilobytes, and each packet has @ 32-byte header. The transmission is assumed to be error free and Stop and Wait ARQ is used in each transmission line. How long does it take to get the message from the source to destination? Assume that the signal propagates at the speed of 2 x 10° km/second, Assume that the ACK time and processing time are negligible. a 1000km oe 1.5Mbpr 1.SMbps Figure 2 3e Discuss HDLC frame format C03 7 Drive the routing table for the following networks using Dijkestra’s algorithm. Consider “S" is originating node. 4 Derive the throughput in slotted ALOHA. Is it better than that of pure ALOHA? Explain. Four stations A, B, C and D are using CSMAICD protocol. Distance between A and Bis 1000 meters, A and C is 2000 meters, A and D is 3000 meters. The stations are located on a straight line and the data from A to D would pass through stations B and C during transit, The signal propagates at a speed of 1x10* m/s and data rate Ry = 10 Mbps. Station A starts transmitting at ti= 0 and station C starts transmitting at t: = 15 micro-seconds, Determine the number of bits transmitted by both the stations before collision is detected. 4 Sa ‘What do you understand by birth and death processes? Explain Sb se _| and (&) Average number of customers waiting in the queuing In the M/M/I queuing system, the arrival process is the Poison process with rate h (mean arrival rate) and the service time is exponentially distributed with parameter 4. (mean service time). Derive the expression for (a) Average number of customers in the system. ‘Customers arrive at a watch repair shop according to a Poisson process at a rate of 8 per hour. The shop has one technician whose service time is an exponential random variable and repairs watch at a rate of 9 per hour. Find the probability that the technician is not free. IV" Sem.-B.Tech. (CSE/CSAI/CSDS/MAC) and VI" Sem.-B.Tech. (ICE/EE) Cours: END-SEMESTER EXAMINATION, MAY 2022 e Code: COCSC09/CACSC09/CDCSC09/CMCSC09 Course Title: Operating Systems Time: Note: 3 Hrs, Attempt ALL FIVE questions. Missing data/information, assumed and mentioned in the answer. Max. Marks: 40 if any, may be suitably Q.No. ‘Question Marks co Qi ) Attempt ANY 2 of the following parts. Write short notes on any two with examples: * Spooling 1/0 bound process and CPU bound process col s| © Cooperating processes a : What do you mean by address binding? Explain with the necessary steps, the binding of instructions and data to memory addresses. col ‘Name the different file allocation methods. Explain the linked allocation of file implementation with merits and demerits. col Attempt ANY 2 of the following parts. BR) @ ‘A system has four processes as follows. Process | Arrival time (ms) [ CPU burst time (ms) | PI 0 16 | P2 2 12 =| P3 10 : 10 | P4 12 20 The system uses round robin scheduling, The dispatch latency of the system is | ms. (i) Calculate the average waiting time of the processes if the time quantum is 8 ms (ii) Calculate the average waiting time of the processes if the time | quantum is 4 ms. CcO2 Gb) [Show how to implement the wait() and signal() semaphore operations in multiprocessor environments using the TestAndSet() instruction. The solution should exhibit minimal busy waiting. Develop pseudocode for implementing the operations. co2 2c There is a doctor in a clinic. There is one chair for the doctor and one chair for a patient in the doctor’s chamber. There are N chairs for patients in the adjoining waiting room. If there is no patient, then the doctor sleeps in his own chair. When a patient arrives, he has to wake up the doctor. If there are many patients and the doctor is treating a patient, then the remaining patients wait if there are empty chairs in the waiting room or they leave if no chair is empty. Write the pseudocode for the doctor and the patients using co2 _| appropriate semaphores. Attempt ANY 2 of the following parts. Explain with the help of supporting diagram how TLB improves the performance of a demand paging system. C03 3b ‘A process has been allocated 4 frames in the memory. Consider the reference string: 1, 0, 2, 0, 5,4, 3, 1, 0, 1,4, 5,2, 0, 3, 0, 1,4, 3, 5. (i) Determine the number of page replacements that will occur if LRU page replacement algorithm is used. (i) Determine the number of page replacements that will occur if second chance page replacement algorithm is used. co3 ‘A system has five processes, viz. Pl to P5, and three resource types. The system is in a safe state with Available = [1 2 3], 5 4 3 14 3 1 1 |. Now PS makes a Max = and Allocation = Noe 2 0 0 1 WN we cron 1 0 10 0 0 ; Should request [1 1 1] for more resources. he operating system grant the request? Justify your answer. co2 ‘Attempt ANY 2 of the following parts. List and discuss the various methods for implementing files and directories. cO4 Most systems allow programs {0 allocate more memory to its address space during execution. Data allocated in the heap segments of programs is an example of such allocated memory. What is required to support dynamic memory allocation in the following schemes? (i) Pure segmentation (ii) Pure paging. Discuss. co4 ‘A hard disc had 250 cylinders. The read/write head is currently at the outermost cylinder. Consider the queue of read/write request 200, 55, 37, 163, 99, 97, 244, 22. (i) Determine the number of cylinders travelled by the read/write head if FCFS algorithm is used. ii) Determine the number of cylinders travelled by the read/write head if C-SCAN algorithm is used. Cos | Qs ‘Attempt ANY 2 of the following parts. a) Explain different methods used to solve the problem of security at the operating system level. cos 5b Discuss the properties of RAID at different levels. Also explain how /O management is done at hardware level, interface level and kernel level. (ees) He Explain how protection is done using implementation of access matrix. 4 COS Fae REE Eee AERP RTE T TSH TE TREAT A NEAT AH ETH EE NT EEA HEATH REAR AN EERE REAR Fourth semester: B.Tech Course work End Somester Examination, May, 2022 Course code: CO} Course ttle: Protanae’/CAMTCI3/CBMTC13/ODMTC13 ability and Stochastic Process Tin Maximum Marks. 50 3 hours Note: Attempt all the five questions, Missing data/Information(if any), may be suitably assumed and mentioned in the answer. @Ne | Qaaton Marks | CO Qi | Attempt any 2 parts of the followings: of the followings: : 7 [2977] Bet he joint probability mass function pant) of random warlables Fy and Ke i given by [S| COT | following: i | | sien, my = 1,28) m= 12 | \ vteiian)={ OF there | | | | @). Find the marginal panfof X (2). ind the mean and variance for X1 (3). Find the P(X; + X_ = 4) and P(X + Xo = 3{X2 = 1) ‘Th [The wun of two nonnegative Guanttios is equal to 2n- Find the chance that their product [5] COL j | i not jess than 4 times their greatest product [| AA ex contin radon variable with probaly deny Toncion (oA) 5} Cor | ajc f aes ero | f(z) { & <0 ‘Auswer the following: (1), Verify that f(z) isa pdf (2). Find B[X] and Var(X). : (3). Find probability that X assumes atleast a value of 30, @_| Artempt any 2 parts of the followings: ‘| WX is uniformly distributed over (a, a), @ > 0, Bnd a such that 3 cor (1). P(X > 1) =1/3 (2). P(X] <1) = PUIX|>1) (| Tie ie time in hous of a cartain electrical equipment hes the normal distribution with |" 5" 7 COR ‘meant = 80 and standard deviation = 16. Answer the followings: (1), What is the probability that the equipment works at most 120 hours {2)- What.is the probability that the equipment works at least 100 hours. (3). Tf au equipuent lias already lasted for 88 hours, what is the conditional probability ‘that it will last at least another 12 hours? Be __| Define Cauchy Giswibation Le X be a random variable which follows Cauchy distribution, | 8 CO find the p.d.f for X?, “Attempt any 2 parts of the followings: Siate Weak Law of Large Numbers (WLLNS). Let (Xp) be a sequence of independent C03 Exam randonn variables such that valaee Pike = 1+ ah = 1 =P ‘ne whether the WLLNs is appligable to the sequence {Xn}. 3b) Find norma che moment generating function (MGF) of @ random variable X ‘which follows the | 5 [ CO3 a} distribution and hence find the mean and variance of X. data: DP | By the method of Toast square, fit a parabolic equation COB a a+ ka + ca to the following X13] 201314] Y isto] 21215} Gi] Attempt any 2 parts of the followings | gt | The following information was obtain Can it be said that there are relatively more women owners of tlian urban districts at 5% level of significance? x4 4 73 (4-£ C04 ed in a sample of 40 small genoral shops: - Vrban districts | Rural districts [ Total ir 18 3 12 15 30. 30 small general shops in rural degree of freedom) are given 2.841, x2o5 = 1.841, xoo,s = 3.741). Owned hy men Ownod by women 3 Total 20 3.841, bons = 3.941, xhos, heigl (toa {Las (bon perions were chosen at random from & normal population and their heights were found 5 | COs 6 \ ten x to be 63, 63, 66, 67, 68, 69, 70, 70, 71 and 71 inches. Test the hypothesis that the mean int of the population is 66 inches at 5% level of significance; tay are given ass = 1.26, tnor,o = 2-26, to.05.10 = 2.06, to25.10 = 2-36, toon = 2.56, to‘25,¢ = 2.46) whicl Jet Winat aze the type I and type II error in the hypothesis test the alternative Hh is rej committing type I and type Il errors. ing? An urn contains 6 marbles of | 5 [ CO4 ‘hd are white und the others black. In order to test the mull hypothesis Ho : @ = 3, against 9 = 4, two marbles are drawn at random (without replacement) and Hy ‘ected if both the marbles are white; otherwise Ho is accepted. Find the probabilities of |O5 | Attempt any 2 parts of the followings Sa | What of size n from the population given by: Vesify if the statistic is a biased or unbiased estimator of ‘, constitute a random sample | § | CO5 Tare the characteristics of an estimator? If Xy, X2,... e-D; a> OS { 0; otherwise What is the Maximum likelihood estimetion (M..5). Find the M-L.E for mean aia a 2 Of the normal distribution for a sample of size n when both the puree oa ae 3] COB 5% de cc vample of 8 observations, the sum of the aquares of deviations of the sample values [ 5 | COB from ” the lypothess thatthe tre varianess are equal against the alternative that they are not at ot at ‘he onaple mean was 84.4 and in the other sample of 10 observations it was 102.6, ‘Test .6. Tes Wel of significance. Fy: u1d.f2 ate Eiven as: =2.29, Fos; 108-429, Fos, 29) FOURTH SEMESTER- B. TECH END-SEMESTER EXAMINATION, May, 2022 Course Code: CACSC10, CDCSC10, COCSC10, CMCSC10 Course Title: Theory of Automata and Formal Languages Time:3hrs. Max.Marks:50 ‘Note: - Attempt all questions. Missing data/information (if any), may be suitably assumed and mentioned in the answer. a 35] COl, co2 [Attempt any two parts of the following 3a) Draw the deterministic finite automaton with minimum possible number of states that | accepts the regular language L= {wl aw2| wl, w2€ (a, b}*, jwl|=2, |w223). | : . b) Determine the minimum number of states required in NFA to accept all the substrings of the string whose length is n? Explain the process with example. | c) Using Pumping Lemima, prove L = {0°10* | n> 1} is not regular. 7 @ [Attempt any two parts of the following 35 | CO2 | a) Identify the language generated by the following grammar, where S is the start variable ca | | S>XY | X—aXia Y + aYbic ‘Also, remove the null productions of the given CFG. b) Convert following CFG into its GNF form, explain the steps. Al>A2 A3 A2— A3 A2|b AB AL ABA CFL's are closed under which closure properties. Prove CFL’s are not closed under Compliment. 9 @_| Attempt any two parts of the following 35] Coa va) Design a deterministic push-down automaton that recognizes the language Cot {a™b*| n 0Alc B— IB2| Ble iv) S+AT|TB T-raaTb |e Q4 A aAla B= bB)b V) S— Saab | aSab | aaSb | aabS | a Attempt any two parts of the following a) b) °) Design a Turing machine that accepts {1"2"3"|n21, m20} and show moves for the input 11223 Describe different types of Turing machines and how they are equivalent. Suppose there is a system and while setting password of this system, certain restrictions are to be followed. The password can be of arbitrary length but must contain at least one letter {a-z}, one number {0-9} and one special symbol {@, #, $, 4, & *, +}. Construct the rule in formal language using CFG. Show whether the grammar is ambiguous or not for the input string aal2#$. 5 co2 C03 co4 Q5 Attempt any two parts of the following a) b) c) How can you explain that a Turing machine is a very powerful and lets us solve many problems that cannot be solved with a pushdown automaton? Design a Turing machine that copies strings of 1’s for any w € {1}+ and show moves for the input w=111. Explain a problem which cannot be solved in polynomial time and why. With the help of an example, explain the difference between a problem being decidable or undecidable. Explain whether Halting problem is decidable or undecidable. S45 cos

You might also like