Question 1 of 80Introduction to finite automata
A DFA differs from an NFA in that a DFA:
AMay have epsilon transitions
BHas exactly one transition for every state-symbol pair
CCan have multiple transitions for a symbol
DCannot have a final state
Answer is hidden
Question 2 of 80Introduction to finite automata
Which method converts an NFA into an equivalent DFA?
APumping lemma
BSubset construction
CChomsky normal form
DThompson's theorem only
Answer is hidden
Question 3 of 80Introduction to finite automata
DFA and NFA are equivalent in that they both recognize exactly the class of:
AContext-free languages
BRegular languages
CRecursively enumerable languages
DContext-sensitive languages
Answer is hidden
Question 4 of 80Introduction to finite automata
AAdding more states for clarity
BReducing to the fewest states while accepting the same language
CConverting it to an NFA
DRemoving the final states
Answer is hidden
Question 5 of 80Introduction to finite automata
Which operators are used to build regular expressions?
AUnion, concatenation, Kleene star
BUnion, intersection, complement only
CAND, OR, NOT
DAddition, subtraction, multiplication
Answer is hidden
Question 6 of 80Introduction to finite automata
The pumping lemma for regular languages is mainly used to:
AProve a language IS regular
BProve a language is NOT regular
CMinimize a DFA
DConvert a regular expression to an NFA
Answer is hidden
Question 7 of 80Introduction to finite automata
An epsilon (ฮต) transition in an NFA allows the machine to:
AConsume exactly one input symbol
BChange state without consuming any input symbol
CReject all strings
DHalt permanently
Answer is hidden
Question 8 of 80Introduction to finite automata
Every regular expression can be converted into an equivalent:
ATuring machine only
BFinite automaton
CPushdown automaton only
DContext-free grammar only
Answer is hidden
Question 9 of 80Introduction to finite automata
The pumping lemma states that a sufficiently long string in a regular language can be split into parts:
Ax and y only
Bxyz, where y can be repeated (pumped) any number of times
COnly a single part
DFour equal parts
Answer is hidden
Question 10 of 80Introduction to finite automata
A finite automaton is formally defined using how many components?
Answer is hidden
Question 11 of 80Introduction to context free language
A context-free grammar is formally defined as a tuple consisting of:
AStates, alphabet, transitions
BVariables, terminals, productions, start symbol
CTape, head, states
DOnly production rules
Answer is hidden
Question 12 of 80Introduction to context free language
A leftmost derivation always replaces:
AThe rightmost terminal
BThe leftmost non-terminal (variable) first
CA random non-terminal
DOnly terminals
Answer is hidden
Question 13 of 80Introduction to context free language
A grammar is called ambiguous if:
AIt has no production rules
BSome string has more than one distinct parse tree
CIt accepts no strings
DIt uses only terminals
Answer is hidden
Question 14 of 80Introduction to context free language
In Chomsky Normal Form, every production must be of the form:
AA โ aฮฑ
BA โ BC or A โ a
CA โ B only
DA โ ฮต only
Answer is hidden
Question 15 of 80Introduction to context free language
Greibach Normal Form requires each production to begin with:
AA variable
BA terminal, followed by zero or more variables
CThe start symbol
DTwo terminals
Answer is hidden
Question 16 of 80Introduction to context free language
BNF (Backus-Naur Form) is primarily used to:
AEncrypt data
BExpress the syntax of context-free grammars, e.g. programming languages
CMinimize finite automata
DRepresent Turing machines
Answer is hidden
Question 17 of 80Introduction to context free language
A Pushdown Automaton differs from a finite automaton mainly by having:
AMultiple tapes
BAn auxiliary stack for memory
CNo states
DInfinite input alphabet only
Answer is hidden
Question 18 of 80Introduction to context free language
A language is context-free if and only if it is accepted by some:
ADFA
BTuring machine only
CPushdown automaton (PDA)
DRegular expression only
Answer is hidden
Question 19 of 80Introduction to context free language
The pumping lemma for context-free languages is used to prove that a language:
AIs regular
BIs context-free
CIs NOT context-free
DIs decidable
Answer is hidden
Question 20 of 80Introduction to context free language
Context-free languages are closed under which of the following operations?
AIntersection
BComplement
CUnion, concatenation, and Kleene star
DNeither union nor concatenation
Answer is hidden
Question 21 of 80Turing machine
A Turing Machine's transition function is typically written as:
Aฮด(q, X) = (q', Y, D)
Bฮด(q) = X only
Cf(x) = y
Dฮด(Q, ฮฃ) only
Answer is hidden
Question 22 of 80Turing machine
A Turing Machine acting as a language recognizer will:
AAlways loop forever
BAccept or reject an input string
COnly compute numeric functions
DNever halt
Answer is hidden
Question 23 of 80Turing machine
A multi-tape Turing Machine, compared to a single-tape TM, is:
AMore powerful (can compute more functions)
BEquivalent in power, just more convenient to program
CLess powerful
DUnable to simulate a single-tape TM
Answer is hidden
Question 24 of 80Turing machine
A Non-deterministic Turing Machine (NTM) is:
AMore powerful than a deterministic TM
BEquivalent in power to a deterministic TM
CUnable to accept any language
DOnly a theoretical concept with no equivalence proof
Answer is hidden
Question 25 of 80Turing machine
A Universal Turing Machine (UTM) is significant because it can:
AOnly run one fixed program
BSimulate any other Turing Machine given its encoded description and input
CSolve all undecidable problems
DOnly process numeric input
Answer is hidden
Question 26 of 80Turing machine
The Church-Turing Thesis asserts that:
AAll problems are solvable in polynomial time
BAny effectively computable function can be computed by a Turing Machine
CTuring Machines cannot compute functions
DNP problems are always tractable
Answer is hidden
Question 27 of 80Turing machine
Computational complexity is primarily concerned with measuring:
AProgram readability
BThe time and space resources needed to solve a problem
CThe number of grammar rules
DThe size of a regular expression only
Answer is hidden
Question 28 of 80Turing machine
A problem is called intractable if:
AIt can be solved instantly
BNo algorithm can solve it in polynomial time
CIt has no solution at all
DIt is regular
Answer is hidden
Question 29 of 80Turing machine
Reducibility between two problems is used to:
AMerge two Turing Machines into one tape
BShow the relative difficulty of problems by transforming one into another
CMinimize a DFA
DProve a grammar is ambiguous
Answer is hidden
Question 30 of 80Turing machine
A Turing Machine's tape is best described as:
AFinite and read-only
BInfinite (or unbounded), read/write
CA stack only
DA queue only
Answer is hidden
Question 31 of 80Introduction of computer graphics
In a raster-scan display, the image is composed of:
AStraight lines drawn directly between endpoints
BA grid of pixels stored in a frame buffer
CVector coordinates only
DAnalog signals with no memory
Answer is hidden
Question 32 of 80Introduction of computer graphics
A vector (random-scan) display draws an image by:
ARefreshing pixels row by row
BDrawing lines directly from one endpoint to another
CUsing only a frame buffer
DDisplaying only text
Answer is hidden
Question 33 of 80Introduction of computer graphics
The role of a display processor is to:
AReplace the monitor entirely
BOffload image-generation tasks from the CPU
COnly handle keyboard input
DStore user files
Answer is hidden
Question 34 of 80Introduction of computer graphics
Which of these is classified as a graphics input device?
APlotter
BPrinter
CDigitizer/graphics tablet
DMonitor
Answer is hidden
Question 35 of 80Introduction of computer graphics
Which of these is a graphics software standard aimed at ensuring portability across hardware?
Answer is hidden
Question 36 of 80Introduction of computer graphics
AGraphics Kernel Standard
BGraphical Kernel System
CGeneral Kernel Software
DGraphics Key System
Answer is hidden
Question 37 of 80Introduction of computer graphics
A plotter is best classified as a graphics:
AInput device
BOutput device
CProcessing device
DStorage device
Answer is hidden
Question 38 of 80Introduction of computer graphics
PHIGS is primarily a standard for:
ANetworking protocols
BProgrammer's hierarchical interactive graphics
CDatabase management
DFile compression
Answer is hidden
Question 39 of 80Introduction of computer graphics
Which display technology is now dominant in modern computer monitors?
AVector/random-scan display
BRaster-scan display
CMechanical plotter display
DPunch card display
Answer is hidden
Question 40 of 80Introduction of computer graphics
A light pen is an example of a graphics:
AOutput device
BStorage device
CInput device
DDisplay standard
Answer is hidden
Question 41 of 80Two-dimensional transformation
Which 2D transformation moves an object without changing its shape or orientation?
ARotation
BScaling
CTranslation
DShear
Answer is hidden
Question 42 of 80Two-dimensional transformation
Homogeneous coordinates represent a 2D point (x, y) as:
A(x, y)
B(x, y, 1)
C(x, y, z, 1)
D(1, x, y)
Answer is hidden
Question 43 of 80Two-dimensional transformation
Combining several transformations into a single matrix by multiplying them together is called:
AClipping
BComposite transformation
CWindowing
DProjection
Answer is hidden
Question 44 of 80Two-dimensional transformation
In the 2D viewing pipeline, a 'window' refers to:
AThe screen display area
BThe area of interest defined in world coordinates
CA GUI dialog box
DThe frame buffer
Answer is hidden
Question 45 of 80Two-dimensional transformation
The Cohen-Sutherland line clipping algorithm uses:
AParametric line equations only
B4-bit region codes for endpoints
COnly pixel-by-pixel comparison
DFourier transforms
Answer is hidden
Question 46 of 80Two-dimensional transformation
Compared to Cohen-Sutherland, the Liang-Barsky algorithm is generally:
ASlower
BMore computationally efficient
CUnable to clip lines
DOnly usable in 3D
Answer is hidden
Question 47 of 80Two-dimensional transformation
A shear transformation primarily:
AMoves an object without distortion
BSlants/distorts the shape of an object
CReflects an object about an axis
DRemoves clipped portions of an object
Answer is hidden
Question 48 of 80Two-dimensional transformation
The process of mapping a window in world coordinates to a viewport on the screen is called:
AClipping
BWindow-to-viewport transformation
CReflection
DRotation
Answer is hidden
Question 49 of 80Two-dimensional transformation
Clipping is performed to:
AEnlarge an image
BRemove portions of a picture outside the viewing window
CRotate an object
DChange the color of an object
Answer is hidden
Question 50 of 80Two-dimensional transformation
A reflection transformation produces:
AA scaled-up copy of the object
BA mirror image of the object about an axis
CA rotated copy about the origin
DA sheared copy of the object
Answer is hidden
Question 51 of 80Three-dimensional transformation
3D transformations are typically represented using matrices of size:
Answer is hidden
Question 52 of 80Three-dimensional transformation
3D rotation can be performed about which axes?
AOnly the x-axis
BOnly the z-axis
CThe x-axis, y-axis, or z-axis
DNo axis; rotation is 2D only
Answer is hidden
Question 53 of 80Three-dimensional transformation
The stage of the 3D viewing pipeline that maps 3D coordinates onto a 2D viewing plane is called:
AModeling transformation
BViewing transformation
CProjection transformation
DViewport transformation
Answer is hidden
Question 54 of 80Three-dimensional transformation
In parallel projection, the projection lines (projectors) are:
AConverging to a single point
BParallel to each other
CRandom and unrelated
DAlways perpendicular to the x-axis only
Answer is hidden
Question 55 of 80Three-dimensional transformation
Orthographic projection is a type of parallel projection where the projectors are:
AOblique to the view plane
BPerpendicular to the view plane
CConverging to a point
DCurved
Answer is hidden
Question 56 of 80Three-dimensional transformation
Which projection type makes farther objects appear smaller, giving a realistic sense of depth?
AOrthographic projection
BOblique projection
CPerspective projection
DParallel projection
Answer is hidden
Question 57 of 80Three-dimensional transformation
An oblique projection differs from an orthographic projection in that its projectors are:
APerpendicular to the view plane
BNot perpendicular to the view plane
CConverging to a single point
DNon-existent
Answer is hidden
Question 58 of 80Three-dimensional transformation
The first stage of the 3D viewing pipeline, which places objects into the overall scene, is called:
AViewport transformation
BModeling transformation
CProjection transformation
DClipping
Answer is hidden
Question 59 of 80Three-dimensional transformation
Combining several 3D transformations into one matrix by multiplying them together is called:
AProjection
BClipping
CComposite transformation
DViewport mapping
Answer is hidden
Question 60 of 80Three-dimensional transformation
Which projection type is best suited for engineering drawings that must preserve true relative dimensions?
APerspective projection
BParallel (orthographic) projection
CRandom projection
DRadial projection
Answer is hidden
Question 61 of 80Computer Graphics & AI
The activation function used in a Hopfield Network is:
ASigmoid
BReLU
CTanh
DSign (Signum)
Answer is hidden
Question 62 of 80Computer Graphics & AI
Machine learning using labelled training data (input-output pairs) is called:
ASupervised learning
BUnsupervised learning
CReinforcement learning
DSemi-supervised learning
Answer is hidden
Question 63 of 80Computer Graphics & AI
In an AI agent, which component carries out actions on the environment?
ASensors
BKnowledge base
CActuators
DInference engine
Answer is hidden
Question 64 of 80Computer Graphics & AI
Which UML diagram describes the vocabulary (classes and relationships) of a system?
ASequence Diagram
BClass Diagram
CUse Case Diagram
DActivity Diagram
Answer is hidden
Question 65 of 80Computer Graphics & AI
To translate a circle to a new position in 2D graphics, what must be translated?
AThe centre point only
BEvery pixel on the circumference
CThe bounding box
DThe radius
Answer is hidden
Question 66 of 80Computer Graphics & AI
In 2D scaling, if both scale factors sx < 1 and sy < 1, the object:
AGrows larger
BShrinks (becomes smaller)
CReflects about the origin
DStays the same size
Answer is hidden
Question 67 of 80Computer Graphics & AI
How many distinct reflection planes exist in 3D space?
Answer is hidden
Question 68 of 80Computer Graphics & AI
The complexity of an Artificial Neural Network primarily depends on:
ANumber of input nodes only
BTraining data size only
CNumber of hidden layers only
DAll of the above (architecture, data, training)
Answer is hidden
Question 69 of 80Computer Graphics & AI
A crossword-puzzle solving environment is best described as:
APartially observable, multi-agent, stochastic
BFully observable, single-agent, deterministic
CPartially observable, single-agent, stochastic
DFully observable, multi-agent, deterministic
Answer is hidden
Question 70 of 80Computer Graphics & AI
In an expert system, the component that stores all facts, rules, and domain knowledge is the:
AKnowledge Base
BInference Engine
CWorking Memory
DUser Interface
Answer is hidden
Question 71 of 80Computer Graphics & AI
MYCIN, the medical expert system, used how many rules and which reasoning strategy?
A500 rules, Backward chaining
B500 rules, Forward chaining
C200 rules, Backward chaining
D1000 rules, Forward chaining
Answer is hidden
Question 72 of 80Computer Graphics & AI
Which concept is central to Fuzzy Logic?
ABoolean truth values
BProbability distributions
CCrisp set membership
DMembership Function (degree of truth 0โ1)
Answer is hidden
Question 73 of 80Computer Graphics & AI
The A* search algorithm is NOT admissible when:
AThe heuristic overestimates the true cost to goal
BThe heuristic underestimates the true cost
CThe heuristic equals zero
DThe search space is finite
Answer is hidden
Question 74 of 80Computer Graphics & AI
Greedy Best-First Search selects the next node to expand based on:
Ag(n) only (cost from start)
Bg(n) + h(n)
Ch(n) only (estimated cost to goal)
DBreadth from root
Answer is hidden
Question 75 of 80Computer Graphics & AI
The key components of a search problem in AI are:
AInitial state, goal state, and operators (transition function)
BStart node, heuristic function, and path cost only
CDatabase, inference engine, and user interface
DAgent, environment, and reward function
Answer is hidden
Question 76 of 80Computer Graphics & AI
The transformation matrix [[1,0,0],[0,5,0],[0,0,2]] represents:
ATranslation
BScaling
CRotation
DShearing
Answer is hidden
Question 77 of 80Computer Graphics & AI
ADirect Drawing Algorithm
BDigital Differential Analyzer
CDynamic Display Adapter
DDiscrete Drawing Approach
Answer is hidden
Question 78 of 80Computer Graphics & AI
The OOAD methodology that features macro and micro development processes is:
ABooch Method
BRumbaugh OMT
CJacobson OOSE
DRUP
Answer is hidden
Question 79 of 80Computer Graphics & AI
The NLP processing pipeline in correct order is:
ATokenization โ POS Tagging โ Parsing โ Semantic Analysis
BParsing โ Tokenization โ Semantic Analysis โ POS Tagging
CSemantic Analysis โ Tokenization โ POS Tagging โ Parsing
DPOS Tagging โ Tokenization โ Parsing โ Semantic Analysis
Answer is hidden
Question 80 of 80Computer Graphics & AI
The Turing Test extension that requires a robot to interact physically with the world is:
AChinese Room Test
BTotal Turing Test
CWinograd Schema Test
DCAPTCHA
Answer is hidden