Trending ▼   ResFinder  

2003 Course Computer Techniques & Applications

3 pages, 45 questions, 0 questions with responses, 0 total responses,    0    0
pune_eng
  
+Fave Message
 Home > pune_eng >

Instantly get Model Answers to questions on this ResPaper. Try now!
NEW ResPaper Exclusive!

Formatting page ...

Total No. of Questions : 12] [Total No. of Pages : 3 [3664] - 251 P 1164 B.E. (Instrumentation & Control) COMPUTER TECHNIQUES & APPLICATIONS (2003 Course) Time : 3 Hours] [Max. Marks : 100 Instructions to the candidates: 1) Answer any 3 questions from each section. 2) Answers to the two sections should be written in separate books. 3) Neat diagrams must be drawn wherever necessary. 4) Figures to the right indicate full marks. 5) Use of logarithmic tables, slide rule, mollier charts, electronic pocket calculator and steam tables is allowed. 6) Assume suitable data, if necessary. Q1) a) b) SECTION - I With a neat diagram, explain the Process Control Block and its various fields. [8] List and explain the five states through which a process may go during its execution. [10] OR Q2) a) b) List and explain any four CPU scheduling algorithms. [8] What are deadlocks? Explain any four methods for preventing deadlocks. [10] Q3) a) What is external and internal fragmentation? How does paging help in minimizing fragmentation? [8] What is virtual memory? With the help of neat diagram explain the implementation of virtual memory through Demand Paging. [8] b) OR Q4) a) b) With neat diagrams, explain any two file allocation methods. With neat diagram explain Overlays. [8] [8] Q5) a) The following figure is the precedence graph of Jobs J1 to J8. The number next to the name of each job is its execution time. The priorities are J1, J2, J3 ........ J8, J1 being the highest priority job. All jobs are released at P.T.O. t = 0. Jobs are scheduled and executed on two processors, P1 and P2. All the jobs are preemptable. b) Show the schedule of jobs on P1 and P2 generated by the following priority algorithms : i) Preemptive. [4] ii) Non preemptive. [4] Explain Flynn s classification of Parallel computers. [8] OR Q6) a) b) Explain the following methods of parallelism : i) Temporal parallelism. ii) Data parallelism. iii) Temporal and data parallelism. iv) Data parallelism with dynamic assignment. Compare the following with respect to parallel computers : i) Loosely Coupled and tightly coupled systems. ii) UMA and NUMA parallel computers. [8] [8] SECTION - II Q7) a) b) Compare Circuit Switching and Packet Switching Networks. Write a note on IEEE 802.3 with respect to following points : i) Data Frame. ii) Description of Working. [8] [8] OR Q8) Write short notes : a) LAN and LAN topologies. b) TCP / IP reference model. [3664] - 251 [16] -2- Q9) a) b) Q10)a) b) Q11)a) b) Explain any four levels of CMM. [8] i) Define Software Reliability. [2] ii) Explain the following Software reliability terms which can be used to quantify the reliability of software products : [6] 1) Rate of Occurrence of failure. 2) Mean time to failure. 3) Mean time to repair. 4) Mean time between failure. 5) Probability of Failure on Demand. 6) Availability. OR List the two types of instruction sets available with ARM processors. Also list the seven basic operating modes of ARM processors. [8] Discuss the features of IEEE 488. [8] With respect to Software testing explain the following : i) Black box testing. ii) White box testing. iii) Unit Testing. iv) System Testing. v) Control Structure Testing. Discuss CASE and CASE tools. [10] [8] OR Q12)a) b) What is software testing? With respect to Software testing explain the following : [10] i) Test Plan. ii) Requirement Analysis. iii) Verification. iv) Validation. Explain Integration testing and explain the following three Integration test approaches : [8] i) Big-Bang Integration Testing. ii) Bottom-Up Integration Testing. iii) Top-Down Integration Testing. [3664] - 251 -3-

Formatting page ...

Formatting page ...

 

  Print intermediate debugging step

Show debugging info


 


Tags : Pune, Engineering, University of Pune, Engineering question papers, Pune University, previous year question papers, question papers, india, model question paper, pune university paper pattern, pune university syllabus, old question papers  

© 2010 - 2025 ResPaper. Terms of ServiceContact Us Advertise with us

 

pune_eng chat