MU (Mumbai University) Term Test - II Important Questions for AI-DS & ML Semester 4
- Ishita Raikar
- Apr 10
- 2 min read
Updated: Apr 11
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 DBMS
What is data abstraction and data independence?
Types of users in DBMS.
How does a database system architecture differ from a file system architecture?
What is the role of a Database Administrator (DBA) in managing database systems?
Draw Extended E-R diagram for Hospital Management System.
What is the difference between weak and strong entity sets in a database?
How does the Extended Entity-Relationship (EER) model handle generalization, specialization, and aggregation?
Design an EER schema for a BANK database.
Explain types of joins with suitable example
Explain all types of integrity constraints with examples?
IMPS for MP
Draw and explain write operation Timing diagram of 8086 Processor in Maximum mode.
Differentiate between hardware and software interrupts?
Explain protection mechanism of 80386 with diagram.
Explain the following instructions: XLAT, DAA,LAHF,AAA related to 8086.
Explain the interrupt structure of 8086 processor.
What is the advantage of Memory Banking in 8086 Processor?
Write an assembly language program for 8086 to exchange contents of two memory blocks.
Draw and Explain the Master Slave Mode of 8259 Processor with Suitable example.
Interface DMA controller 8257 with 8086 MP. Explain different data transfer modes of 8257 DMAC.
Differentiate between real Mode , Virtual Mode and Protected Mode of 80386 Processor.
IMPS for AOA
How does the Bellman Ford Algorithm handle graphs?
Write and Explain binary search algorithm
What is the difference between time complexity and space complexity?
What is Asymptotic analysis and define big Oh, big Omega and Theta notation?
Write an algorithm for quick sort and sort the following elements [40,11,4,72,17,2,49]. OR Explain quick sort with algorithm and example.
Define NP Class, NP hard, NP complete.
What is the difference between divide and conquer approach and dynamic programming?
Write a short note on job sequencing with a deadline.
Explain Dijkstra Single source shortest path algorithm.
What is a greedy algorithm?
More Subjects and full downloadable PDFs are available in the Bh.Studyroom.
Signup with Brainheaters and get IMPs for all subjects FREE!
Comments