VTU-Affiliation Notification for the AY 2025-26
On line Interaction with Students - Dr.B.S.Nagendra Parashar , Principal, NIE, Mysuru
Room & Seating Allocation 11.3.2026 Forenoon - 1st Sem M.Tech- Semester End Examinations 2025-26 (South Campus)
Room & Seating Allocation 11.3.2026 Forenoon - 1st Sem M.C.A - Semester End Examinations 2025-26 (North Campus)
The Makeup (I, IC and X Grade) Examination UG Time Table of the AY 2025-26
TAS Ikshvaku Racing_ A Student Team That Turned Setbacks into Success
The Final Semester End Examination Time Table for 1st Sem M.Tech for AY 2025-26 (South Campus)
The Final Semester End Examination Time Table for 1st Sem MCA for AY 2025-26 (North Campus)
2nd Sem Revised UG Class Time Table 2025-26 All branches (South Campus)
2nd Sem Revised UG Class Time Table 2025-26 - All branches ( North Campus)
M.Tech & M.C.A. - Backlog Course Registration for the AY 2025-26 (Even Semester)
Circular for ' F' Registration- UG 2022 batch and earlier
4th & 6th Sem Non-Credit Mandatory Courses Class Time Table 2025-26- All branches
Registration for Backlog Courses from 9.2.26 to 17.2.26 & Registration Form for the AY 2025-26
Commencemet of IV Semester (AY 2025-26) for Students of M.Tech & MCA
M.Tech IV semester Academic Calendar (AY 2025-26).
M.C.A. IV semester Academic Calendar (AY 2025-26).
Last permitted Examination for the U.G. & P.G. programmes.
B.E. II Semester Academic Calendar (AY 2025-26).
NAVANIETI - National Level Hackathon 2026 organized by the Dept of ECE, NIE.
Regarding revised procedure of Anti Ragging Undertaking & Compliance Submission & College Details
B.E. VI semester Academic Calendar (AY 2025-26)
B.E. IV semester Academic Calendar (AY 2025-26).
1st Year B.E. - Scheme of Teaching & Examinations - 2025 (OBE & CBCS)
Circular reg. Bus facility for First year Students - North Campus Hostel
Articles
Breaking the Sorting Barrier for Directed Single-Source Shortest Paths in OSPF: Implementation and Experimental Analysis
This project focuses on improving shortest path computation in directed graphs used in OSPF routing protocols. It aims to overcome traditional sorting limitations to make routing faster and more efficient. The work includes implementation and performance analysis.
This project focuses on improving shortest path computation in directed graphs used in OSPF routing protocols. It aims to overcome traditional sorting limitations to make routing faster and more efficient. The work includes implementation and performance analysis.
