Posts

Showing posts from March, 2021

all question papers second (2) semester

Image
 Share more and more And comment for help of mathematics  pre-mst 1( of 2nd semester2020 )            read online                                         click here   download                                             click here MST click here  (2020 second semester  )               click here               ................................................ university paper   (December 2019)        read online        click here download           click here university paper   (May 2019)                   read online        click here download           click here ....................................... of chemistry PreMST 1      (  2020   )                                  click here MST 1       (2020)                                               click here ........................................................... Of PPS  PreMST 1   (2020)                                            click here MST     1     (2020)                                             click here ...............

Major Project Third semester

Major Project Fourth semester

Image
 Share more and more And comment for help Project & Certification Evaluation Scheme For Project evaluation:  Sr. No   Parameter Name Total Marks   Guidelines 1     Technology Used   10 In this Students will be evaluated based on the technology they have used. If a student used :   i) C/C++ may be given 2-3 marks, ii) Java/PHP may be given 4-6 marks iii) Python/AI/ML or any evolving technology may be given 7-10marks 2 Innovation 10 In this the novelty of their work will be evaluated as below:   i) Completely novel =10-9 marks ii) Partially Novel =8- 7 marks iii) Novelty level in below than average = 6-5 marks iv) Zero level of Novelty (without any innovation in already existing ones) = 3 marks 3   Application/ Social impact     10 Here student’s work will be scrutinized based on its applicability:   i) Completely applicable in a real-life environment to solve unsolved issues/help to ease the work which has not been done yet in that respective area= 10-9 marks ii) Improve the solutio

AMCAT

Image
 Share more and more And comment for help AMCAT  : Introduction:  AMCAT tests students from different fields in various domains with the help of in-depth micro analysis in each domain. The test consists of various sections/modules which you can choose according to your profile or educational background. There are certain modules that are compulsory for everyone (Language and Aptitude Modules), whereas others are optional. During the test, you will be given an option to select any two domain-specific modules. It is recommended that you go through the module description and befitting job profiles before you go to take the AMCAT. Your choice of modules increases your visibility for particular kinds of jobs, for instance, if you take the Programming Module, you will be visible to more IT companies whereas taking an HR module will help you find HR profiles. It is best for you to go through the module list now and decide which optional modules you would like to take. Provided below is the li

TPP TECHNICAL

Image
 Share more and more And comment for help

Design and Analysis of Algorithms

Image
 Share more and more And comment for help      Assignment 1  Solution            Download               

Design and Analysis of Algorithms Lab

Image
 Share more and more And comment for help  List of Experiment: Task 1: Code and analyze solutions to the following problem with given strategies: i. Knap Sack using a greedy approach ii. Knap Sack using a dynamic approach Task 2: Code and analyze to find an optimal solution to matrix chain multiplication using dynamic programming. Task 3: Code and analyze to find an optimal solution to TSP using dynamic programming. Task 4: Implementing an application of DFS such as: i. to find the topological sort of a directed acyclic graph ii. to find a path from source to goal in a maze. Task 5: Implement an application of BFS such as: i. to find connected components of an undirected graph ii. to check whether a given graph is bipartite. Task 6: Code and analyze to find the shortest paths in a graph with positive edge weights using Dijkstra’s algorithm. Task 7: Code and analyze to find shortest paths in a graph with arbitrary edge weights using the Bellman-Ford algorithm. Task 8: Code and analyze t

Aptitude

Image
 Share more and more And comment for help Syllabus: Reasoning: Reasoning Lectures   Allotted   (Hours) Quant Lectures   Allotted   (Hours) 1. Coding-Decoding   3 1.   Vedic   Maths   and   Simplification     6   2.   Directions   2 2.   LCM/HCF   and   problem   on   nos. 3.   Odd   man   out 1 3.   Averages 5     4.   Ages     5.   Ratio   proportion 3     6.   Percentages 4 TOTAL 6 TOTAL 18 Execution: Execution S.No. Topics Lectures   Allotted   (Hours)   1 Vedic Maths   and   Simplification     6 2 LCM/HCF and   problem   on   nos. 3 Coding-Decoding 3 4 Averages 5 5 Ages 6 Directions 2 7 Ratio   proportion 3 8 Percentages 4 9 Odd   one   out 1 Logical   +   Quant 24 Assignment 1 Questions          Download Assignment 1  Solution            Download