Theory

Theory

University - Professional Development

β€’

41 Qs

quiz-placeholder

Similar activities

CP - YR7  - AUTUMN1 EOT QUIZ

CP - YR7 - AUTUMN1 EOT QUIZ

6th Grade - University

β€’

37 Qs

Unit 8 PPT

Unit 8 PPT

KG - University

β€’

45 Qs

Form 4 Hardware Revision

Form 4 Hardware Revision

University

β€’

40 Qs

Test 2

Test 2

University

β€’

36 Qs

Loop Control Statement in C

Loop Control Statement in C

University

β€’

41 Qs

Internet & the Web

Internet & the Web

University

β€’

40 Qs

Remidi ASTS Informatika

Remidi ASTS Informatika

7th Grade - University

β€’

40 Qs

Blockchain

Blockchain

University

β€’

40 Qs

Theory

Theory

Assessment

Quiz

β€’

Computers

β€’

University - Professional Development

β€’

Practice Problem

β€’

Easy

Created by

Amr Amin

Used 8+ times

FREE Resource

AI

Enhance your content in a minute

Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...

41 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec β€’ 1 pt

The complexity Turning machine M is a polynomial time algorithm for PATH problem

true

false

2.

MULTIPLE CHOICE QUESTION

30 sec β€’ 1 pt

A function f is computable if there is a Turing Machine M such that:

π‘ž0𝑀 >βˆ— π‘žπ‘“π‘“(𝑀) where 0<i<f, for all w∈ π·π‘œπ‘šπ‘Žπ‘–π‘› (D)

true

false

3.

MULTIPLE CHOICE QUESTION

30 sec β€’ 1 pt

NP-class is the languages that have exponential time verifiers

true

false

4.

MULTIPLE CHOICE QUESTION

30 sec β€’ 1 pt

By modifying the brute-force algorithm, We can easily obtain an exponential time algorithm for the Hamiltonian path (HAMPATH) problem

true

false

5.

MULTIPLE CHOICE QUESTION

30 sec β€’ 1 pt

The HAMPATH problem has a feature called polynomial verifiability that is important for understanding its complexity

true

false

6.

MULTIPLE CHOICE QUESTION

30 sec β€’ 1 pt

NP-class is the languages that have polynomial time verifiers

true

false

7.

MULTIPLE CHOICE QUESTION

30 sec β€’ 1 pt

A language L is Turing-Acceptable if there is a Turing machine M that accepts L and Turing-Recognizable

true

false

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Google

Continue with Google

Email

Continue with Email

Classlink

Continue with Classlink

Clever

Continue with Clever

or continue with

Microsoft

Microsoft

Apple

Apple

Others

Others

Already have an account?