esl assignments

CFCA UNIT-3 question bank

CFCA

UNIT- 3

Question Bank

Q1. What is Digital evidence?

Q2. Explain role of computers in violent crime

Q3. Write short note on investigative reconstruction in violent   crime.

Q4. Explain time as an alibi with example.

Q5. Explain time as an alibi with example.

Q6. Explain digital Evidence as Alibi

Q6. Write short note on Computer Intrusion

Q7. Write short note on forensic preservation of volatile data.

DBMS E-R diagram ppts Unit-1

DBMS study Material for Unit-I

CFCA Question bank Unit 2

CFCA UNIT 1 Question bank

Osd Unit-I PPT

DBMS Previous Yr. Question Paper

CFCA Unit 3 ppts

OSD QUESTION PAPER

DPES

DHOLE PATIL COLLEGE OF ENGINEERING WAGHOLI , PUNE

DEPARTMENT OF COMPUTER ENGINEERING

(FIRST TERM FOR ACADEMIC YEAR 2015-2016 )                                                                   SUBJECT:OSD (UNIT-I)                                    MARKS:25

CLASS TEST-I                                                                                                       Date: 29/6/15

Q1 Explain with neat diagram UNIX system architecture.                                                 [6]

Q2.Write short note on MBR                                                                                           [4]

Q3 State the advantages and disadvantages of Buffer chache.                                           [6]

Q4. What are system calls? Explain 1.fork () 2.open () 3.read ()                                      [4]

Q5 Explain in detail Monolithic and Micro Kernel                                                            [5]

Q6 Explain the race condition in assigning inodes.                                                            [4]

Q7 Elaborate on the following algorithms in brief (any two)                                              [8]

1 iget

2 ifree

3 namei

4 getblk

CFCA Unit-2 ppts

OPERATING SYSTEMS DESIGN (OSD) QUESTION BANK

QUESTION BANK

UNIT I

2 MARKS QUESTIONS

1. Write short note on Master Boot Record.

2.Explain the term inode.

3.Define swap space management.

4.What is difference between MBR and GRUB.

4 MARKS QUESTIONS

1    1. Explain the techniques used for free space management in a file system.

      2. Write briefly about file attributes, operations, types and structure.

      3. Explain  a) Open() b) read() c) write() d) close(). 

      4. Explain in detail monolithic and micro kernel.

J    6 MARKS QUESTIONS

1. Explain the neat diagram UNIX system architecture

2. Explain buffer management in UNIX.

3. Define operating system booting process in detail.

UNIT II

2 MARKS QUESTIONS

1. Define BASH in detail.

2. How we debug shell scripts?

3. Differentiate process and threads

4. What is wait for graph and its use in deadlock handling.

5. Define U area in reference to a process.

4 MARKS QUESTIONS

1. What is deadlock? What are necessary conditions for deadlock to occur?

2. Explain the concept of region. What does the region table entry consists of?

3. What is TLB? Why it is used?

4. Define UNIX process states in detail.

5. Define the terms  a) shell b) system calls for time

6. How we can manipulate process address space

7. Explain deadlock recovery in brief.

6 MARKS QUESTIONS

1. With given matrices explain how banker algorithm helps to determine safe state

Claim matrix C	Allocation matrix A	Resource vector R
R1       R2       R3 P1       3          2          2 P2       6          1          3 P3       3          1          4 P4       4          2          2	R1      R2       R3 P1            1        0          0 P2            6        1          2 P3            2        1           1 P4            0        0           2	R1    R2    R3             9       3       6

Available vector V: R1-0, R2-1, R3-1

2. Explain deadlock handling techniques in detail.

3. What is thread? Explain types of threads, advantages of threads and thread library in detail.

4. What is signal? How a process deals with signal?

5. Consider the following set of processes, with the length of cpu burst time given in milliseconds

Process	Burst Time	Priority
P1 P2 P3 P4 P5	10 1 2 1 5	3 1 3 4 2

The processes have assumed to have arrived in the order P1, P2, P3, P4 and P5 all at time 0

a)      Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms : FCFS, SJF, PRIORITY & ROUND ROBIN( quantum =1).

b)      Calculate average turn around time and average waiting time.

c)      Which of the algorithms result in the minimum average waiting time.

UNIT- III

2 MARKS QUESTIONS

1. Define memory management in operating systems.

2. Explain thrashing.

3. Define virtual memory concept in memory management.

4. Explain difference between compile time and load time.

5. What do you understand by logical address space and physical address space.

6. What is swapping in UNIX?

7. Explain android memory management in brief.

8. Define page faults and its types.

9. Explain Balady’s anomaly in brief

4 MARKS QUESTIONS

1.What do you understand by paging? Explain in brief with suitable diagram. Also define its advantages and disadvantages.

2. Differentiate between segmentation and paging.

3. Differentiate between internal fragmentation and external fragmentation.

4. How you can define requirements for memory management?

5. Explain data structures for demand paging.

6. Given memory partitions of  250K, 600K, 400K, 300K, 500K and 100K  (in order) how would each of the first-fit, Best-fit and Worst-fit algorithms take place processes of  232K, 419K, 99K, 576K, 315K (in order)? Which algorithm makes the most efficient use of memory?

6 MARKS QUESTIONS

