.... How to Find Your Subject Study Group & Join ....   .... Find Your Subject Study Group & Join ....

We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>

www.vustudents.ning.com

Study Groups By Subject code Wise (Click Below on your university link & Join Your Subject Group)

[ + VU Study Groups Subject Code Wise ]  [ + COMSATS Virtual Campus Study Groups Subject Code Wise ]

Looking For Something at vustudents.ning.com?Search Here

# CS 402 upcoming GDB

Dear Students,

GDB of the subject Theory of Automata (CS402) is going to upload in a couple of days, before submitting the GDB, please read all instructions thoroughly.

The GDB will remain open for two days (48 hours).

You may submit your GDB from “July 20, 2017 To July 21, 2017, 11:59 PM”

GDB Topic:

“What comes to your mind in terms of automata theory when we talk about CPU and Computer? Justify your answer with scientific reason(s).”

Views: 1619

### Replies to This Discussion

Our main purpose here discussion not just Solution

We are here with you hands in hands to facilitate your learning and do not appreciate the idea of copying or replicating solutions. Read More>>

Note:-

For Important Helping Material related to this subject (Solved MCQs, Short Notes, Solved past Papers, E-Books, FAQ,Short Questions Answers & more). You must view all the featured Discussion in this subject group.

For how you can view all the Featured discussions click on the Back to Subject Name Discussions link below the title of this Discussion & then under featured Discussion corner click on the view all link.

&

.... How to Find Your Subject Study Group & Join ....

cs402 ki gdb chahiay

any one help in GDB

Imagine a Modern CPU. Every bit in a machine can only be in two states (0 or 1). Therefore, there are a finite number of possible states. In addition, when considering the parts of a computer a CPU interacts with, there are a finite number of possible inputs from the computer's mouse, keyboard, hard disk, different slot cards, etc. As a result, one can conclude that a CPU can be modeled as a finite-state machine.

Now, consider a computer. Although every bit in a machine can only be in two different states (0 or 1), there are an infinite number of interactions within the computer as a whole. It becomes exceeding difficult to model the workings of a computer within the constraints of a finite-state machine. However, higher-level, infinite and more powerful automata would be capable of carrying out this task

Cs402 gdb
when we talk about computers We'll delve into the essence of what a computer really is, which will then let us examine different kinds of computational problems. Some of these problems are easy to compute, some are hard to compute, and some cannot even be computed at all.
CPU can do basically exactly what a Turing machine can do. But: The reality it is build in gives the CPU limitations, such as the amount of memory it can access. If we assume the CPU has only finite memory available, it resembles to a TM with constant space, making your CPU as powerful as a DFA - which can be easily simulated by a PDA.

Dear Students Don’t wait for solution post your problems here and discuss ... after discussion a perfect solution will come in a result. So, Start it now, replies here give your comments according to your knowledge and understandings....

Cs402 gdb
when we talk about computers We'll delve into the essence of what a computer really is, which will then let us examine different kinds of computational problems. Some of these problems are easy to compute, some are hard to compute, and some cannot even be computed at all.
CPU can do basically exactly what a Turing machine can do. But: The reality it is build in gives the CPU limitations, such as the amount of memory it can access. If we assume the CPU has only finite memory available, it resembles to a TM with constant space, making your CPU as powerful as a DFA - which can be easily simulated by a PDA.
93Hvt.99

Automata theory is the study of abstract machines and automata, as well as the computational problems that can be solved using them. It is a theory in theoretical computer science and discrete mathematics (a subject of study in both mathematics and computer science).

## Forum Categorizes

Job's & Careers (Latest Jobs)

Scholarship (Latest Scholarships)

Internship (Latest Internships)

::::::::::: More Categorizes :::::::::::

## Latest Activity

+" ᒪᗩᑭᗩTᗩ updated their profile
6 minutes ago
20 minutes ago
زھرا علی updated their profile
20 minutes ago
38 minutes ago
1 hour ago
K*A*V*I*S*H updated their profile
2 hours ago

✿, Pakistan