Available courses

Course Objective

1. Implement Stack, Queue, and Circular Queue using arrays and lists. 

2. Implement Tree, Binary Tree, Tree Traversal, Binary Search Tree, and operations for insertion and deletion. 

3. Implement popular Searching and Sorting Algorithms. 

4. Develop problem-solving skills using data structures. 

Course Outcome 

1. Develop proficiency in implementing data structures. 

2. Gain practical experience in using arrays and lists to implement Stack, Queue, and Circular Queue. 

3. Understand the concepts of Tree, Binary Tree, and Binary Search Tree, and learn to implement them efficiently. 

4. Learn various searching and sorting algorithms and gain experience in implementing them.

Course Objective 

1. Develop skills in polynomial interpolation and error analysis. 

2. Implement numerical methods for solving equations and analyze root convergence rates. 

3. Apply Bessel's, Newton's, Stirling's, and Lagrange's methods for solving mathematical problems. 

4. Implement the method of least square curve fitting. 

5. Implement numerical differentiation using trapezoidal and Simpson 3/8 rules. 

6. Analyze data using frequency chart, regression analysis, linear and polynomial fits. 

Course Outcome 

1. Implement polynomial interpolation and analyze errors. 

2. Apply numerical methods for solving algebraic and transcendental equations and analyze root convergence rates. 

3. Apply various methods (Bessel's, Newton's, Stirling's, Lagrange's) to solve mathematical problems. 

4. Implement the method of least square curve fitting. 

5. Implement numerical differentiation using trapezoidal and Simpson 3/8 rules. 

6. Analyze data using frequency chart, regression analysis, linear and polynomial fits.

Course Objective : To demonstrate understanding of numerical and statistical methods in support of the analysis, design and application for problem solving in the field of information technology. 

Course Outcome:

1. Recognize the error in the number generated by the solution. 

2. Compute solution of algebraic and transcendental equation by numerical methods like Bisection method and Newton Rapshon method. 

3. Apply method of interpolation and extrapolation for prediction. 

4. Recognize elements and variable in statistics and summarize qualitative and quantitative data. 

5. Calculate mean, median and mode for individual series. 

6. Outline properties of correlation and compute Karl-Pearson‟s coefficient of correlation.

This course is designed to provide a comprehensive understanding of data structures, their implementations in C, and their applications in solving complex problems.

What You'll Learn:

  • Introduction to Data Structures: Understand the basics of data organization and manipulation.
  • Core Data Structures:
    • Arrays: Sequential data storage and manipulation.
    • Linked Lists: Dynamic memory management with singly, doubly, and circular linked lists.
    • Stacks & Queues: Learn LIFO and FIFO concepts for data processing.
    • Trees & Binary Trees: Organize hierarchical data efficiently.
    • Graphs: Represent and navigate complex networks.
    • Hash Tables: Fast data retrieval and storage using hashing techniques.
  • Algorithm Integration: Implement sorting (bubble, merge, quick) and searching (binary, linear) algorithms.
  • Practical Implementation: Write C code to create and optimize each data structure.
  • Problem-Solving Skills: Apply data structures to real-world challenges like route planning, scheduling, and memory management.



 This course is designed for beginners and covers the foundational programming concepts, equipping you with the skills to write, debug, and execute code confidently.

What You'll Learn:

  • Programming Basics: Understand variables, data types, and control structures.
  • Problem-Solving Techniques: Break down complex problems into manageable solutions using algorithms.
  • Coding Languages: Get hands-on experience with programming language C/ C++.
  • Debugging and Optimization: Learn to identify and fix errors in your code effectively.
  • Real-World Applications: Work on practical projects, such as creating games, automating tasks, and developing basic web applications.

Outcomes:
By the end of this course, you will be able to write functional programs, understand programming logic, and be prepared to advance to more specialized areas such as web development, data science, or software engineering.


This course provides a comprehensive introduction to the concepts, techniques, and applications of graph theory.

