Explain information Schema and performance schema.

Comments

Post a Comment

Popular posts from this blog

write an algorithm to insert a node in the linked list

 write an algorithm to insert a node in the linked list? Start by creating a new node with the given data value. Check if the linked list is empty, and if so, make the new node the head of the list. If the linked list is not empty, traverse the list to find the position where you want to insert the new node. You can do this by starting at the head of the list and iterating through each node until you reach the desired position or the end of the list. Once you've found the position to insert the new node, adjust the pointers of the nodes accordingly: Set the new node's next pointer to the node currently at the desired position. If the desired position is not the head of the list, set the next pointer of the previous node to the new node. If the desired position is the head of the list, make the new node the new head of the list. Return the updated linked list. Here's the pseudocode for this algorithm: function insertNode(head, data, position): newNode = Node(data) // Cr...
Read more

DBMS - Database management system Full syllabus in detail.

Unit I Introduction to database system : - database application , evolution of DB and DBMS, Why need data management? Introduction and application of DBMS File system and various database system, Data models,  DBMS architecture,  Data independence, Data modelling using entity- relationship model, Enhanced er modelling.  Unit II relationship database concept and design: introduction to relational database that means RDBMS.  structure of relational database relational model terminology attributes  tuples relations relational db schema relational algebra basic operation: selection and projection set theoretic operation union intersection  set difference and division join operation inner and outer left outer  right outer full outer and join relational database design functional dependency definition trivial and nontrivial FD 1NF 2NF 3NF decomposition using fd preservation  BCNF Multivalued dependency 4NF Join Dependency and 5NF ...
Read more

Short Note On binary search and binary tree

 Binary search is a searching algorithm used to find the position of a target value within a sorted array. Here's how it works: Start by setting the lower bound low to 0 and the upper bound high to the length of the array minus 1. Calculate the middle index mid as the average of low and high, rounded down to the nearest integer. Compare the target value with the value at the middle index in the array: If they're equal, the target value has been found. Return the middle index. If the target value is less than the middle value, set high to mid - 1 and repeat step 2. If the target value is greater than the middle value, set low to mid + 1 and repeat step 2. If the target value is not found after iterating through the array, return -1 to indicate that the value was not found. Here's the pseudocode for this algorithm: function binarySearch(array, target): low = 0 high = array.length - 1 while low <= high: mid = floor((low + high) / 2) if array[mid...
Read more