sushilk.1991
BAN USER- 1of 1 vote
AnswersQuestion Number 1
- sushilk.1991 in India
Consider a table "Student" consisting of columns (Student ID, Student Address, Course).
Every student is allowed to enroll in multiple courses and every course is allowed to enroll more than one student. Also every time a student changes address, all his relevant records must be changed to reflect the new address.
What would be the Normal form required to avoid this redundancy?
2nd NF
4th NF
3rd NF
1st NF| Report Duplicate | Flag | PURGE
Oracle Database
- 1 Answer DBMS
Question Number 1
- sushilk.1991 July 19, 2012
Consider a table "Student" consisting of columns (Student ID, Student Address, Course).
Every student is allowed to enroll in multiple courses and every course is allowed to enroll more than one student. Also every time a student changes address, all his relevant records must be changed to reflect the new address.
What would be the Normal form required to avoid this redundancy?
2nd NF
4th NF
3rd NF
1st NF| Flag | PURGE
Ya we have to change the construction of max heap such that similar elements are neglected and only one instance of it is considered.
- sushilk.1991 July 14, 2012We can find kth smallest or maximum no using max or min heap concept as follows:
Step 1: From first K numbers build a max heap so that the top element is the largest among first K nos. Say that element is X
Step 2: Now as numbers are coming for processing, say coming number be A
If A>X then A cant be Kth Smallest.
If A=X then no change is needed.
If A<X then X cant be Kth smallest element so replace X with A and call Heapify.
For Kth largest build min heap.
What is the output??
- sushilk.1991 August 25, 2012