



Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
2024 my professor dabid peof avfieb sjfvfbd sksksbsbd. Content contain mcqs into and it si dhrb d d
Typology: Cheat Sheet
1 / 6
This page cannot be seen from the preview
Don't miss anything!




D) It compiles the query into a series of distributed jobs like MapReduce, Tez, or Spark.
C) Hive's ACID support is designed for analytical workloads, not for real-time transactions. D) Hive's ACID support is entirely focused on fault tolerance, not consistency. 12.The OVERWRITE keyword in Hive's LOAD DATA command does which of the following? A) It appends new data to the table without affecting existing records. B) It deletes the existing data in the table and replaces it with the new data. C) It only updates records with matching primary keys. D) It creates a new table with the same name. 13.The set of all languages that are recognized by a Pushdown Automaton is closed under which of the following operations? A) Intersection B) Union C) Complement D) Set Difference 14.A language is defined by the regular expression (ab)* | (a | b)+. Which of the following is true about this language? A) It is Context-Free but not Regular. B) It is Regular and therefore Context-Free. C) It is Recursively Enumerable but not Decidable. D) It is an undecidable language. 15.What is the most significant difference between a Turing-recognizable language and a Turing-decidable language? A) The size of the language.
B) The type of grammar used to generate it. C) A decider TM is guaranteed to halt on all inputs; a recognizer TM is not. D) A recognizer TM can be simulated by a decider TM. 16.Which of the following is a key closure property that distinguishes the class of Regular Languages from Context-Free Languages? A) Closure under Union. B) Closure under Intersection. C) Closure under Concatenation. D) Closure under Kleene Star. 17.The language L={aibjck∣i,j,k≥0,and i=j=k} is: A) Regular B) Context-Free C) Decidable D) All of the above 18.A problem is considered undecidable if: A) It can be solved by a Turing Machine but only in exponential time. B) There exists a Turing Machine that can recognize all "yes" instances, but not "no" instances. C) No Turing Machine can be constructed to always halt and provide a correct "yes" or "no" answer. D) The problem can be solved by a non-deterministic Turing Machine. 19.Which of the following statements about the Chomsky Hierarchy is false? A) All regular languages are also context-free languages. B) All context-free languages are also recursive languages.