My Courses
Compilers Questions and Answers MCQ– Finite Automata and Regular Expressions – 1
Questions & Answers on Compiler Introduction The section contains questions and answers on finite automata and regular expressions, cross compilers, lexical analysis and relations. Finite Automata and Regular Expressions Number of states of FSM required to simulate behaviour of a computer with a memory capable of storing “m” words, each of length ‘n’ a) m…
DATA COMMUNICATIONS AND NETWORKS PPT
DATA COMMUNICATIONS AND NETWORKS PPT BY Dr. Carl M. Rebman Download Datacommunications And Networks PPT Notes:chapter one (fall 08)chapter twochapter threechapter fourchapter seven (network concepts)chapter nine (local area networks)chapter ten chapter elevencomputer slidetcp/ipsubnet example history of the internetold chapter onept08_2008trends in data communicationLAN ConsiderationsLAN Topologies and media access control
C Programming PPT Powerpoint Presentation
C PROGRAMMING PPT BY : Dr. KHAMIS OMAR Download C Programming PPT Notes Introduction to Computers and C++Programming Introduction to C Programming Structured Program Development Program Control Functions Arrays Pointers Characters and Strings Formatted Input/Output Structures, Unions, Bit Manipulations, and Enumerations File Processing Data Structures The Preprocessor Advanced C Topics C++ As A “Better C” Classes…
Automata Theory Multiple Choice Quaestion & Answers (MCQs) Set-49
1. Are Multitape and Multitrack turing machines same? a) Yes b) No c) Somewhat yes d) Cannot tell 2. Complete the following statement: Statement : A language is turing recognizable if an only if ___________ a) an enumerator enumerates it b) it is finite c) both (a) and (b) d) none of the mentioned 3.…
Automata Theory Multiple Choice Quaestion & Answers (MCQs) set-48
1. Which of them have XML as their default format? a) IWork b) LibreOffice c) OpenOffice d) All of the mentioned Answer: d Explanation: More that hundred of document formats using XML syntax have been developed, including RSS, Atom, SOAP and XHTML. 2. Which of the following is an example of inherent ambiguous language? a)…
Automata Theory Multiple Choice Quaestion & Answers (MCQs) set-46
1. State true or false: Statement: We cannot use Ogden’s lemma when pumping lemma fails. a) true b) false 2. Given a grammar in GNF and a derivable string in the grammar with the length n, any ___________will halt at depth n. a) top-down parser b) bottom-up parser c) multitape turing machine d) none of…
Automata Theory Multiple Choice Quaestion & Answers (MCQs) set-47
1. A DTD is associated with a XML file by means of ___________ a) Function b) <!DOCTYPE> c) Macros d) None of the mentioned 2. A push down automaton with only symbol allowed on the stack along with fixed symbol. a) Embedded PDA b) Nested Stack automata c) DPDA d) Counter Automaton 3. A null…
Automata Theory Multiple Choice Quaestion & Answers (MCQs) set-45
1. What does NP stands for in complexity classes theory? a) Non polynomial b) Non-deterministic polynomial c) Both (a) and (b) d) None of the mentioned 2. A ___________ is a multi tape turing machine whose input tape is read only. a) Counter Machine b) Multi-stack c) Alternating Turing machine d) None of the mentioned…
Automata Theory Multiple Choice Quaestion & Answers (MCQs) set-44
1. Which of the expressions correctly is an requirement of the pumping lemma for the context free languages? a) uvnwxny b) uvnwnxny c) uv2nwx2ny d) All of the mentioned 2. Which of the following is/are not an application of turing machine? a) Language Recognization b) Computers of functions on non negative numbers c) Generating devices…
Automata Theory Multiple Choice Quaestion & Answers (MCQs) set-43
1. X is a simple mathematical model of a computer. X has unrestricted and unlimited memory. X is a FA with R/W head. X can have an infinite tape divided into cells, each cell holding one symbol. Name X? a) Push Down Automata b) Non deterministic Finite Automata c) Turing machines d) None of the…
