#1
4th January 2016, 06:54 PM
| |||
| |||
Sri Venkateswara University Degree Question Papers
Hey buddy will you please get the BSC Chemistry exam paper of Sri Venkateswara University so that I can get idea from it? Feel free buddy I will help you here to get the BSC Chemistry exam paper of Sri Venkateswara University so that you prepare well for the exam. Here is the BSC chemistry question paper 1. Explain the preparation and applications of silicones? 2. Explain the classification of oxides based on chemical behaviour? 3. Define Inter halogens and Pseudo halogens give any two examples? 4. Write the structures of Diborane? 5. Explain Inductive effect and it’s any two applications? 6. Explain acidity of Acetylenic Hydrogens? 7. Write any two preparation methods of cycloalkanes? 8. Explain the evidences for the cyclic structures of Benzene? PART-B Answer all the questions. Each carries 10 marks. 5X10=50 UNIT-I 9. Explain preparation and reactions of Hydrazine and Hydroxylamine? OR 10. (a) Explain general characters of Group V elements? (b) Write preparation and properties of silanes? UNIT-II 11. Write preparation, properties of organo lithium compounds? OR 12. Explain types of classification of organometallic compounds? UNIT-III 13. Wite a short note on (a) Mesomeric effect (b) Hyper conjugation OR 14. Explain the types of organic reactions? UNIT-IV 15. State the Markownikoff rule explain the rule in the addition of HX, HOX to an alkene? OR 16. Explain the following (a) Bayer’s Strain Theory (b) Sache-Mohr Theory UNIT-V 17.Define aromaticity. Explain Hukuls rule with examples of benzenoid and non- benzenoid aromatic compounds? OR 18. (a) What are ortho, para and meta directing groups? (b) Explain the mechanism of Friedel craft’s alkylations in Benzene? Address:- Sri Venkateswara University NH 205, Tirupathi, Andhra Pradesh 517502 Phone:- 0877 228 9412 As you are asking for Sri Venkateswara University (SVU) 2008 B.Tech Computer Science and Engineering Design and Analysis of Algorithms degree Question Paper , so on your demand I am providing same here : 4 YEAR B.TECH DEGREE EXAMINATION, APRIL 2008 3rd year exam 2nd Semester Computer Science & Engineering Design and Analysis of Algorithms (Revised Regulations w.e.f 2003-2004) Time: three hours Maximum marks:100 ans any FIVE, choosing 1 ques. from every unit. All ques. carry equal marks. UNIT-I 1. (a) Write the important characteristics of algorithms. (7M) (b) describe the different Asymptotic notations and their representations. (7M) (c) How do you evaluate the performance of the algorithms? (7M) or 2. (a) Write the recursive and non-recursive algorithms for the generation of Fibonacci numbers. (10M) (b) Derive the time complexity of every of the methods in the above issue. (5M) (c) Solve the subsequent recursive equation: C1 if n<=2 T(n) = 2T(n/2)+c2 if n>2 (5M) UNIT-II 3. (a) Write the Topological sorting algorithm and discuss (7M) (b) Write the insertion sort algorithm quote in which circumstances this algorithm is preferred. (6M) (c) Identify the number of exchanges to be made to the array of n items on sorting them (in ascending order) using the above algorithm for the subsequent category of input. (7M) (i) 100,75,69,40,30,12,5 (ii) 5,17,6,4,0,20,32,15 or 4. (a) Write the algorithm for sequential search (8M) (b) Write the divide and conquer algorithm for merge sorting (12M) UNIT-III 5. (a) Write notes on balanced search trees (7M) (b) What is meant by Presorting? discuss. (6M) (c) discuss the concept of Heapify. Also derive the time complexity. (7M) or 6. (a) Write briefly about space and time trade offs.(7M) (b) Write summary on string matching (7M) (c) provide an example for B-Trees (6M) UNIT-IV 7. (a) discuss the solution optimal storage on tapes using dynamic programming method (10M) (b) describe principle of optionality. discuss how it applies to traveling sales man issue. (10M) or 8. (a) How multi-stage graphs differ from the general graphs. discuss the approaches to derive solutions from multistage graph. (10M) (b) Apply the dynamic programming method for the subsequent 0/1 Knapsack issue instance: (10M) w1 = p1 +(100,50,20,10,7,3) n=6 and m=165 UNIT-V 9. (a) Write a summary on approximation of algorithms (10M) (b) discuss about P, NP and NP-Complete issues (10M) or 10.(a) Write the Back tracking algorithms for sum of subsets issue (10M) (b) Write the Branch and Bound solution for Knapsack issue and discuss. (10M) Last edited by sumit; 24th December 2019 at 03:31 PM. |
#3
2nd September 2017, 08:13 AM
| |||
| |||
Re: Sri Venkateswara University Degree Question Papers
hello friend will u plz help me i want sv university ba 2nd year Computer previous question paper
|
#4
9th October 2019, 10:43 AM
| |||
| |||
Re: Sri Venkateswara University Degree Question Papers
here I am looking for Sri Venkateswara University (SVU) 2008 B.Tech Computer Science and Engineering Design and Analysis of Algorithms degree Question Paper , so will you plz provide me same here ??
|