What You'll Learn:

  • Foundational Concepts: Understand the basics of graphs, including vertices, edges, paths, cycles, and connectivity.
  • Types of Graphs: Learn about directed graphs, undirected graphs, weighted graphs, bipartite graphs, and more.
  • Graph Algorithms: Explore key algorithms like shortest path (Dijkstra's and Bellman-Ford), minimum spanning tree (Kruskal's and Prim's), and depth-first and breadth-first searches.
  • Applications of Graph Theory: Discover real-world uses in areas like computer networks.

By the end of this course, you’ll be able to analyze and solve problems using graph theory concepts, implement graph algorithms, and apply graph-based solutions in diverse fields such as data science, AI, and operations research.



Course Objective: To demonstrate understanding of numerical and statistical methods in support of the analysis, design and application for problem solving in the field of information technology. 

Course Outcome :

1. Recognize the error in the number generated by the solution. 

2. Compute solution of algebraic and transcendental equation by numerical methods like Bisection method and Newton Rapshon method. 

3. Apply method of interpolation and extrapolation for prediction. 

4. Recognize elements and variable in statistics and summarize qualitative and quantitative data. 

5. Calculate mean, median and mode for individual series. 

6. Outline properties of correlation and compute Karl-Pearson‟s coefficient of correlation.

Write a Shell script that accepts a filename, starting and ending line numbers as arguments and displays all the lines between the given line numbers.

Write a Shell script to show functioning of for loop in shell programming.

Write a shell script using while loop.

Write a shell script using if else statement

Write a Shell script to list all the files in a directory

Write a Shell script to find whether a number is even or odd

Write a Shell script to find the factorial of a given integer

Write a shell script that computes the gross salary of an employee according to the following rules: (The basic salary is entered interactively through the keyboard.) I. If basic salary is < 1500 then HRA-10% of the basic and DA =90% of the basic. II. If the basic salary is >=1500 then HRA-Rs500 and DA-98% of the basic

Write a C program to create a zombie process.

Write a shell script which receives two file names as arguments. It should check whether the two file contents are the same or not. If they are the same then the second file should be deleted.

Describe some Internal commands


Describe some External commands

* Introduction of Full Stack Development using Spring boot

* Using bootstrapping in Spring boot

* Working with Tomcat deployment

(Besides these additional experiments can be included to give hands on experience to students. Students can be provided opportunity to work on any Information System to give them better understanding of Information System)

Course Outcome:

Through completion of the Certificate course in Information Technology program, students will: 

1. Develop information technology solutions by evaluating user requirements in the systems development environment. 

2. Apply knowledge of IT requirements for technology solutions in cutting edges applications. 

3. Analyze a problem and identify and define the computing requirements for the appropriate solutions. 

4. Create, select and apply appropriate techniques, resources, and modern engineering and IT tools.

1. Creating ER diagrams and Schema Diagrams of real world problems. 

2. Creating tables and data population. 

3. Writing SQL queries using following operators: (a) Logical operators (=,<,>,etc.). (b) SQL operators (Between…. AND, IN(List), Like, ISNULL and also with negating expressions ). (c) Set Operators(UNION, INTERSECT, and MINUS, etc.).

 4. Writing SQL queries using Character, Number, Date and Group functions.

 5. Writing SQL queries for extracting data from more than one table (Equi-Join, Non-EquiJoin , Outer Join)

 6. Creating VIEWS using SQL and performing operation on it. 

7. Writing ASSERTIONS using SQL 

8. Writing programs using PL/SQL. 

9. Use Concepts for ROLL BACK, COMMIT & CHECK POINTS. 

10. Write queries using CURSORS.

11. Write TRIGGRS using PL/SQL 

12. Create FORMS and REPORTS.

1. Divide and conquer method (quick sort, merge sort, Strassen’s matrix multiplication)

2. Greedy method (knapsack problem, job sequencing, optimal merge patterns, minimal spanning trees). 

3. Dynamic programming (multistage graphs, OBST, 0/1 knapsack, traveling salesperson problem).

 4. Back tracking (n-queens problem, graph coloring problem, Hamiltonian cycles). 

5. Sorting : Insertion sort, Heap sort, Bubble sort 

6. Searching : Sequential and Binary Search 

7. Selection : Minimum/ Maximum, Kth smallest element

* Introduction of Spring boot, Java React
* Using bootstrapping in Spring boot, Working with Tomcat deployment
* Spring Boot- code structure ,logging ,Building restful web services

* (Besides these additional experiments can be included to give hands on experience to students. Students can be provided opportunity to work on any Information System to give them better understanding of Information System)

Working with Microsoft office (word, excel, power point, access)

Use of Search Engine and World Wide Web, Creation of email id and working with email, Use of FTP service

Basics of Cloud computing, Internet of things (IoT) and Data Science

 (Besides these additional experiments can be included to give hands on experience to students. Students can be provided opportunity to work on any Information System to give them better understanding of Information System)

This lab shall have minimum 25 programs in C. There shall be minimum two programs per module as taught in theory. Programming shall follow logic/algorithm and flowchart wherever applicable. Exercises shall also enhance analytical and debugging abilities.

Unit I Electron Spin Resonance Spectroscopy 

Principle and theory, Kramer degeneracy, g factor, electron-nuclear coupling (hyperfine structure), line shape and width, Mc Connell relationship, endor and eldor, electron-electron coupling. Techniques of measurement, application of ESR to organic free radicals and to transitional metal complexes (having and unpaired electron) including biological systems. 

Unit II Nuclear Magnetic Resonance Spectroscopy 

(a). Chemical shift values for protons bonded to carbon (aliphatic, olelinic, aldehydic and aromatic) and other nuclei (alcohols, phenols, carboxylic acids, amines, amides), chemical exchange, effects of deuteration, Karplus curve-variation of coupling constant with dihedral angle. (b). Carbon-13 NMR Spectroscopy General consideration, chemical shift (aliphatic, olefinic, alkyne, aromatic, heteroaromatic and carbonyl compound), coupling constants. (c). Nuclear Quadrupole Resonance: Principle, Theory and applications

Molecular Electronic Spectroscopy

Energy levels, molecular orbitals, vibronic transitions, vibrational progressions and geometry of excited states, Franck-Condon principle, Dissociation and pre-dissociation, electronic spectra of polyatomic molecules. Emission spectra, radiative and non-radiative decay, internal conversion.

Unit III Magnetic Resonance Spectroscopy 

Nuclear Magnetic Resonance Spectroscopy Nuclear spin, nuclear resonance, saturation, shielding of magnetic nuclei, chemical shift and its measurement, factor influencing chemical shift, deshielding, spin-spin interaction, factors influencing coupling constant ‘J’. Classification (ABX, AMX, ABC, A2B2 etc.), spin decoupling, basic ideas about instrument, NMR studies of nuclei other than proton13C, 19F and 31P. FT NMR, advantages of FT NMR, use of NMR in medical diagnostics.

Unit-III 

Non-Equilibrium Thermodynamics

Non-Equilibrium Thermodynamics Thermodynamic criteria for non-equilibrium states, entropy production and entropy flow, entropy balance equations for different irreversible processes (e.g., heat flow, chemical reaction etc.) transformations of the generalized fluxes and forces, non-equilibrium stationary states, phenomenological equations, microscopic reversibility and Onsager’s reciprocity relations, electrokinetic phenomena, diffusion, electric conduction, irreversible thermodynamics for biological systems, coupled reactions.

Unit IV 

Chromatographic Methods 

Principle, instrumentation and applications of gas liquid chromatography and HPLC. Ion exchange chromatography: cationic and anionic exchanges and their applications. Van-Deemter equation (no derivation), concept about HEPT-plate theory and rate theory. Applications.  

Unit V 

Radio Analytical Methods 

Basic principles and types of measuring instruments, isotope dilution techniques: principle of operations and uses. Applications.  

Unit II Statistical Thermodynamics

Concept of distribution, thermodynamic probability and most probable distribution. Ensemble averaging, postulates of ensemble averaging. Canonical, grand canonical and microcanonical ensembles, corresponding distribution laws- (using Lagrange’s method of undetermined multipliers). Partition functions- translational, rotational, vibrational and electronic partition functions. Calculation of thermodynamic properties in terms of partition functions. Applications of partition functions.

Unit I 

Electronic Spectra & Magnetic Properties of Transition Metal Complexes.

Unit III Metal Clusters

Unit IV Silicates

Organic Chemistry - I

Unit I Nature of Bonding in Organic Molecules

Unit II Stereochemistry

Unit III Reaction Mechanism : Structure and Reactivity

Unit IV Aliphatic Nucleophilic Substitution

Unit V Aliphatic Electrophilic Substitution

Total Unit - 5

Unit I - Disconnection Approach

Unit II - Protecting Groups

Unit III - One Group and Two Group C-C Disconnections

Unit IV - Determination of Reaction Mechanism

Unit V - Photochemical Reactions

Applied Anthropology for the Students of MA/MSc III Semester

Semester III (July to November)

SLS/HAB/E02C     Fishery Science (Theory) 

SLS/HAB/E03        Lab course II

Semester I (July to November)

SLS/HAB/C002      Taxonomy & Systematics (Theory) 

SLS/HAB/C005       Lab course I 

Pre-PhD
PHABE-04            Population and Conservation Biollogy (Theory)
PHABE-05            Biodiversity and Biosyatematics (Theory)



SLS/MIC/C009: BIOLOGICAL TECHNIQUES (M.Sc. Even Semester)

 Unit I: Microscopy and Biosensors Microscopy (Principles and applications): Light, phase contrast, fluorescence and confocal microscopy, Scanning and transmission electron microscopy; Biosensors: Introduction and principles, First, second and third generation instruments, Cell based biosensors, Enzyme immunosensors, DNA biosensor. 

Unit II: Centrifugation Basic principle and applications of centrifugation; Centrifugal force; Sedimentation rate; Sedimentation coefficient; Common centrifuges used in laboratory (Clinical, micro, high speed, ultra and industrial centrifuges); Types of rotors (Fixed- angle, swinging bucket and continuous tubular); Types of centrifugation (Principle and applications): Preparative (Differential and density gradient centrifugation) and analytical centrifugation. 

Unit III: Chromatography General principle and applications of chromatography; Types of chromatography (Principles and applications): Adsorption chromatography, Ion exchange chromatography, Affinity chromatography, Size exclusion chromatography, Thin layer chromatography, Gas chromatography, High pressure liquid chromatography (HPLC), Supercritical fluid chromatography. 

Unit IV: Electrophoretic Techniques General principle and applications of electrophoresis; Types of electrophoresis (Principles and applications): Paper electrophoresis, Moving boundary electrophoresis, Isotachophoresis, Agarose gel electrophoresis, Polyacrylamide gel electrophoresis (SDS-PAGE, Native-PAGE, Denaturing-PAGE and Reducing-PAGE), Isoelectric focusing (IEF), Pulse field gel electrophoresis (PFGE), Disc gel electrophoresis. 

Unit V: Spectroscopy and Radiotracer Techniques Spectroscopic methods (Principle and applications): UV, Visible, IR, NMR, Fluorescence, ESR, Atomic absorption, CD, ORD and Raman Spectroscopy; Mass Spectrometry: Principles and application of MALDI-MS, Ionization methods; Radiotracer techniques: Applications of radioisotopes in biology, Properties and units of radioactivity, Radioactive isotopes and half-life, Safety rules in handling of radioisotopes, Measurement of radioactivity (GM counter, gamma counter, wilson cloud chamber and liquid scintillation counter), Autoradiography: Principle and its applications.

  • To introduce the student to the basics of wave optics, lasers, and demonstrate their applications in technology, and make them aware of quantum physics phenomena. Further, a brief introduction of recent developments in materials science & engineering and its application within the class framework. Also Introduces the relationship between processing, structure, and physical properties of materials engineering. Finally, make them aware of Electromagnetic waves and the fundamentals of electromagnetism.