INTERVIEW QUS ON AUTOMATA

-

 

                             

.


 INTERVIEW QUS ON AUTOMATA
1There are ________ tuples in the finite state machine.
 a)4b)5
 c)6d)Unlimited
2Transition function maps.
 a)Σ * Q → Σb)Q * Q→Σ
 c)Σ * Σ → Qd)Q * Σ → Q
3Number of states required to accept string ends with 10.
 a)3b)2
 c)1d)Can’t be determined
4δ*(q,ya) is equivalent to .
 a)δ((q,y),a)b)δ(δ*(q,y),a)
 c)δ(q,ya)d)independent from δ notation
5An automaton that presents output based on previous state or current input is called
 a)Acceptorb)Classifier
 c)Transducerd)None of the mentioned
6If NFA of 6 states excluding the initial state is converted into DFA, the maximum possible number of states for the DFA is
 a)62b)32
 c)128d)127
7NFA, in its name has ’non-deterministic’ because of :
 a)The result is undeterminedb)The choice of path is non-deterministic
 c)The state to be transited next is non-deterministicd)All of the mentioned
8Which of the following is the correct proposition? Statement 1: Non determinism is a generalization of Determinism. Statement 2: Every DFA is automatically an NFA
 a)Statement 1 is correct because Statement 2 is correctb)Statement 2 is correct because Statement 2 is correct
 c)Statement 2 is false and Statement 1 is falsed)Statement 1 is false because Statement 2 is false
9Given Language L= {xϵ {a, b}*|x contains aba as its substring}Find the difference of transitions made in constructing a DFA and an equivalent NFA?
 a)2b)3
 c)4d)Cannot be determined.
10If n is the length of Input string and m is the number of nodes, the running time of DFA is x that of NFA.Find x?
 a)1/m2b)2m
 c)1/md)log m
11Which of the following statement is correct?
 a)NFA is slower to process and its representation uses more memory than DFAb)DFA is faster to process and its representation uses less memory than NFA
 c)NFA is slower to process and its representation uses less memory than DFAd)DFA is slower to process and its representation uses less memory than
12Which among the following is not notated as infinite language?
 a)Palindromeb)Reverse
 c)Factoriald)L={ab}*
13Moore Machine is an application of:
 a)Finite automata without inputb)Finite automata with output
 c)Non- Finite automata with outputd)None of the mentioned
14Which of the given statement are correct?
 a)Moore machine has 6-tuplesb)Mealy machine has 6-tuples
 c)Both Mealy and Moore has 6-tuplesd)None of the mentioned
15The major difference between Mealy and Moore machine is about:
 a)Output Variationsb)Input Variations
 c)Both Output Variations and Input Variationsd)None of the mentioned
16Which of the following does not represent the given language? Language: {0,01}
 a)0+01b){0} U {01}
 c){0} U {0}{1}d){0} ^ {01}
17Which among the following looks similar to the given expression? ((0+1). (0+1)) *
 a){xϵ {0,1} *|x is all binary number with even length}b){xϵ {0,1} |x is all binary number with even length}
 c){xϵ {0,1} *|x is all binary number with odd length}d){xϵ {0,1} |x is all binary number with odd length}
18Concatenation Operation refers to which of the following set operations:
 a)Unionb)Dot
 c)Kleened)Two of the options are correct
19RR* can be expressed in which of the forms:
 a)R+b)R-
 c)R+ U R-d)R
20Which of the following statements is not true?
 a)Every language defined by any of the automata is also defined by a regular expressionb)Every language defined by a regular expression can be represented using a DFA
 c)Every language defined by a regular expression can be represented using NFA with e movesd)Regular expression is just another representation for any automata definition
21The minimum number of transitions to pass to reach the final state as per the following regular expression : {a,b}*{baaa} is:
 a)4b)5
 c)6d)9
22If we select a string w such that w∈L, and w=xyz. Which of the following portions cannot be an empty string?
 a)xb)y
 c)zd)all of the mentioned
23Which of the following is a utility of state elimination phenomenon?
 a)DFA to NFAb)NFA to DFA
 c)DFA to Regular Expressiond)All of the mentioned
