Showing posts with label IT. Show all posts
Showing posts with label IT. Show all posts

Saturday, April 12, 2014

Operating Systems For Computational Devices Semester 5 (May 2010)

Operating Systems For Computatio
Operating Systems For Computational Devices Semester 5
(Revised Course)
(3 Hours) May 2010

 
AN- 4309
[Total Marks : 100]
N.B.: (1) Questions No.1 is compulsory.  
  (2) Attempt any four questions out of remaining six questions.  
  (3) Assume suitable data wherever required but justify the same.  
  (4) All questions carry equal marks.  
  (5) Answer to each new questions to be started on a fresh page.  
  (6) Figures to the right in brackets indicate full marks.
 
 
 
1. (a) What are the various real-time CPU scheduling algorithms. Explain each one in brief. 10
 
  (b) What are requirements of mutual exclusion? Explain Peterson's algorithm for mutual exclusion. 10
 
       
2. (a) What are two difference between user-level threads and kernel-level threads? Under what circumstances is one type better than the other? 10
  (b) Consider the following page reference string:-
1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6
How many page fault would occur for the following replacement algorithms assuming one, two, three, four, five, six or seven frames?
     -- LRU Replacement
     -- FIFO Replacement
     -- Optimal Replacement.
 
 
3. (a) How does DMA increase system concurrency? How does it complicate hardware design? 10
 
  (b) How do caches help improve performance? Why do systems not use more or larger caches if they are so useful. 10
 
4. (a) What are the various disk-scheduling algorithms. Explain each one in brief. 10
  (b) Consider the following segment table:-
 
Segment Phase Length
0
1
2
3
4
219
2300
90
1327
1952
600
14
100
580
96
What are the physical addresses for the following logical addresses?
     (i) 0,430,  (ii)  1, 10,   (iii)  2,500,   (iv)  3,400,   (v)   4, 112.


 
 
       
5. (a) What are the four conditions that create deadlock? Explain deadlock prevention and avoidance techniques.  10
 
  (b) Given five memory partitions of 100 KB, 200 KB, 300 KB, and 600 KB (in order), how would the first-fit, best-fit, and worst-fit algorithms place processes of 212 KB, 417 KB, 112 KB, and 426 KB (in order)? Which algorithm makes the most efficient use of memory? 10
 
       
6. (a) What are the various buffering techniques? Explain each one in detail. 10
  (b) Explain file allocation methods in details. 10
 
7. Write short note on any four of the following :- 20
  (a) Monolithic Vs. Micro Kernels  
  (b) Comparison of any two RTOS  
  (c) Vx works 5.X  
  (d) NOS Vs. DOS  
  (e) Race Condition  
  (f) Inodes.  
       

Also see Operating systems for computational devices question papers for December 2009

Friday, April 11, 2014

Information Technology, Semester 5 (May 2012), Object Oriented Analysis and Design (OOAD)

Information Technology, Semester 5 (May 2012)
Object Oriented Analysis and Design (OOAD)
(Revised Course)
Con. 4739-12
GN-9372
(3 Hours)
[Total Mark: 100]
N.B. (1) Question No 1 is compulsory.
(2) Attempt any four questions out of the remaining six questions.

1. (a) How is recursion represented in a sequence diagram ? (20 Marks)
(b) How is association modeled as a class?

(c) How is generalization / specialization contrasted with more code reuse?

(d) What are the aim and principal of modeling?

2. (a) Contrast action state Vs activity state. How are looking and joining used in activity diagram? Illustrate with an example. (10 Marks)
(b) Sketch the use case diagram for modeling a hospital information system aimed at collecting and storing complete information pertaining to the patients’ treatment history and disease behavior where actors could be doctor, lab technician, patient, duty nurse, receptionist, visitors etc. (10 Marks)

3. (a) What are interaction diagrams? What are their contents and common properties?--(10 Marks)
Define semantic equivalence between two kinds of interaction diagrams.

(b) Construct the state diagram and interaction diagram for the online Reservation system. (10 Marks)

