POs and BTL

The POs (Revised) addressed by the following CO in the course ‘Environmental Engineering’

“Engage in independent study and make an oral presentation on the hazards of E-waste on environment”

• PO6, PO9 and PO11

• PO6, PO10 and PO11

• PO6, PO7, PO8 and PO11

• PO6, PO9 and PO10

The POs (Revised) addressed by the following CO in a course

“As a member of a team build the control systems tool-box using an engineering tool

• PO2, PO3 and PO9

• PO6, PO7 and PO8

• PO4, PO5 and PO8

• PO3, PO5 and PO8

The POs (Revised) addressed by the following CO in a course

“As a member of a team identify a research work, and reproduce the results”

• PO1, PO2, PO3, PO5, PO7, PO8 and PO11

• PO1, PO2, PO3, PO5, PO8 and PO9

• PO1, PO2, PO3, PO5, PO8, PO9 and PO11

•  PO4, PO5, PO7, PO9 and PO11

The POs (Revised) addressed by the following CO in the course ‘Structural Analysis’
“Analyze a given structure and propose suitable modifications for enhanced stability”

• PO1, PO2, PO3,

• PO1, PO3, PO4

• PO2, PO3, PO6

• PO3, PO4, PO7

5. The POs (Revised) addressed by the following CO in the course ‘Data Science’
   “Develop a predictive model using machine learning and interpret the results”

• PO2, PO3, and PO4

• PO3, PO8, and PO11

• PO2, PO3 and PO5

• PO1, PO4 and PO6

The POs (Revised) addressed by the following CO in the course ‘Internet of Things’
“Develop an IoT-based solution for smart home automation as a Team”

• PO2, PO3, PO5, and PO7

• PO1, PO4, PO6, and PO8

• PO3, PO5, PO8, and PO11

• PO1, PO2, PO6, and PO10

For the question given below find the revised Bloom's Taxonomy.

"Can Dijkstra’s algorithm be applied on graphs with negative weights? Justify your answer. Write the pseudocode to solve the single-source shortest path problem using Dijkstra’s algorithm. Solve the graph given below to obtain the shortest path from vertex ‘A’ and give the time complexity.

• Understand

• Remember

• Apply

• Conduct Investigation

For the question given below find the revised Bloom's Taxonomy.

What is the time complexity to search for a key using chained hashing? Why?

• Understand

• Investigate

• Apply

• Analyze

For the question given below find the revised Bloom's Taxonomy.

"Given the array [45, 20, 35, 10, 50], apply Insertion Sort and show each step. Is the algorithm stable?"

• Understand

• Remember

• Apply

• Analyze

For the question given below find the revised Bloom's Taxonomy.

Explain why a four-stroke engine is more efficient than a two-stroke engine.

• Understand

• Engineer and the World

• Apply

• Analyze