24A language is regular if and only if(Probable duplicate)
 a)accepted by DFAb)accepted by PDA
 c)accepted by LBAd)accepted by Turing machine
25The behaviour of NFA can be simulated using DFA.
 a)alwaysb)never
 c)sometimesd)none of the mentioned
26Regular grammar is
 a)context free grammarb)non context free grammar
 c)english grammard)None of these
27Which of the following is not a regular expression?
 a)[(a+b)*-(aa+bb)]*b)[(0+1)-(0b+a1)*(a+b)]*
 c)(01+11+10)*d)(1+2+0)*(1+2)*
28Regular expression are
 a)Type 0 languageb)Type 1 language
 c)Type 2 languaged)Type 3 language
29Which of the following statement is false?
 a)Context free language is the subset of context sensitive languageb)Regular language is the subset of context sensitive language
 c)Recursively enumerable language is the super set of regular languaged)Context sensitive language is a subset of context free language
30Which among the following cannot be accepted by regular grammar?
 a)L is a set of numbers divisible by 2b)L is a set of binary complement
 c)L is a set of string with odd number of 0d)L is a set of 0n1n
31The minimum number of productions required to produce a language consisting of palindrome strings over ∑={a,b} is
 a)3b)7
 c)5d)6
32The language accepted by Push down Automaton:
 a)Recursive Languageb)Context free language
 c)Linearly Bounded languaged)All of the mentioned
33Which of the following are distinct to parse trees?
 a)abstract parse treesb)sentence diagrams
 c)both abstract parse trees and sentence diagramsd)none of the mentioned
34A CFG is not closed under
 a)Dot operationb)Union Operation
 c)Concatenationd)Iteration
35A push down automaton employs ________ data structure.
 a)Queueb)Linked List
 c)Hash Tabled)Stack
36A non-deterministic two way, nested stack automaton has n-tuple definition. State the value of n.
 a)5b)8
 c)4d)10
37Which among the following is not a part of the Context free grammar tuple?(Probable duplicate)
 a)End symbolb)Start symbol
 c)Variabled)Production
38Which of the following automata takes stack as auxiliary storage?
 a)Finite automatab)Push down automata
 c)Turing machined)None of these
39Halting states are of two types. They are:
 a)Accept and Rejectb)Reject and Allow
 c)Start and Rejectd)None of these
40Every grammar in Chomsky Normal Form is:
 a)regularb)context sensitive
 c)context freed)all of the mentioned
41Which of the functions are not performed by the turing machine after reading a symbol?
 a)writes the symbolb)moves the tape one cell left/right
 c)proceeds with next instruction or haltsd)none of the mentioned
42The value of n if turing machine is defined using n-tuples:
 a)6b)7
 c)8d)5
43RASP stands for:
 a)Random access storage programb)Random access stored program
 c)Randomly accessed stored programd)Random access storage programming
44A turing machine that is able to simulate other turing machines:
 a)Nested Turing machinesb)Universal Turing machine
 c)Counter machined)None of these
45A turing machine with several tapes in known as:
 a)Multi-tape turing machineb)Poly-tape turing machine
 c)Universal turing machined)All of these
46Which of the following is not a Non deterministic turing machine?
 a)Alternating Turing machineb)Probabilistic Turing machine
 c)Read-only turing machined)None of these
47Finite languages trivially satisfy the pumping lemma by having n = ________, where p is the maximum string length in L.
 a)p*1b)p+1
 c)p-1d)None of the mentioned
48Which of the following is not a step to eliminate state procedure?
 a)Unifying all the final states into one using e-transitionsb)Unify single transitions to multi transitions that contains union of input
 c)Remove states until there is only starting and accepting statesd)Get the resulting regular expression by direct calculation
49The entity which generates language called-
 a)Automatab)Tokens
 c)Grammard)Data
50Which of the following is/are most suitable approaches for inference?
 a)Recursive Inferenceb)Derivations
 c)Both Recursive Inference and Derivationsd)None of the mentioned

.

Comments

Post a Comment

Please do not enter any spam link in the comment box.

Popular posts from this blog

DMA IN MP

