What is the primary characteristic of parallel computing? Performing multiple calculations simultaneously Using vacuum tubes for processing Running single-threaded applications Using magnetic tapes for storage

Performing multiple calculations simultaneously

What is a key advantage of distributed computing? Scalability and fault tolerance Lower power consumption Simpler programming model Higher heat generation

Scalability and fault tolerance

What is an automaton in the context of formal languages? A system that performs tasks automatically A mathematical model for computation A type of formal grammar A language processing tool

A mathematical model for computation

What defines a deterministic finite automaton (DFA)? It has multiple states It uses a stack to store information It has a single unique computation for each input It can change states based on probabilities

It has a single unique computation for each input

In automata theory, what is a transition function? A function that maps states to actions A function that determines state changes based on input A function that outputs the accepted language A function that calculates the shortest path in a graph

A function that determines state changes based on input

What is a formal language in automata theory? A programming language A set of strings over a finite alphabet A type of algorithm A language spoken by machines

A set of strings over a finite alphabet

What is the role of an accepting state in an automaton? To start the computation To reject input strings To determine if a string is in the language To repeat the last action

To determine if a string is in the language

What distinguishes a non-deterministic finite automaton (NFA) from a DFA? NFAs have multiple starting states NFAs can have multiple transitions for the same input NFAs use a stack to store information NFAs are slower than DFAs

NFAs can have multiple transitions for the same input

Which of the following is a characteristic of regular languages? They require a stack to be processed They can be expressed using regular expressions They are processed by Turing machines They are inherently ambiguous

They can be expressed using regular expressions

What is the primary difference between deterministic and non-deterministic finite automata? Deterministic has a single state transition, non-deterministic can have multiple transitions. Deterministic can have multiple transitions, non-deterministic has a single transition. Deterministic uses a stack, non-deterministic does not use a stack. Deterministic is more powerful than non-deterministic.

Deterministic has a single state transition, non-deterministic can have multiple transitions.

Which of the following is a characteristic of context-free languages? They can be represented by a finite automaton. They require a Turing machine for recognition. They can be generated by a context-free grammar. They are closed under intersection.

They can be generated by a context-free grammar.

In automata theory, what is a 'language'? A collection of symbols and alphabets. A set of all possible strings over a given alphabet. A set of strings recognized by a particular automaton. A sequence of characters from an infinite alphabet.

A set of strings recognized by a particular automaton.

What does it mean for a language to be 'decidable'? It can be recognized by a finite automaton. There exists an algorithm that can determine membership in finite time. It can be represented by a context-free grammar. It can be generated by a non-deterministic automaton.

There exists an algorithm that can determine membership in finite time.

Which of the following best describes a Turing machine? A finite automaton with a stack. A computational model with infinite tape and a finite control unit. A non-deterministic automaton with multiple start states. A deterministic automaton with a finite number of states.

A computational model with infinite tape and a finite control unit.

How do context-sensitive grammars differ from context-free grammars? Context-sensitive grammars allow non-terminal symbols to be rewritten based on context. Context-sensitive grammars only generate regular languages. Context-sensitive grammars are equivalent to finite automata. Context-sensitive grammars cannot generate strings of arbitrary length.

Context-sensitive grammars allow non-terminal symbols to be rewritten based on context.

What is the significance of Chomsky hierarchy in formal languages? It classifies languages based on their complexity and grammar type. It ranks automata based on their computational power. It organizes languages according to their syntax. It defines the efficiency of algorithms for language recognition.

It classifies languages based on their complexity and grammar type.

What is a 'universal' Turing machine? A machine that can simulate any other Turing machine. A machine with an infinite number of states. A machine that recognizes only regular languages. A machine that operates with a finite tape.

A machine that can simulate any other Turing machine.

What is an automaton in automata theory? A mathematical model of computation A type of formal language A programming language A physical machine

A mathematical model of computation

What does a transition function in an automaton define? The change from one state to another The output signals The input variables The physical structure

The change from one state to another

Which of the following best describes a formal language? A set of strings over an alphabet A spoken language A programming language syntax A communication protocol

A set of strings over an alphabet

What is a string in the context of formal languages? A sequence of symbols from an alphabet A type of variable in programming A chain of linked nodes A mathematical equation

A sequence of symbols from an alphabet

What is the purpose of the acceptance condition in an automaton? To determine if a string is part of a language To calculate the output of a function To initialize the automaton To define the input alphabet

To determine if a string is part of a language

What is the significance of a Turing machine in automata theory? It is a theoretical model that can simulate any computer algorithm It is a type of finite automaton It is a physical computing device It is a type of programming language

It is a theoretical model that can simulate any computer algorithm

What purpose do graph databases primarily serve in modern data architectures? Storing hierarchical data Managing networked data relationships Handling transactional data Simplifying data retrieval

Managing networked data relationships

Which feature distinguishes column-family stores from other NoSQL databases? Use of rows and columns Storage of data as a single binary object Organizing data into columns with families Schema-dependent design

Organizing data into columns with families

How do document stores typically structure data? In fixed-length records Using tables with rows and columns As collections of key-value pairs As documents with nested structures

As documents with nested structures

In the context of data models, what does 'polyglot persistence' refer to? Using multiple languages for data processing Combining different database technologies Storing data in multiple formats Integrating relational and non-relational databases

Combining different database technologies

Algorithms

Flashcard >
Computer Science >
Algorithms

Flashcard sets

View All

Algorithms

Historical Evolution of Computing Systems

user_bukharintxhx

MCQ 10 Cards

Algorithms

Basic Concepts in Automata Theory

user_bscs_2022_fast_

MCQ 10 Cards

Algorithms

Advanced Concepts in Automata Theory

user_bscs_2022_fast_

MCQ 10 Cards

Textbooks

View All

Expert Q&A

View All

Algorithms

Historical Evolution of Computing Systems

user_bukharintxhx

MCQ 10 Cards

Algorithms

Basic Concepts in Automata Theory

user_bscs_2022_fast_

MCQ 10 Cards

Algorithms

Advanced Concepts in Automata Theory

user_bscs_2022_fast_

MCQ 10 Cards

Algorithms

Basic Concepts in Automata Theory

user_bscs_2022_fast_

MCQ 10 Cards

Algorithms

Advanced Data Models and Architectures

akbarsafiulwfz

MCQ 10 Cards

Algorithms

Advanced Data Models and Architectures

akbarsafiulwfz

MCQ 10 Cards

Algorithms

Applications of Programming

user_bscs_2022_fast_

MCQ 10 Cards

Algorithms

Applications of Programming Advanced Concepts and Practices

user_bscs_2022_fast_

MCQ 10 Cards

Algorithms

Applications of Programming Key Concepts and Fields

user_bscs_2022_fast_

MCQ 10 Cards

Algorithms

Advanced Data Models and Architectures An Introduction

akbarsafiulwfz

MCQ 10 Cards

Algorithms

Regular Expressions and Automata Conversion and Relationships

user_nasirrxyq

MCQ 10 Cards

Algorithms

Regular Expressions and Finite Automata Basics

user_nasirrxyq

MCQ 10 Cards

Algorithms

Regular Expressions and Automata Conversion Techniques and Relationships

user_nasirrxyq

MCQ 10 Cards

Algorithms

Flashcards on Introduction to Parallel and Distributed Systems (medium)

user_bukharintxhx

MCQ 10 Cards

Algorithms

Flashcards on Introduction to Parallel and Distributed Systems (easy)

user_bukharintxhx

MCQ 10 Cards