Skip to main content

Joint Entrance Exam: JEE Main 2019

JEE-MAIN I & JEE-MAIN II

National Testing Agency (NTA) has released the notification for the JEE-Main I, JEE- Main II. This year JEE-Main will the first time conducted by national testing agency(NTA), earlier JEE-Main were conducted by the central board of secondary education.

National Testing Agency (NTA) will conduct JEE-Main twice in a year called JEE-Main I and JEE-Main II, this provides flexibility to aspirants to learn from a mistake and perform better. This year JEE-Mains I-2019 is scheduled between 06-to-20th January 2019, the exam will be computer-based only.

JEE-MAIN-I SCHEDULE

JEE Main Examination                    JEE Main I
Mode of Examination                       Computer-Based  
Registration Dates                           1st to 30th September 2018
Date for Downloading Admit Card   17th December 2018
Date of Examination                        6th to 20th January 2019
Date of Announcing Results            31st January 2019

JEE-MAIN-II SCHEDULE

JEE Main Examination                    JEE Main II
Mode of Examination                       Computer-Based  
Registration Dates                           8th February to 7th March 2019
Date for Downloading Admit Card   18th March 2019
Date of Examination                         6th to 20th April 2019
Date of Announcing Results             30th April 2019

 A qualified student will get admission in NIT, IIIT based on common merit list CML

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

Labels:

Comments

Post a Comment

Popular posts from this blog

Clique in Graph

Clique in Graph In this tutorial, we will learn about the clique in the graph theory. Clique In graph theory, a clique is a subset of vertices of an undirected graph such that every two distinct vertices in the clique are adjacent. Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
Post a Comment
Read more

Equations

In general we frame real life problems into some mathematical formula called equations in which we use constant and some variables(unknown) Example: Ram is 12 years old.Ram 's age is 3/5 of Shyam's age what is Shyam's age. Let Shyam's age is x then 3/5 of sham's age is 3*x/5 x*3/5=12 x=60/3=20 so Shyam's age is 20. Linear equations When there is a linear combination of unknown variables is there then eqn is linear Example: 3x+ 2y+ 4z=9 Non Linear Equations: Equations in which non linear combination of the variable is there then eqn is non linear. When any 2 unknown variable multiplication present in the equation then it is the nonlinear equation. Example: 2x+5yz=98 is a nonlinear equation because yz multiplication is there: Quadratic equation in one variable: x^2 + 4*x + 2=0 is non linear because unknown variable x is being multiplied in term x^2 Quadratic equation in many variable: x^2 + y^2 +z^2 + w=0 cubic equati...
Post a Comment
Read more

Practice Problem on Square Measurement

Practice Problem on Square Measurement What is the area of square having side length 5 unit? 25 unit 2     10 unit 25 unit 10 unit 2 What is the  perimeter of a square   having side length 5 unit? 20 unit 20 unit 2 10 unit 10 unit 2 What is the  diagonal  length of a square   having side length 5 unit? 5√2 unit     5√2 unit 2 10 unit 10 unit 2 What is the side length of square having area equal to  25 unit 2  ? 5 unit 5  unit 2 10 unit 10  unit 2 There is a petrol pump in a area having length and width equal to 500 meter. What will be cost to put bricks in the whole area if bricks having length and width equal to 5 cm and cost of 1 bricks is Rs 5? Rs 500000000 Rs 50000000 Rs 5000000 Rs 500000 Related Post:  Square Mensuration Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above. ...
1 comment
Read more

Vertex Cover

Vertex Cover In this tutorial, We will learn about the vertex cover in graph theory. Vertex Cover  A vertex cover of an undirected graph is a subset of its vertices such that for every edge (u, v) of the graph, either u or v is in vertex cover i.e minimum number of vertices that covers all edges of the given graph. Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
Post a Comment
Read more