ISRO Scientist or Engineer Computer Science 2015
For the following questions answer them individually
If the sequence of operations — push (1), push (2), pop, push (1), push (2), pop, pop, pop,push (2), pop are performed on a stack, the sequence of popped out values
A machine needs a minimum of 100 sec to sort 1000 names by quick sort. The minimum time needed to sort 100 names will be approximately
Six files Fl, F2, F3, F4, F5 and F6 have 100, 200, 50, 80, 120, 150 records respectively.In what order should they be stored so as to optimize act. Assume eachfile is accessed with the same frequency
A hash table with 10 buckets with one slot per bucket is depicted in fig. The symbols, S1 and S7 are initially entered using a hashing function with linear probing. The maximum number of comparisons needed in searching an item that is not present is
The queue data structure is to be realized by using stack. The number of stacks needed would be
Consider the following Entity Relationship Diagram (ERD)
Which of the following possible relations will not hold if the above ERD is mapped into a relation model?
Consider the following log sequence of two transactions on a bank account, with initial balance 12000, that transfer 2000 to a mortgage payment and, then apply a 5% interest
(i) T1 start
(ii) T1 Bold = 12000 new = 10000
(iii) T1M old =0 new = 2000
(iv) Tl commit
(v) T2 start
(vi) T2Bold= 10000 new = 10500
(vii) T2 commit
Suppose the database system crashedjust before log record 7 is written. Whenthe system is restarted, which one statementis true of the recovery procedure?
Given a block can hold either 3 records or 10 key pointers. A database contains n records, then how many blocks do we need to hold the data file and the dense index
Let R =(A,B,C,D, E,F) be a relation scheme with the following dependencies $$C \rightarrow F, E \rightarrow A, EC \rightarrow D,A \rightarrow B.$$ Which of the following is a key for R?
