Do i need write any entrance exam for joining cyber forensics and information security in madras university?
Madras University offers Masters Degree course, i.e M.Sc. Cyber Forensics and Information Security ( Regular & self supportive). Under the department, Centre for Cyber Forensics & Information Security. For which the eligibility is
- A degree in computer Science/ Computer Applications/ Information Technology/ any other equivalent degree in Information Technology , computer science (or)
- B.Sc. in Mathematics/ physics/ statistics/ electronic science or B E /B.Tech.
Madras University offers a Diploma course in cyber crime and information security, under criminology department. For which the eligibility criteria is you have to be a graduate from the Madras university or from any other university recognized as equivalent thereto.
Using the below link you can check the other courses and their eligibility criteria.
https://www.unom.ac.in/webportal/uploads/admissions/eligiblity_condition_2023.pdf
How much percentile in JEE Mains would be needed to get admission in NUS(National University of Singapore) Computer engineering? is 98%ile enough?
Hello,
Hope you are doing great.
To answer your question To gain admission to the Computer Engineering program at the National University of Singapore (NUS), it is crucial to comprehend the admission criteria
JEE Mains Percentile:
The anticipated JEE Main Cutoff for 2024 across different categories is as follows:
General: 89+ percentile
EWS: 78+ percentile
OBC: 74+ percentile
SC: 44+ percentile
PwD: 0.11+ percentile¹.
A commendable percentile in JEE Mains 2024 falls within the range of 90-95 percentile³.
However, it is important to note that meeting the previous year's cutoff does not guarantee admission for the current year.
Hope this helps!!
Question : Comprehension:
Read the following passage and answer the questions that follow.
Indian mathematician Nikhil Srivastava, working at the University of California in Berkeley, is among the winners of the Prestigious 2021 Michael and Sheila Held Prize, announced last week by the US National Academy of Sciences (NAS). Adam W. Marcus, EPFL (Swiss Federal Institute of Technology, Lausanne), and Daniel Alan Spielman, Yale University, are the other two winners.
"Marcus, Spielman, and Srivastava solved longstanding questions on the Kadison-Singer problem and on Ramanujan graphs, and in the process, they uncovered a deep new connection between linear algebra, the geometry of polynomials, and graph theory that has inspired the next generation of theoretical computer scientists," the NAS said in a statement.
An Indian national, Nikhil was born in New Delhi in November 1983 and has attended educational institutions across the world—Syria, the UK, Saudi Arabia, and the US—as his father was an Indian Foreign Services officer, who has served as the Indian ambassador to Uganda and Denmark. At present, Nikhil is an associate professor of mathematics at UC Berkeley. The Michael and Sheila Held Prize is presented annually to honour outstanding, innovative, creative, and influential research in the area of combinatorial mathematics.
Question:
Which of the following is NOT true of Nikhil Srivastava, according to the passage?
Option 1: He had his education in many countries around the world.
Option 2: He has served as the Indian ambassador to Denmark and Uganda.
Option 3: He was born in North India in the early 1980s.
Option 4: He is now a faculty at the University of Califomia.
Correct Answer: He has served as the Indian ambassador to Denmark and Uganda.
Solution : The correct choice is the second option.
As stated in the last paragraph of the passage, it was Nikhil's father who was an Indian Foreign Services officer and served as the Indian Ambassador to Uganda and Denmark, and not him.
Therefore, the correct answer is: He has served as the Indian ambassador to Denmark and Uganda.
Question : Comprehension:
Read the following passage and answer the questions that follow.
Indian mathematician Nikhil Srivastava, working at the University of California in Berkeley, is among the winners of the Prestigious 2021 Michael and Sheila Held Prize, announced last week by the US National Academy of Sciences (NAS). Adam W. Marcus, EPFL (Swiss Federal Institute of Technology, Lausanne), and Daniel Alan Spielman, Yale University, are the other two winners.
"Marcus, Spielman, and Srivastava solved longstanding questions on the Kadison-Singer problem and on Ramanujan graphs, and in the process, they uncovered a deep new connection between linear algebra, the geometry of polynomials, and graph theory that has inspired the next generation of theoretical computer scientists," the NAS said in a statement.
An Indian national, Nikhil was born in New Delhi in November 1983 and has attended educational institutions across the world—Syria, the UK, Saudi Arabia, and the US—as his father was an Indian Foreign Services officer, who has served as the Indian ambassador to Uganda and Denmark. At present, Nikhil is an associate professor of mathematics at UC Berkeley. The Michael and Sheila Held Prize is presented annually to honour outstanding, innovative, creative, and influential research in the area of combinatorial mathematics.
Question:
What is the connection between the prize winners and the famous Indian mathematical genius Ramanujan?
Option 1: They explained Ramanujan's graphs in solving the Kadison-Singer problem.
Option 2: The prize winners were all admirers of Ramanujan's great contribution.
Option 3: The prize winners were all students of Ramanujan.
Option 4: They solved questions on Ramanujan's graphs that had not been solved for a long time.
Correct Answer: They solved questions on Ramanujan's graphs that had not been solved for a long time.
Solution : The correct choice is the fourth option.
As stated in the second paragraph of the passage, the prize winners, Marcus, Spielman, and Srivastava, solved longstanding questions on the Kadison-Singer problem and on Ramanujan graphs.
Therefore, the correct answer is: They solved questions on Ramanujan's graphs that had not been solved for a long time.