Given below are two statements Statement I: LL(1) and LR are examples of Bottom up parsers. Statement II: Recursive descent parser and SLR are examples of Top down parsers In light of the above statements, choose the correct answer from the options given below

Match List I with List II

Choose the correct answer from the options given below:

In software testing, beta testing is the testing performed by _______________.

Given below are two statements
Statement I: In an undirected graph, number of odd degree vertices is even.
Statement II: In an undirected graph, sum of degrees of all vertices is even.
In light of the above statements, choose the correct answer from the options given below.

Given the following STUDENT-COURSE scheme:
STUDENT(Rollno, Name, courseno)
COURSE (courseno, coursename, capacity),
where Rollno is the primary key of relation STUDENT and courseno is the primary key of relation COURSE. Attribute coursename of COURSE takes unique values only. Which of the following query(ies) will find total number of students enrolled in each course, along with its coursename.
A. SELECT coursename, count(*) 'total' from STUDENT natural join COURSE group by coursename;
B. SELECT C.coursename, count(*) 'total' from STUDENT S, COURSE C where S.courseno=C.courseno group by coursename;
C. SELECT coursename, count(*) 'total' from COURSE C where courseno in (SELECT courseno from STUDENT);

what language is accepted by the pushdown antomachine

For which value of n is Wheel graph Wn regular?

Next five questions are based on the following passage.
Consider a domain consisting of three Boolean variables Toothache, Cavity, and Catch. The full joint distribution is a 2*2*2 table as shown in the figure below.

The probability for Cavity, given that either Toothache or Catch is true, P(Cavity | toothache V catch) is _______.

The order of a leaf node in a B+ tree is the maximum number of (value, data record pointer) pairs it can hold. Given that the block size is 1K bytes, data record pointer is 7 bytes long, the value field is 9 bytes long and a block pointer is 6 bytes long, what is the order of the leaf node?

Given the following STUDENT-COURSE scheme:
STUDENT(Rollno, Name, Courseno)
COURSE(Courseno, Coursename, Capacity),
where Rollno is the primary key of relation STUDENT and Courseno is the primary key of relation COURSE. Attribute Coursename of COURSE takes unique values only. The number of records in COURSE and STUDENT tables are 3 and 5 respectively. Following relational algebra query is executed: R=STUDENT X COURSE
Match List I with List II in context to the above problem statement.

Choose the correct answer from the options given below:

How many ways are there to assign 5 different jobs to 4 different employees if every employee is assigned at least 1 job?

Next five questions are based on the following passage. Consider a domain consisting of three Boolean variables Toothache, Cavity, and Catch. The full joint distribution is a 2*2*2 table as shown in the figure below.

The marginal probability of cavity P(cavity) is __________.

Consider following two statements:
Statement I: Relational database schema represents the logical design of the database.
Statement II: Current snapshot of a relation only provides the degree of the relation.
In the context to the above statements, choose the correct option from the options given below:

Which of the graphs is/are planar?

choose the correct answer from the options given below:

A data structure is required for storing a set of integers such that each of the following operations can be done in O(log n) time, where n is the number of elements in the set. Deletion of the smallest element
Insertion of an element if it is not already present in the set
Which of the following data structures can be used for this purpose?

In software engineering, what kind of notation do formal methods predominantly use?

The V components in MVC are responsible for:

Identify the correct order of the following five levels of Capability Maturity Model (from lower to higher) to measure the maturity of an organization's software process.
A. Defined
B. Optimizing
C. Initial
D. Managed
E. Repeatable
Choose the correct answer from the options given below

Given below are two statements
Statement I: Breadth-First Search is optimal when all the step costs are equal whereas uniform-cost search is optimal with any step-cost.
Statement II: When all the step costs are same uniform-cost search expends more nodes at depth d than the Breadth-First Search.
In light of the above statements, choose the correct answer from the options given below

Next five questions are based on the following passage.
Consider a domain consisting of three Boolean variables Toothache, Cavity, and Catch. The full joint distribution is a 2*2*2 table as shown in the figure below.

P(cavity V toothache) is __________.

Given a relation scheme R(x,y,z,w) with functional dependencies set F={x- &gt y, z- &gt w}. All attributes take single and atomic values only.
A. Relation R is in First Normal FORM
B. Relation R is in Second Normal FORM
C. Primary key of R is xz
Choose the correct answer from the options given below:

A system has 99.99% uptime and has a mean-time-between-failure of 1 day. How fast does the system have to repair itself in order to reach this availability goal?

Which of the following are logically equivalent?
A.¬ p →(q → r) and q →(p v r )
B. ( p →q)→r and p →(q →r)
C. (p →q )→( r → s) and (p → r)→(q → s)
Choose the correct answer from the options given below:

Consider the following 3 processes with the length of the CPU burst time given in milliseconds:

What is the average waiting time for these processes if they are scheduled using the preemptive shortest job first scheduling algorithm?