Yahoo India Web Search

Sign In

Search results

  1. www.geeksforgeeks.org › practice-problems-finitePractice problems on finite automata - GeeksforGeeks

    Aug 28, 2019 · Practice problems on finite automata. Last Updated : 28 Aug, 2019. Que-1: Draw a deterministic and non-deterministic finite automate which accept 00 and 11 at the end of a string containing 0, 1 in it, e.g., 01010100 but not 000111010.

  2. learnprogramo.com › amcat-coding-questions-1AMCAT Coding Questions With Solutions 2023 [Updated]

    • Easy
    • Medium
    • Hard
    • What Is AMCAT Automata Test?
    • How Many Questions Are Asked in The AMCAT Automata Test?
    • What Is Automata Pro?
    • Round 1: Aptitude Test
    • Round 2: Coding
    • Round 3: Technical Interview
    • Round 4: HR Interview
    Find GCD and LCM of two numbers.
    Program to check whether the given number is prime or not.
    To check whether the number is Armstrong.
    Program to check number is strong or not.

    See full list on learnprogramo.com

    Pyramid pattern printing program.
    Reversing a number.
    Printing the Armstrong numbers between the given intervals.
    Converting Binary number to Decimal and vice versa.

    See full list on learnprogramo.com

    Program for Palindrome pattern printing.
    Removing the vowels from the string.
    Finding the frequency of the characters from the given string.
    Program to find roots of the quadratic equation.

    See full list on learnprogramo.com

    The AMCAT Automata is a programming test which is conducted to evaluate the candidates who are good in programming skills.

    See full list on learnprogramo.com

    Mainly two questions are asked in the exam in which the first question is based on patterns and the second is based on strings or matrices which is hard.

    See full list on learnprogramo.com

    The Automata pro is an exam similar to MindTree which evaluates the candidates with good programming skills.

    See full list on learnprogramo.com

    The Aptitude Test have the following sections: 1. Quantitative Ability ( 25 Questions in 35 minutes) These sections consist of questions based on mathematics which consists of topics like probability, percentage, word and distance etc. 1. English (25 Questions in 25 minutes) Questions are based on grammar, antonyms, synonyms etc. 1. Logical Ability...

    See full list on learnprogramo.com

    In this section I choose C programming so the following questions that were asked are: 1. Pattern Printing. 2. Printing a given matrix in the spiral form. So i attempted all the two questions but only the pattern printing question was solved without errors and the second question was partially solved.

    See full list on learnprogramo.com

    The questions that the interviewer asked me was: 1. Hi Jaydeep, How are you? 2. So Jaydeep, Please introduce yourself? 3. Jaydeep you are from CS background? So why you want to work as a software developer? 4. Ok fine. So write a program to print the fibonacci series. 5. Write a program to reverse a string. 6. Program to print the elements of an ar...

    See full list on learnprogramo.com

    The interviewer asked me questions related to my strengths, weakness, hobbies and my family. I have answered that my hobby is to sing a song. So, the interviewer asked me a question about singing like: 1. Which is your favourite Singer and why? 2. Which song did you like the most of Arijit Singh? 3. How many songs did Arijit Singh sung till now? 4....

    See full list on learnprogramo.com

  3. prepinsta.com › amcat › automata-fixAMCAT Automata Fix Questions - PrepInsta

    Jun 14, 2024 · On this page, you will find the AMCAT Automata Fix Questions with Solutions pdf and practice question based on AMCAT Automata.

    • Moderate-High
    • 20 mins
    • 7 Questions

  4. www.sanfoundry.com › 1000-automatAutomata Theory MCQ (Multiple Choice Questions) - Sanfoundry

    • Finite Automata. The section contains multiple choice questions and answers on finite automata, moore and mealy machines, applications of dfa and nfa, language of dfa and nfa and also its processing strings, transition function, epsilon transitions, uses and its closures.
    • Regular Expressions and Languages. The section contains questions and answers on regular expressions and its its operators, buliding and converting the regular expressions, lexical analysis, unix regular expressions, finding patterns in text and algebric laws.
    • Properties of Regular Languages. The section contains MCQs on pumping lemma for regular language and its applications, reversal and inverse homomorphism, conversions and testing emptiness.
    • Context Free Grammars and Languages. The section contains multiple choice questions and answers on context free grammar, inferences, ambiguity, sentential forms, application parser and yacc parser generators, trees derivations, markup languages and ambiguos grammar.

  5. www.geeksforgeeks.org › theory-of-computationAutomata Tutorial - GeeksforGeeks

    Jun 12, 2024 · It deals with the study of abstract machines and their capacities for computation. An abstract machine is called the automata. It includes the design and analysis of automata, which are mathematical models that can perform computations on strings of symbols according to a set of rules.

  6. www.faceprep.in › amcat-exam › amcat-automata-questionsFACE Prep | The right place to prepare for placements

    Jun 14, 2023 · AMCAT Automata Coding Questions FAQs. 1. What is Amcat Automata test? The Amcat automata test is a programming test to evaluate a candidate's programming proficiency. It not only evaluates correctness but also code quality & efficiency in execution. 2. What is the syllabus of the Amcat Automata test?

  7. People also ask

  8. btechgeeks.com › amcat-automata-questionsAMCAT Automata Questions and Free Study Material Download

    Feb 24, 2023 · AMCAT Automata Questions and Study Material PDF Free Download. Questions on AMCAT Automata gives an introduction to basic theoretical methods of computability, thereby developing varied structure. This pdf contains questions in the concept of pushdown automata involving a class of models.