-
  What is DMA and Why it is used? Direct memory access (DMA) is a mode of data transfer between the memory and I/O devices. This happens without the involvement of the processor. We have two other methods of data transfer, programmed I/O and Interrupt driven I/O. Let’s revise each and get acknowledge with their drawbacks. In programmed I/O, the processor keeps on scanning whether any device is ready for data transfer. If an I/O device is ready, the processor fully dedicates itself in transferring the data between I/O and memory. It transfers data at a high rate, but it can’t get involved in any other activity during data transfer. This is the major drawback of programmed I/O. In Interrupt driven I/O, whenever the device is ready for data transfer, then it raises an interrupt to processor. Processor completes executing its ongoing instruction and saves its current state. It then switches to data transfer which causes a delay. Here, the processor doesn’t keep scanning for periphe...
Read more

MAKING POWERPOINT SLIDES

-
Making PowerPoint Slides Avoiding the Pitfalls of Bad Slides   Tips to be Covered    Outlines  Slide Structure  Fonts  Color  Background  Graphs  Spelling and Grammar  Conclusions  Questions   Outline    Make your 1 st or 2 nd slide an outline of your presentation – Ex: previous slide  Follow the order of your outline for the rest of the presentation  Only place main points on the outline slide – Ex: Use the titles of each slide as main points     Slide Structure – Good    Use 1-2 slides per minute of your presentation  Write in point form, not complete sentences  Include 4-5 points per slide  Avoid wordiness: use key words and phrases only     Slide Structure - Bad   This page contains too many words for a presentation slide. It is not written in point form, making it difficult both for your audience to read and for you to present each point. Although there are exactly the same number of points on this slide a...
Read more

AUTOMATA DEFINITIONS

-
 AUTOMATA DEFINITIONS THIS SUBJECT IS FULLY BASED ON EXAMPLES, DEFINITIONS, GRAMMAR RULES, DIAGRAMS AND THEOREMS. IMPORTANT DEFINITIONS:  DFA:    A Deterministic Finite State Automaton (DFSA) is denoted by M and it is a set of 5-tuples i.e. M=(Q, Σ, δ, q 0 , F) where, * Q is a non-empty finite set of states * Σ is a non-empty finite set of input symbols *  q 0 is the initial state or starting state. (q0 ∈ Q) * F is a non-empty finite set of final state. (F ⊆ Q). * δ (pronounce delta) is the transition function. Q x Σ → Q. δ(q,a) = p means, if  the automation is in state q and reading a symbol a, it goes to state p in the next instant, moving the pointer one cell to the right. NDFA:    A Non-Deterministic Finite State Automaton (NFSA) is denoted by M and it is a set of 5-tuples i.e. M=(Q, Σ, δ, q 0 , F) where, * Q is a non-empty finite set of states * Σ is a non-empty finite set ...
Read more

Template of Survey papers

-
Image
  Template for submission of Survey papers for           Literature survey (PaperCode) First A. Author, Second B. Author, Jr., and Third C. Author F. A. Author, Paper Name, Department of Computational Science, University, India ( e-mail: author1@ xyz.com). S. A. Author, Paper Name,  Department of Computational Science,University, India ( e-mail: author2@ xyz.com). T. A. Author, Paper Name , Department of Computational Science, University, India ( e-mail: author3@ xyz.com).     ABSTRACT Fill the text from your manuscript in different sections as shown below. Fill the text from your manuscript in different sections as shown below. Fill the text from your manuscript in different sections as shown below. Fill the text from your manuscript in different sections. Fill the text from your manuscript in different sections. Fill the text from your manuscript in different sections. Fill the text from your manuscript in different...
Read more

Java Interview Questions

-
  Java Interview Questions 1. What are the differences between C++ and Java? C++ is not platform-independent; the principle behind C++ programming is “write once, compile anywhere.” In contrast, because the byte code generated by the Java compiler is platform-independent, it can run on any machine, Java programs are written once and run everywhere. ·         Languages Compatibility. C++ is a programming language that is based on the C programming language . Most other high-level languages are compatible with C++. Most of the languages of Java are incompatible. Java is comparable to those of C and C++. ·         Interaction with the library. It can access the native system libraries directly in C++. As a result, it’s better for programming at the system level. Java’s native libraries do not provide direct call support. You can use Java Native Interface or access the libraries. ·         Characteristics. C++ distinguishes it...
