Q. Consider the expression T & F | T. What is the number of ways in which the expression can be parenthesized so that the output is T (true)?

View solution

Q. Consider the expression T & F ∧ T. What is the number of ways in which the expression can be parenthesized so that the output is T (true)?

View solution

Q. Consider the expression T | F ∧ T. In how many ways can the expression be parenthesized so that the output is F (false)?

View solution

Q. Which of the following gives the total number of ways of parenthesizing an expression with n + 1 terms?

View solution

Q. What is the maximum number of ways in which a boolean expression with n + 1 terms can be parenthesized, such that the output is true?

View solution

Q. How many different insertion sequences of the key values using the same hash function and linear probing will result in the hash table shown above?

View solution

Q. If ' h ' is a hashing function and it is used to hash ' n ' keys into a table of size ' m ' where n <= m . What is the expected number of collisions involving a particular key ' x ' ?

View solution

Q. Hashing technique which allocates fixed number of buckets is classified as

View solution

Q. Consider a hash table of size seven, with starting index zero, and a hash function (3x + 4)mod7. Assuming the hash table is initially empty, which of the following is the contents of the table when the sequence 1, 3, 8, 10 is inserted into the table using closed hashing? Note that _ denotes an empty location in the table.

View solution

Q. In linear hashing, formula used to calculate number of records if blocking factor, loading factor and file buckets are known is as

View solution

Q. Given a hash table T with 25 slots that stores 2000 elements, the load factor α for T is __________

View solution

Q. Which of these are core interfaces in the collection framework. Select the one correct answer.

View solution