Which one of the following languages over the alphabet {0,1} is described by the regular expression: (0+1)0(0+1)*0(0+1)?

Let L = L1 L2, where L1 and L2 are languages as defined below:

L1 = {ambmcanbn | m, n >= 0 }

L2 = {aibjck | i, j, k >= 0 }

Then L is

Let L={w (0 + 1)*|w has even number of 1s}, i.e. L is the set of all bit strings with even number of 1s. Which one of the regular expression below represents L?

Let L1 be a recursive language. Let L2 and L3 be languages that are recursively enumerable but not recursive. Which of the following statements is not necessarily true?

Consider the languages L1={0i1j | i != j}, L2={0i1j | i = j}, L3 = {0i1j | i = 2j+1}, L4 = {0i1j | i != 2j}. Which one of the following statements is true?Analyze which of the following concurrency control protocols ensure both 2 conflict serializability and freedom from deadlock? Explain the following: App y 7 a. 2-phase locking b. Time-stamp ordering Consider the transactions T1, T2, and T3 and the schedules S1 and S2 given below. T1: r1(X);r1(Z);w1(X);w1(Z) T2: r2(Y);r2(Z);w2(Z) T3: r3(Y);r3(X);w3(Y) 3 S1: r1(X);r3(Y);r3(X);r2(Y);r2(Z); w3(Y);w2(Z);r1(Z);w1(X);w1(Z) S2: r1(X); r3(Y); r2(Y); r3(X); r1(Z); r2(Z); w3(Y); w1(X); w2(Z); w1(Z) Analyze which one of the schedules is conflict-serializable? 4 Suppose that there is a database system that never fails. Analyze whether a Apply 7 recovery manager required for this system?

Write in detail about Hash based Indexing and Tree based Indexing? Apply 11 2 Compare I/O costs for all File Organizations? Understand 11 3 Explain in detail about ISAM? Understand 11 4 Explain B+ trees? Discuss about this Dynamic Index Structure? Understand 11 5 Demonstrate searching a given element in B+ trees? Explain with example? Understand 11 6 I ustrate insertion and deletion of an element in B+ trees with example? Apply 11 7 Write in detail about Static Hashing? Apply 11 8 Exp ain in detail about Extendible Hashing? Understand 11 9 Exp ain in detail about Linear Hashing? Understand 11 10 Compare and Contrast Extendible Hashing with Linear Hashing?

1. Discuss How can you alter and destroy tables?
2. Give the levels of data abstraction?
3. Discuss about Data Manipulation language?
4. Explain about querying relational data?
5. How can you alter and destroy tables?
6. Explain data model and list the types of data model used?
7. Discuss Transaction management?
8. Explain the Query Processor?
9. Explain the History of Data base Systems?
10. Discuss how can you change the data in the table?
11. List various types of attributes?

Write entire C++ program that reads a positive integer entered by an interactive user and then prints out

all the positive divisors of that integer in a column and in decreasing order. The program should allow the user

to repeat this process as many times as the user likes. Initially, the program should inform the user about how

the program will behave. Then the program should prompt the user for each integer that the user wishes to

enter.

The program may be terminated in any of two ways. One way is to have the program halt if the user

enters an integer that's negative or zero. In this case the user should be reminded with each prompt that the

program can be terminated in that way. Alternatively, after an integer has been entered and the divisors have

been printed, the program can ask the user whether he/she wishes to enter another integer. In this case, when

the user accidentally enters a zero or negative integer to have its divisors calculated, the program should inform

the user that the input is unacceptable and should allow the user to try again (and again!)q