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