4. (a) Engineering Admission procedure is as follows :- (10 Marks)
  • DTE advertises the date of CET Entrance examination.
  • Students has to apply for entrance examinations.
  • Results announced by DTE.
  • Student has to fill up the option form to select the college of his/her choice.
  • DTE displays allotment list in the web site and intimation to all colleges.
  • Students should visit the allotted colleges and complete the admission procedure.
  • Draw the activity Diagram for the above process.
(b) Draw the state transition diagram for online Shopping books. (10 Marks)

5. (a) Explain object oriented metrics and testing. (10 Marks)
(b) Draw a sequence diagram for registering a new e-mail account. (10 Marks)

6. (a) Describe four phase of RUP in detail. (10 Marks)
(b) How deployment diagram are useful in modeling a fully distributed system. (10 Marks)

7. Write short notes on (any four): - (20Marks)
  1. CRC
  2. Test Cases
  3. Nested State Diagram
  4. Architectural Frame Work
  5. Multiplicity and generalization
Also see Object oriented analysis and design question papers May 2013

OOAD(Object Oriented Analysis and Design) May 2013 Semester 5th, BE IT

OOAD(Object Oriented Analysis and Design) May 2013 Semester 5th, BE IT 

Con. 10011-13.                                                                                 GS-9279
                                                     (3 Hours)                              [Total Marks:100]

N.B. (1) Question No. 1 is compulsory.
         (2) Attempt any four questions, out of remaining questtions.
         (3) Draw neat and clean diagram, wherever required.
         (4) Assume suitable data,if necessary.

Q1.ACarefully study the following case study and answer the following questions.[10]
Draw a class diagram for an information modeling system for a school
School has one more Department. Department offers one or more Subjects.A
particular subject will be offered by only one department.Department has instuctiors and
instructors can work for one or more departments.Student can enrol in upto 5 subjects
in a School.Instuctors can teach upto 3 subjects.The same subject can be taught by
different instructors.Students can be enrolled in more than one school.

Q1.B

Explain the following with suitable examples

[10]
(a) Association
(b) Aggregation
(c) Multiplicity
(d) Generalization

Q2.A

Explain the different types of Cohesion and Coupling

[10]

Q2.B

What is Requirment? Explain the different types of Requirements in detail.

[10]

Q3.A

Write the problem statement and Draw a Deployment diagram for an online "Airline

[10]
Reservation System"

Q3.B

What are the design principles? Explain the difficulties and risk in design?

[10]

Q4.A

Draw the Sequence diagram for the following scenario.

[10]
A customer wants to draw money from his bank account. He enters his card into an
ATM(automated teller machine). The ATM machine prompts "Enter PIN". The customer
enters his PIN. The ATM (internally) retrives the bank account number from the card. The
ATM encrypts the PIN and the account number and sends it over to the bank. The bank
verifies the encypted account and PIN number. If the PIN number is correct, the ATM
displays "Enter Amount". Draws money from the bank account and pays out the amount.

Q4.B

Draw the Activity diagram for the scenario in Q4 (a), show swim lanes

[10]

Q5.A

Draw Use Case digram for the following system, clearly show the include and

[10]
extends relationship between usecases
A compterized library system for a university keeps track of all books and periodicals in
the library and their check-out status. Ceckout and return are automated through a bar
code reader (an external device). The libray system also interfaces with an external
relatonal database which stores information about the library users (students, faculty,
and staff),including whether they have any library items checked out . Library users can
access the catalog and recall books and periodicals. Library employees have the same
access as well as additional capabilities (e.g., listing the status of an item).

Q5.B

Differentiable between static and Dynamic modeling in detail

[10]

Q6.A

Enlist the design pattern and explain any two Design pattern

[10]

Q6.B

For a Library management system design the test cases for the

[10]
"issue and retun of book"

Q7.

Write Short Notes on: (Any Two)
 [20]
 a)Testing Stratergies
 b)User Interface Design Principles
 c)Framework and Comonents
 d)Software quality Assurance
 e)Mapping Model to Code
  f)State Modeling in UML

Also see Object oriented analysis and design question papers December 2012

Thursday, April 10, 2014

Third Year (I.T.) Semester 5th (December 2013) Object Oriented Analysis Design (OOAD)

