திங்கள், 30 டிசம்பர், 2013

CP7102 ADVANCED DATA STRUCTURES&ALGORITHMS

DEPARTMENT OF CSE

SECOND INTERNAL ASSESSMENT
 

SUB CODE: CP7102   SUB NAME: ADVANCED DATA STRUCTURES&ALGORITHMS 
Class: I – M.E (CSE) / I Semester                                                                               Time:1:30 hours
                                                                                                                                   Maximum: 50 marks
_____________________________________________________________________________________
                                                          Part: A                                                            (5x2=10)
Answer all the questions.

1.      Mention Subtle  Points?.
2.       Write notes about Mutual  Exclusion-Time?
3.       What is Formal Definitions?
4.       Write notes on Java Memory Model?
5.       Define Bounded Timestamps?      

Part: B                                                       (4X10=40)
 Answer any four questions:-                                 
6.      Prove NP-Completeness.
7.      Explain Lamport’s Bakery Algorithm with example.
8.      With an example  perform Concurrency  and  Correctness.
9.      Explain  Optimization Problems with a Random Structure.
  1. Explain Linearizability with example.


கருத்துகள் இல்லை:

கருத்துரையிடுக