lab external time tables

CN&CASETOOLS LAB

CN&CASE TOOLS                                                                     LAB

BATCH NO	NUMBERS	DATE	TIMINGS
B1	09-501     TO 09-526	3/04/2012	9:30AM TO 12:30PM
B2	09-527    TO 09-549	3/04/2012	1:00PM   TO 4:00PM
B3	09-551   TO 09-577	4/04/2012	9:30AM     TO 12:30PM
B4	09-578    TO LAST	4/04/2012	1:00PM   TO 4:00PM

CD&OS LAB

CD &OS TOOLS LAB

BATCH NO	NUMBERS	DATE	TIMINGS
B1	09-501     TO 09-526	4/04/2012	9:30AM TO 12:30PM
B2	09-527    TO 09-549	4/04/2012	1:00PM   TO 4:00PM
B3	09-551   TO 09-577	3/04/2012	9:30AM     TO 12:30PM
B4	09-578    TO LAST	3/04/2012	1:00PM   TO 4:00PM

OS QUESTIONS FOR SECOND MID

unit-V
1.what is deadlock?condition of dead lock?explain characterziation?
2.explain deadlock avoidence?dead lock prevention?
3.explain i/o hardware and I/O interface
unit-VI
4.what is file and what are different acces methods
5.explain different allocation methods for files and how to manage
  free space?
6.explain file sharing and protection and explain directory
  implementation?
unit-VII
7.disk scheduling
8.explain about RAID structure and swap space managenent
9.explain storage implementation &disk structue
unit-VIII
10.implementation of access matrix.cryptography as asecurity tool?

AI QUESTION

Artificial Intelligence and Neural Network

III B Tech CSE, Sem II

1. Define Algorithm. With suitable example define Best first search Algorithm                    [5]

2. Compare between Greedy Best first search algorithm and A* Algorithm                           [5]

3.a. What is the condition for admissibility of A* Search Algorithm?                                          [2]

b. What is resolution? Explain resolution refutation                                                                         [3]

4. Define min-max procedure in Game playing and explain about alpha- beta pruning     [5]

5. Define FOL, Explain the terms Literals, clauses. What are the rules of Inference?          [5]

6.write  the predicate calculus fot the statement                                                                                              [5]

“In every city there is  thief who is beaten be every policemen in the city”’