T.E. (I.T.) Sem Vth (December 2013)
Object Oriented Analysis Design (OOAD)
Con. 7085-13.
LJ-11437
(3 Hours)
Toal Marks : 100
N.B. : (1) Question No 1 is compulsory.
(2) Attempt any four questions of the remaining six questions.
(3) Diagram should be neat and clean.
(4) Assume suitable data if necessary.
1. (a) Explain the following feature s of Object Orientation with Suitable examples.-- (10 Marks)
  1. Encapsulation
  2. Aggregation
  3. Association
  4. Inheritance
  5. Generalization
(b) Study the following case study and give answers of the of the following questions.—(10 Marks)
  1. Identify actors, goals and use cases.
  2. Draw a system level use case diagram clearly stating the difference between include and extend.
Knowledge Books Store would like to establish a internet based Online Books Store. The customer can interactively select any book from the category, fictional, nonfictional, and educational. They can then examine the price and short description and cost of the book, select the book they want to purchase and proceed to paying for them. To complete the payment a form must be filled out with shipping and payment information. When the order is confirmed, a confirmation email is sent to the customer, with the details of the order and reference number. The reference number can be used to check the status of the order online. The system must verify the credential of the customer, request the book from the ware house, print an invoice and request a delivery to customer.

2. (a) What is requirement ? What are functional and non- functional Requirements? – (10 Marks)
From the Q .1 B (case study) identify and explain five functional and five non- functional requirements.
(b) What are the design principles? Explain the difficulties and risk in design?--(10 Marks)
3. (a) Explain the various types of cohesion and coupling .—(10 Marks)
(b) Draw start char diagram for automatic transmission system for gears in the car. Car can only start in neutral position. Manual selection is to be done to move to either reverse gear or higher gears. Upper gears are first, second, third and fourth and changes automatically based on the speed of the car.—(10 Marks)
4. (a) Draw the Activity diagram for “Online shopping Scenario” show swim lanes. –(10 Marks)
(b) Explain the various software Testing Strategies. –(10 Marks)
5. (a) Draw sequence diagram for withdrawing money from ATM machine.--(10 Marks)
(b) What is design pattern? Explain any two design pattern. –(10 Marks)
6. (a) For a Library management system, design the test cases for the “issue and return of book”.—(10 Marks)
(b) You are appointed as a consultant for Intranet Development for your college, write a detailed problem statement for the problem, and draw the Deployment diagram.--(10 Marks)
7. Write a short notes on (any two):---(10 Marks)
  • User Interface Design Principles
  • Mapping Model to Code
  • Nested State Diagram
  • Interaction Modeling in UML
  • Frameworks and Components
Also see Object oriented analysis and design question papers for December 2009

Wednesday, April 9, 2014

S.E. (IT) Semester III GUI & Database Management / IT (May 2013)


S.E. (IT) Semr III


GUI & Database Management / IT (May 2013)
Con. 6614-13
GS-6543
(3 Hours)
[Total Marks: 100]
N.B.: (1) Question No. 1 is compulsory.
(2) Attempt any four questions from remaining six questions.
1. (a) What is the role of DBMS, and what are its advantages? – (10 Marks)
(b) Explain in detail in built control and Active- X control in VB. – (10 Marks)
2. (a) Explain the following terms with example:- (10 Marks)
  1. An entity
  2. A weak relationship
  3. A strong relationship
  4. A recursive relationship
(b) Use the small database shown in figure (1) and answer the questions: - (10 Marks)
  1. Identify the primary keys
  2. Identify the foreign keys
  3. Create the Entity Relationship Model (ERM)
  4. Create the relational database.
Table name: Student
Stud_noStud_NameStud_ DOB
10Bhuvi15-8-90
11Dhriti26-1-92
12Shree5-9-95

Table name : Subject
Sub_ codeSub_ name Stud_no
301 IT ThDBMS 12
302 IT ThOOPS 11
303 IT ThAT 12
304 IT ThM- III 10Figure1 small database
305 IT Pr DBMS11
306 IT PrOOPS12
307 IT PrAT11
3. (a) Describe two phase locking protocols and graph based protocols.—(10 Marks)
(b) Explain the use of logs and check points for recovery in a database. – (10 Marks)
4. (a) Explain the terms ODBC and OLEDB. – (10 Marks)
(b) What are the features of GUI ? Explain decision making statements and loop structures statement in VB. – (10 Marks)
5. (a) What do you mean deadlocks in database ? Explain the techniques for deadlock prevention and deadlock detection. –(10 marks)
(b) Why transaction processing systems usually allow concurrent executions? Give reasons. – (10 Marks)

