AM Software Test 6 Leave a Comment / By fawadtwopointo@gmail.com / August 22, 2025 Welcome to your AM Software Test 6 Amdahl’s Law is used to: Predict maximum parallel speedup Measure compiler performance Estimate cache misses Optimize network routing None Which parallel programming model uses shared variables? MPI OpenMP CUDA MapReduce None The “Byzantine Generals Problem” is fundamental in: Compiler optimization Cloud storage Fault-tolerant distributed systems AI planning None Google’s Spanner DB achieves global consistency using: TrueTime API Two-phase commit Paxos only Lamport clocks None In blockchain, which consensus algorithm is energy-efficient compared to Proof of Work? PoS (Proof of Stake) PoW PBFT Byzantine Fault Tolerance None Which cloud model provides hardware resources only? SaaS FaaS IaaS PaaS None Kubernetes is mainly used for: Network simulation Database queries Code compilation Container orchestration None Edge computing reduces latency by: Processing data closer to the source Storing data in the cloud Centralizing data Using faster compilers None In serverless computing, billing is based on: Number of servers Function execution time Fixed monthly cost Storage size only None Which cloud storage system is eventually consistent? MySQL Oracle DB Amazon S3 Google BigQuery None Which algorithm is used in deep reinforcement learning? Q-learning Apriori Naïve Bayes KNN None Transformer-based models (like GPT) use: LSTMs Self-attention RNNs Genetic algorithms None In Support Vector Machines (SVM), the kernel trick allows: Reducing bias Mapping data into higher dimensions Normalization of input Faster hardware execution None Which type of learning involves “reward signals”? Reinforcement Supervised Unsupervised Transfer None GANs (Generative Adversarial Networks) consist of: Predictor + Estimator Encoder + Decoder Classifier + Regressor Generator + Discriminator None Which algorithm solves maximum flow problem? Kruskal Ford-Fulkerson Dijkstra Prim None NP-complete problems are: Solvable in constant time Easy to solve in polynomial time Hard to verify Verifiable in polynomial time None P vs NP problem asks whether: Parallel = sequential computation Algorithms terminate or not All NP problems are solvable in polynomial time Memory = CPU None Quantum algorithms like Shor’s algorithm are useful for: Cache optimization Data compression Sorting arrays Breaking RSA None Which hashing technique guarantees O(1) lookup in theory? Linear probing Double hashing Chaining Perfect hashing None Zero Trust Architecture is based on: Trusting internal users Verifying everything, always VPN-only security Single sign-on None Quantum key distribution (QKD) ensures security using: Quantum mechanics Blockchain Symmetric algorithms Factorization None The Tor network ensures anonymity using: Onion routing End-to-end encryption only Hash functions Symmetric keys None Which cybersecurity attack involves sending data faster than receiver can handle? XSS MITM DoS (Denial of Service) SQL Injection None Homomorphic encryption allows: Data sharing without security Decryption without keys Computation on encrypted data Keyless cryptography None The Turing Award is given for contributions in: Physics Mathematics Engineering Computer Science None Which organization created TCP/IP? Google IBM CERN DARPA None Who is considered the “father of AI”? John McCarthy Claude Shannon Marvin Minsky Alan Turing None Synonym of “Ephemeral”? Rare Strong Temporary Permanent None Antonym of “Prudent”? Wise Careful Thoughtful Reckless None Time's upTime is Up!
