Computer Science Engineering (CSE) Exam  >  Computer Science Engineering (CSE) Tests  >  Test: Formal Verification, Risk & Dependability Analysis - Computer Science Engineering (CSE) MCQ

Test: Formal Verification, Risk & Dependability Analysis - Computer Science Engineering (CSE) MCQ


Test Description

15 Questions MCQ Test - Test: Formal Verification, Risk & Dependability Analysis

Test: Formal Verification, Risk & Dependability Analysis for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Test: Formal Verification, Risk & Dependability Analysis questions and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus.The Test: Formal Verification, Risk & Dependability Analysis MCQs are made for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, notes, meanings, examples, exercises, MCQs and online tests for Test: Formal Verification, Risk & Dependability Analysis below.
Solutions of Test: Formal Verification, Risk & Dependability Analysis questions in English are available as part of our course for Computer Science Engineering (CSE) & Test: Formal Verification, Risk & Dependability Analysis solutions in Hindi for Computer Science Engineering (CSE) course. Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free. Attempt Test: Formal Verification, Risk & Dependability Analysis | 15 questions in 25 minutes | Mock test for Computer Science Engineering (CSE) preparation | Free important questions MCQ to study for Computer Science Engineering (CSE) Exam | Download free PDF with solutions
Test: Formal Verification, Risk & Dependability Analysis - Question 1

What is meant by FOL?

Detailed Solution for Test: Formal Verification, Risk & Dependability Analysis - Question 1

Explanation: Many formal verification techniques are used and these are classified on the basis of the logics employed. The techniques are propositional logic, first order logic, and higher order logic. The FOL is the abbreviated form of the first order logic which includes the quantification.

Test: Formal Verification, Risk & Dependability Analysis - Question 2

 What is HOL?

Detailed Solution for Test: Formal Verification, Risk & Dependability Analysis - Question 2

Explanation: The formal verification techniques are classified on the basis of the logics employed. The techniques are propositional logic, first order logic, and higher order logic. The HOL is the abbreviation of the higher order logic in which the proofs are automated and manually done with some proof support.

1 Crore+ students have signed up on EduRev. Have you? Download the App
Test: Formal Verification, Risk & Dependability Analysis - Question 3

What is BDD?

Detailed Solution for Test: Formal Verification, Risk & Dependability Analysis - Question 3

Explanation: The binary decision diagram is a kind of data structure which is used to represent the Boolean function.

Test: Formal Verification, Risk & Dependability Analysis - Question 4

 Which formal verification technique consists of Boolean formula?

Detailed Solution for Test: Formal Verification, Risk & Dependability Analysis - Question 4

Explanation: The propositional logic technique is having the boolean formulas and the boolean function. The tools used in propositional logic is the tautology checker or the equivalence checker which in turn uses the binary decision diagrams which is also known as BDD.

Test: Formal Verification, Risk & Dependability Analysis - Question 5

Which of the following is also known as equivalence checker?

Detailed Solution for Test: Formal Verification, Risk & Dependability Analysis - Question 5

Explanation: The propositional logic technique consists of the boolean formulas and the boolean function. The tools used in this type of logic is the tautology checker or the equivalence checker which in turn uses the BDD or the binary decision diagrams.

Test: Formal Verification, Risk & Dependability Analysis - Question 6

Which of the following is possible to locate errors in the specification of the future bus protocol?

Detailed Solution for Test: Formal Verification, Risk & Dependability Analysis - Question 6

Explanation: The model checking was developed using the binary decision diagram and the BDD and it was possible to locate errors in the specification of the future bus protocol.

Test: Formal Verification, Risk & Dependability Analysis - Question 7

 Which of the following is a popular system for model checking?

Detailed Solution for Test: Formal Verification, Risk & Dependability Analysis - Question 7

Explanation: The EMC-system is developed by Clark and it describes the CTL formulas, which is the computational tree logics.

Test: Formal Verification, Risk & Dependability Analysis - Question 8

 What is CTL?

Detailed Solution for Test: Formal Verification, Risk & Dependability Analysis - Question 8

Explanation: The EMC-system is a popular system for model checking which is developed by Clark that describes the CTL formulas, which is also known as computational tree logics. The CTL consist of two parts, a path quantifier, and a state quantifier.

Test: Formal Verification, Risk & Dependability Analysis - Question 9

Which is a top-down method of analyzing risks?

Detailed Solution for Test: Formal Verification, Risk & Dependability Analysis - Question 9

Explanation: The FTA is Fault tree analysis which is a top-down method of analyzing risks. It starts with a damage and comes up with the reasons for the damage. The analysis is done graphically by using gates.

Test: Formal Verification, Risk & Dependability Analysis - Question 10

What is FTA?

Detailed Solution for Test: Formal Verification, Risk & Dependability Analysis - Question 10

Explanation: The FTA is also known as the Fault tree analysis which is a top-down method of analyzing risks. The analysis starts with a damage and comes up with the reasons for the damage. The analysis can be checked graphically by using gates.

Test: Formal Verification, Risk & Dependability Analysis - Question 11

Which gate is used in the geometrical representation, if a single event causes hazards?

Detailed Solution for Test: Formal Verification, Risk & Dependability Analysis - Question 11

Explanation: The fault tree analysis is done graphically by using gates mainly AND gates and OR gates. The OR gate is used to represent the single event which is hazardous. Similarly, AND gates are used in the graphical representation, if several events cause hazards.

Test: Formal Verification, Risk & Dependability Analysis - Question 12

Which analysis uses the graphical representation of hazards?

Detailed Solution for Test: Formal Verification, Risk & Dependability Analysis - Question 12

Explanation: The FTA is done graphically by using gates mainly AND gates and OR gates. The OR gate is used to represent the single event which is hazardous.

Test: Formal Verification, Risk & Dependability Analysis - Question 13

 Which gate is used in the graphical representation, if several events cause hazard?

Detailed Solution for Test: Formal Verification, Risk & Dependability Analysis - Question 13

Explanation: The fault tree analysis is done graphically by using gates. The main gates used are AND gates and OR gates. The AND gates are used in the graphical representation, if several events cause hazards.

Test: Formal Verification, Risk & Dependability Analysis - Question 14

What is FMEA?

Detailed Solution for Test: Formal Verification, Risk & Dependability Analysis - Question 14

Explanation: The FMEA is the failure mode and the effect analysis, in which the analysis starts at the components and tries to estimate their reliability.

Test: Formal Verification, Risk & Dependability Analysis - Question 15

 Which of the following can compute the exact number of clock cycles required to run an application?

Detailed Solution for Test: Formal Verification, Risk & Dependability Analysis - Question 15

Explanation: The fine-grained model has the cycle-true instruction set simulation. In this modelling, it is possible to compute the exact number of clock cycles which is required to run an application.

Information about Test: Formal Verification, Risk & Dependability Analysis Page
In this test you can find the Exam questions for Test: Formal Verification, Risk & Dependability Analysis solved & explained in the simplest way possible. Besides giving Questions and answers for Test: Formal Verification, Risk & Dependability Analysis , EduRev gives you an ample number of Online tests for practice

Top Courses for Computer Science Engineering (CSE)

Download as PDF

Top Courses for Computer Science Engineering (CSE)