Which of the following statements is/are FALSE?(1) For every non-deterministic Turing machine, there exists an equivalent deterministic Turing machine.(2) Turing recognisable languages are closed under union and complementation.(3) Turing decidable languages are closed under intersection and complementation.(4) Turing recognisable languages are closed under union and intersection.

# CS & IT

## Which of the following statements are TRUE?(1) The problem of determining whether there exists a cyc….

Which of the following statements are TRUE?(1) The problem of determining whether there exists a cycle in an undirected graph is in P.(2) The problem of determining whether there exists a cycle in an undirected graph is in NP.(3) If a problem A is NP-complete, there exists a non-deterministic...

## What is the time complexity of Bellman-Ford single-source shortest path algorithm on a complete grap….

What is the time complexity of Bellman-Ford single-source shortest path algorithm on a complete graph of n vertices?

## In a k-way set associative cache, the cache is divided into v sets, each of which consists of k line….

In a k-way set associative cache, the cache is divided into v sets, each of which consists of k lines. The lines of a set are placed in sequence one after another. The lines in set s are sequenced before the lines in set (s+1). The main memory blocks...

## Which one of the following expressions does NOT represent exclusive NOR of x and y?….

Which one of the following expressions does NOT represent exclusive NOR of x and y?

### Fill this form and get best deals on " Coaching classes"

- 100% genuine institutes aiming to help you ace studies
- Get immediate response from the institutes
- Compare institutes and pick only the best!
- Feel free to choose the institute you like, and rest will be taken care of

## Which one of the following functions is continuous at x = 3?….

Which one of the following functions is continuous at x = 3?

## Function f(x) is known at the following points: x 0 ….

Function f(x) is known at the following points: x 0 0.3 0.6 0.9 1.2 1.5 1.8 2.1 2.4 2.7 3.0 f(x) 0 0.09 0.36 0.81 1.44 2.25 3.24 4.41 5.76 7.29 9.00 The value of (x) dx computed using the trapezoidal rule is

## Which of the following statements is/are TRUE for undirected graphs?P: Number of odd degree vertices….

Which of the following statements is/are TRUE for undirected graphs?P: Number of odd degree vertices is even.Q: Sum of degrees of all vertices is even.

## Consider an undirected random graph of eight vertices. The probability that there is an edge between….

Consider an undirected random graph of eight vertices. The probability that there is an edge between a pair of vertices is ½. What is the expected number of unordered cycles of length three?

- IIT-JEE, NEET, CAT
- Bank PO, SSC, Railways
- Study Abroad

#### Recent Topics

- zune software for htc windows phone 7.5 free download free
- Easy and Short Way to Success in AZ-900 Exam | Dumpsgroup.com
- AAA Presented 5th Edition of Dr Sarojini Naidu Award for Women
- Green CBD Gummies - What Is Green CBD? Check Here And Buy Now!
- Where do I get SAP-C01 Practice Exam Questions in 2021?
- How do Russell Brand CBD Gummies work in our bodies?
- EdbMails for Exchange server migration