1.Explain with diagram address translation in paging and segmentation system.

2. Consider the following page reference. Indicate page faults and calculate total number of page faults for optimal and LRU page replacement algorithms. The total number of available frames is 4.

              1, 2, 3, 2, 5, 6, 3, 4, 6, 3, 7, 3, 1, 5, 3, 6, 3, 4, 2, 4, 3, 4, 5, 1

3. Write an algorithm for the swapper in UNIX and explain the situations when the processes gets        swapped in and swapped out.

4. Define in brief a) LINUX memory management b) WINDOWS8 memory management.

5. If the page address stream is (2, 3, 2, 1, 5, 2, 4, 5, 3, 2, 5, 2), and frame size is 3, identify the page       faults occurred using FIFO and LRU.

      

TOC : Question Bank

UNIT-I

1.       Show by the principle of mathematical induction that n²-4n² is divisible by 3 for all n>0. (6)

2.       Define Kleen’s closure and Transitive closure.                                            (4)

3.       Consider the two regular expressions:   r=0˟+1˟ and   s=01*+10*+1*0+(0*1)*.

(a)    Find a string corresponding to s but not to r.

(b)    Find a string corresponding to both r and s.

(c)    Find a string in {0,1}* corresponding to neither r nor s.                     (6)

4.       Let L={0ⁿ1ⁿ|n>=0}. Show that L is not regular.                                             (6)

5.       Give the Regular expressions for the following languages:

(¡)  For Ʃ= {a,b},set of all string with at most  two ‘a’s                                (4)

(ii) L={ƹ,a,b,aa,ab,ba,bb}

6.       (a)Define the following formally with example:                                            

  (i)Alphabet.   (ii)Non deterministic finite automata.

   (iii)Deterministic finite automata.        (6)                               

(c)    An NFA with states 1-5 and input alphabet{a,b}has following transition table:

q δ(q,b) δ(q,b) 1 {1,2} {1} 2 {3} {3} 3 {4} {4} 4 {5}  ɸ 5  ɸ {5}

i)Draw transition diagram. ii)Calculate δ*(1,ab). iii)Calculate δ*(1,abaab).   

       7. a)  Explain the property pumping lemma of regular set. Where do we apply this

               property ?  Give the suitable example.                                                   (6)

            b) Design the NFA to recognize the following sets of strings:abc,abd,aacd.

     Assume that alphabet is {a,b,c,d}.Give the transition table and transition

    diagram both.                                                     (6)               

             c)  Differntiate between NFA and DFA.                     (4)

       8. Design a FA from given regular expression 10+(0+11)0*1.                                 (10)                                                                                                        UNIT- II

      1.Define Moore and  Mealy machine and how the equivalence of Moore and

         Mealy machine, can be  established with example. (6)                                                                 

      2.Convert the following the Moore machine into equivalent Mealy machine.

         M=({q0,q1},{a,b},{0,1},δ,λ,q0).                                                                         (4)

3. Give the Mealy machine for the following processes  “For input from (0+1)*,if input ends

    in   101,output X; if input ends in 110,output Y,otherwise output Z”.                     (8)

4. Define Mealy machine . Construct a Mealy machine which can output EVEN/ODD , if

    the total number of 1’s in the input is even or odd.The input symbols are -0 and 1.(5)

5. (a)Design a Mealy machine to find 2’s compliment of a given binary number.                 (6)

    (b)Design a Mealy machine to find 1’s compliment of a given binary number      (6)

6. Find the regular expression corresponding to each of the following subset of {0,1}*

   a)The language of all strings not containing the substring 000.

   b)The language of all strings that do not contain the substring 110

   c)The  language of all strings  containing both the 101 and 010 as a substring .   (10)

7. Convert NFA and DFA  for accepting all possible strings of 0’s and 1’s not containing 101

    substring.   Find  as a  regular expression for it.                                                               (8)

8. Show that P*(QP*)*=(P+Q)*.                                                               (4)

9. Prove or disprove each of the following about the regular expression :                              (4)

    1)(RS+R)*RS=(RR*S)*  (2)(R+S)*=R*+S*.

                             UNIT-III

                               

1.       Write short note on Chomsky hierarchy.                               (8)

2.       Construct the CFG for the regular expression (0+1)*  (8)

3.       Give CFG for set of odd length settings in {0,1}* with middle symbol ‘1’ (4)

4.       In each case find context free grammer generating given language          (8)

a)The set of odd length strings in {a,b}* with middle symbol  a.

b)The set of even length strings {a,b}*with the two middle symbols equal.

       5. Give an ambiguous grammer for if then else statement and then rewrite

            an equivalent   unambiguous grammer.                                                     (8)

6. Show that following grammer is ambiguous, S->a|absb|a A b, A->bs | a A A b   (6)

       7. Describe the closure properties of  CFL.         (10)

       8.Construct  regular grammer to FA with example.                                                    (5)

      9.Define and explain recursive and recursively ennumerable languages.          (4)

      10.Explain concurrent grammer and graph grammer.                                                                (4)

      11.Prove “ if L is recursive language so is its  compliment L^c ”                                   (5)

      12.Construct the given CFG to   Greibach Normal Form.                                           (8)

            S->CA,    A->a,      C->aB|b.