Trending ▼   ResFinder  

2003 Course Computer Techniques & Applications

3 pages, 37 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 [3764]-290 P1439 B.E. (Instrumentation & Control) COMPUTER TECHNIQUES AND APPLICATIONS (2003 Course) Time : 3 Hours] [Max. Marks : 100 Instructions to 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. SECTION - I Q1) a) Four processes (P1, P 2, P 3, P 4) arrive at time 0, 2, 4, 5 with their CPU bursts of 7, 4, 1 and 4 respectively. For each of the following CPU scheduling algorithms, draw the Gantt chart and determine the average turn around time and average waiting time, showing all the calculations in detail. [12] i) First Come First Serve (FCFS). ii) Shortest Job First (SJF) (non preemptive). iii) Shortest Job First (SJF) (preemptive). iv) Round Robin (RR) with a time quantum of 4 CPU bursts. b) With neat diagrams explain the following Disk scheduling algorithms.[6] i) SCAN. ii) C-SCAN. iii) C-LOOK. OR Q2) a) b) Explain the different types of Operating Systems (any four): [8] Explain the following with respect to process management: [10] i) Job Queue. iii) Ready Queue. v) ii) Device Queue. iv) Mid term scheduler. Context Switch. P.T.O. Q3) a) b) With the help of neat diagram, explain the concept of thrashing. [8] With neat diagrams, explain any four types of Directory Structures. [8] OR Q4) a) With neat diagrams explain the following page table structures. i) b) Q5) a) Hierarchical paging. ii) Inverted page table structure. List the various file allocation methods and explain the working with neat diagrams. [8] Write a note on Systolic Arrays on the basis of following points: i) [8] Functional block diagram. ii) b) [8] Working. Explain Flynn s classification of Parallel computers. [8] OR Q6) a) Compare the following with respect to parallel computers: i) b) Loosely Coupled and tightly coupled systems. ii) [8] UMA and NUMA parallel computers. Design a Huffman code for a source that puts out symbols a1, a2, a3 and a4 with their respective probabilities of occurrence as 0.1, 0.3, 0.2 and 0.4. [8] SECTION - II Q7) a) Write a note on IEEE 802.3 with respect to following points: i) b) Data Frame. ii) [8] Description of Working. Explain LAN and LAN topologies. [8] OR Q8) Write short notes: a) Industrial Ethernet. b) [16] TCP / IP reference model. Q9) a) b) [3764]-290 Discuss the various levels of CMM. [8] List and explain the basic operating modes of ARM processors. [8] 2 Q10)a) b) Q11)a) b) Q12)a) b) OR Discuss the architectural overview of ARM 922. Write a short note on IEEE 1394. Explain white box and black box testing. Discuss the advantages and limitations of each. [10] Discuss CASE and CASE tools. [8] OR What is software testing? Discuss the various software testing strategies. [10] Explain in brief the Software Development Life Cycle. [8] Y [3764]-290 [8] [8] 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