Scribd
Upload
2 views2 pages

Note?

The document discusses the concepts of decidable and undecidable problems, highlighting the halting problem as undecidable and the existence of algorithms for decidable problems. It distinguishes between intractable problems, like the Traveling Salesman Problem, and tractable problems with reasonable run times. Additionally, it defines data structures and algorithms, providing examples such as arrays and searching techniques like linear and binary search.

Uploaded by

ELHAM ?
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
2 views2 pages

Note?

The document discusses the concepts of decidable and undecidable problems, highlighting the halting problem as undecidable and the existence of algorithms for decidable problems. It distinguishes between intractable problems, like the Traveling Salesman Problem, and tractable problems with reasonable run times. Additionally, it defines data structures and algorithms, providing examples such as arrays and searching techniques like linear and binary search.

Uploaded by

ELHAM ?
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Undecidable Decidable

halting problem we can devise algorithms.

intractable tractable
if the best-known algorithms take a very long time. if algorithms with a reasonable run time can

Examples: Traveling Salesman Problem, Clique, be developed

data Structure is the organization of data in a computer’s memory or in a disk file. Examples: Arrays, stacks, linked list

Algorithms are the procedure; a software program uses to manipulate the data in this structure.

Searching Problem
Linear Search OR Sequential Search Binary Search

You might also like