Read more

OPERATING SYSTEM MCQ

-
  Which of the following is an example of a spooled device? a. A line printer used to print the output of a number of jobs. b. The terminal used to enter the input data for a Fortran program being executed. c. The secondary memory device in a virtual memory system. d. The swapping area on a disk used by the swapper. In spooling (Simultaneous Peripheral Operation On Line), a buffer is interposed between a running program and a slow-speed device involved with the program for input/output. For example, instead of writing lines directly to the line printer, the lines are written (temporarily) onto a disk. Thus, the program is allowed to run to completion without waiting for the (slow) printer to finish. When the printer becomes free, the lines can be printed from the disk file. 2. Which of the following is not normally contained in the directory entry of a file? a. Creation date. b. Access control list. c. A count of the number of free blocks in the disk. d. Filename an...
Read more

Image upload code in laravel

-
 Uploading images in a Laravel application is a common task. Here's a step-by-step guide to implementing image upload functionality using Laravel: ### Step 1: Set Up the Form for Image Upload First, create a form in your Blade template to allow users to upload an image. ```blade <!-- resources/views/upload.blade.php --> <!DOCTYPE html> <html lang="en"> <head>     <meta charset="UTF-8">     <meta name="viewport" content="width=device-width, initial-scale=1.0">     <title>Image Upload</title> </head> <body>     <h1>Upload an Image</h1>          <form action="{{ route('image.upload') }}" method="POST" enctype="multipart/form-data">         @csrf         <div>             <label for="image">Choose an image:</label>             ...
Read more

how to use vim editor in gitbash

-
 Using the Vim editor in Git Bash is similar to using it in any terminal environment. Vim is a powerful text editor available on most Unix-based systems, including the Git Bash environment on Windows. Here’s a basic guide on how to use Vim within Git Bash: ### 1. **Opening Vim**    - To open a file in Vim, navigate to the directory containing your file using Git Bash and type:      ```bash      vim filename      ```      Replace `filename` with the name of the file you want to edit. If the file doesn’t exist, Vim will create it when you save. ### 2. **Basic Vim Modes**    - **Normal Mode:** This is the default mode when you open Vim. In this mode, you can navigate through the file and issue commands.    - **Insert Mode:** This mode allows you to insert text into the file. To enter Insert Mode from Normal Mode, press `i`.    - **Command Mode:** This mode is used for saving, quitting, ...
Read more

Laravel Session

-
 Sure, let's cover how to use Laravel sessions to store success and error messages and display them in Blade templates, as well as how to store the user ID in the session.            // Store the authenticated user's ID in the session...            session(['user_id' => Auth::id()]);            // Retrieve the user ID from the session...            $userId = session('user_id');  Step 2: Using Sessions for Success and Error Messages # Instructions: 1. Setting Up Controller Methods with Success/Error Messages:    In your `BookController`, add session flash messages in the store, update, and destroy methods:    ```php    namespace App\Http\Controllers;    use App\Models\Book;    use Illuminate\Http\Request;    class BookController extends Controller    {        public fu...
Read more

INTERVIEW ENGLISH QUESTIONS

-
Image
  The new normal has also had positive impacts in my life. My friends see me as…….. One should spend at least half an hour everyday on hobbies for a better professional career. All of us should have goals in life to achieve success. A person who has a better EQ will achieve more success in professional life. It is difficult to enjoy work because end of the day it is monotonous. Happy customers and happy employees together make a successful company. Risk is nothing but better and newer ways of doing things. Continuous learning is absolutely essential to survive and sustain in the corporate sector. A successful career is a sum total of talent, hard work and opportunities. In this Globalization, Every company wants to spread its own business. Maybe they build a relationship with foreign companies. In this situation, English communication skills are helpful. এই বিশ্বায়নে, প্রতিটি সংস্থা নিজস্ব ব্যবসা ছড়িয়ে দিতে চায়। তারা বিদেশী সংস্থার সা...
Read more