What are the various HTML version And How they are different ?

.

Comments

Post a Comment

Popular posts from this blog

What is NIMCET? | Purpose, Participating Institutes, Exam Pattern, Eligibility, Admission Process, Counseling, Syllabus and Preparation

The NIMCET (National Institute of Technology MCA Common Entrance Test) is a national-level entrance exam conducted in India for admission to the Master of Computer Applications (MCA) program offered by various National Institutes of Technology (NITs) located across the country. NIMCET is a highly competitive examination that allows candidates to seek admission to some of the top NITs, which are renowned for their MCA programs.   Here are some key points about the NIMCET exam:   1. Purpose: NIMCET is conducted to assess the eligibility of candidates for admission to the MCA programs at NITs. It is the common entrance test for MCA programs in these institutions.   2. Participating Institutes : NIMCET scores are accepted by 11 NITs across India, including NIT Trichy, NIT Surathkal, NIT Warangal, and others. Candidates who qualify can seek admission to any of these NITs based on their rank.   3. Exam Pattern : The NIMCET exam typically consists of multip...
Read more

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