6. (a) What do you mean by a virtual table or a view. What are its characteristics? -- (10 Marks)
(b) Write a note on relational algebra. – (10 Marks)
7. Write short notes on (any four):--- (10 Marks)
  • ACID properties
  • OODBMS and ORDBMS
  • DBA
  • Murphy’s law of GUI design
  • EER Model
Also see GUI & database management question papers May 2009


Tuesday, April 8, 2014

Data Structure & Algorithms (December 2011)

Data Structure & Algorithms (December 2011)
(3 Hours)
[Total Mark 100]
N.B.: (1) Question No. 1 is compulsory.
(2) Attempt any four questions from remaining six questions.

1. (a) Explain the Asymptotic notations to measure the time complexity of algorithm.—5 Marks
(b) What are linear and non – linear data structures? ---- 5 Marks
(c) Explain vectors with at least five methods.—5 Marks
(d) Discuss circular and priority Queue.—5 Marks

2. (a) Write a program to create ‘QUEUE’ ADT using Linked list implementation . ADT should support                 following operations:--10 Marks
  1. Create queue
  2. Enqueue
  3. Dqueue
  4. Display
(b) Explain Huffman Coding Algorithm with example.—10 Marks

3. (a) Write a program to implement Quick Sort and comment on its complexity. –10 Marks
    (b) Implement the function to delete a node from Binary search tree. (Consider all possible cases).
         10 Marks
4. (a) Write a program to create Binary tree and inorder, preorder and postorder traversal of the tree.—
          10 Marks
(b) Write any pattern matching algorithm and explain it with suitable example.—10 Marks

5. (a) Using Prism’s and Kruskal’s algorithm, find minimum spanning tree for the following graph. –
          10 Marks

(b) What is Hashing ? What is meant by Collision? Hash the following in table of size 10. Use any two                 collision resolution techniques:--10 Marks
9933 23445643 19

6. (a
) Given a ‘INFIX’ expression, write a program to convert it to its ‘POSTFIXX’ form. – 10 Marks
    (b) Write an algorithm to traverse a graph using.—10 Marks
  1. Breath First Search
  2. Depth First Search
7. Write short notes on any four of the following :--20 Marks
  1. Red Black Trees
  2. Searching Algorithms
  3. Recursion
  4. Doubly Linked List
  5. Expression Trees
  6. Comparison of Sorting Algorithms
Also see Data structure & algorithms question papers for December 2013



Data Structure & Algorithms ( Mumbai University Question Papers - Information Technology (IT) - Second Year (SE) - Semester 3 & 4 (December-2010)

New Page 1 New Page 1
Data Structure & Algorithms


Data Structure & Algorithms
(3 Hours)
S.E./I.T./Sem - III
GT-6309
[Total Marks :- 100]
1 a) What are linear and non-linear data structures?
b) Why is it necessary to analyze an algorithm?
c) What are Asymptotic notation
d) What is an Abstract data type?

 
20
2. a) Explain how a stack can be used to execute computation of mathematical expressions. For example consider the expression (a+b) * (b-c)

b) Write a program to create single link list and display the list

 
10


10
3. a) Explain map abstract data type.

b) What are circular and priority queues.

 
10

10
4. a) What is binary search tree. Suppose the following list of letters is inserted
     in order into an empty BST
     J  R  D  G  T  E  M  P  A  F  Q. Find the final tree.

 
10

10
5. a) Explain selection sort and write a program to implement selection sort.

b) Write an algorithm and explain with an example radix sort method.
10

10

 
6. a) Find out the minimum cost spanning tree for below graph using kruskals
    and prims method.



b) Write any pattern matching algorithm and explain it with suitable example.
10




10


 
7. Write short notes on any four:-
 b) Red-Black trees
 c) Text Compression
 d) Graph Traversals
 e) Recursion
 f) Comparison of sorting algorithms.
 g) Searching algorithm
20

Also see Data structure & algorithms question papers for December 2010