MU (Mumbai University) Term Test - II Important Questions for AI-DS & ML Semester 6
- Ishita Raikar
- Apr 11
- 2 min read
Break your syllabus into small parts and set daily goals. Use simple notes or flowcharts to revise quickly. Don’t skip solving PYQs – they give a clear idea of the paper pattern
IMPS for CSS
Why digital signature and digital certificates are required?
Define the security Mechanisms and attacks for OSI security architecture
Explain the different modes of block ciphers
Explain Diffie hellman key exchange algorithm.
Explain DES algorithms in detail
What are properties of hash function? Compare MD-5 and SHA hash algorithm.
List and explain characteristics needed in secure hash function
What do you understand by digital signatures and digital certificates? Explain digital signature scheme RSA.
Explain any digital signature algorithm in detail
Explain Needham Schroeder Authentication protocol.
IMPS for DAV
Explain the difference between qualitative and quantitative data.
What are the common methods for summarizing quantitative data?
What does the Central Limit Theorem state, and why is it important in statistics?
Why is data analytics lifecycle essential?
List and explain different key roles for successful data analytics?
What is Logistic Regression? What are the similarities and differences between linear regression and logistic regression?
Write a short note on: Generalized linear model
How Exploratory Data Analysis (EDA) is performed in R?
What is the difference between one-way and two-way analysis of variance (ANOVA)?
Describe the assumptions made in one-way ANOVA.
IMPS for DC
Specify and Explain the models of Middleware.
Difference Between NOS and DOS
Describe the working of Remote Procedure Call (RPC) in detail, with the help of a diagram.
Differentiate between message-oriented communication and stream- oriented communication
Explain IPC in Distributed Systems.
Justify how Ricart-Agrawala’s algorithm optimized the Message overhead in achieving mutual exclusion
Explain Suzuki-Kasami Broadcast Algorithm of mutual exclusion.
Explain Maekawa’s algorithm in detail and also specify properties of the Quorum Set.
Compare Load sharing to Task Assignment and Load balancing strategies for scheduling processes in a distributed system.
Describe code migration issues in detail?
More Subjects and full downloadable PDFs are available in the Bh.Studyroom.
Signup with Brainheaters and get IMPs for all subjects FREE!
ความคิดเห็น