course end survey ds_b sec

3
1 MUFFAKHAM JAH COLLEGE OF ENGINEERING & TECHNOLOGY DEPARTMENT OF INFORMATION TECHNOLOGY COURSE END SURVEY Subject Name: Data Structures Academic Year: 2014-2015 Class: B.E. (IT) 2014-15 I-SEM Section: B Name: Roll No: The following survey is an indirect assessment of your technical abilities with respect to subject mentioned above. Please read the following carefully and based on self-assessment of your own capabilities and tick the appropriate one. Course Outcomes & Survey Questions Yes No CO1 Describe the basic techniques of algorithm analysis and functionality of a data structure as an ADT Q1: Able to analyze the performance of a given algorithm. Q2: Able to write Abstract Data types of different data structures. CO2 Explain various Linear Data Structures and Hashing Q1: Able to implement the various operations on Linear data structures Q2: Able to use hashing techniques for retrieval of elements. CO3 Identify and explain various Non Linear Data Structures, and write algorithms to implement them Q1: Able to differentiate among different types of non- linear data structures

Upload: sobhan-dasari

Post on 18-Jan-2016

5 views

Category:

Documents


0 download

DESCRIPTION

cf

TRANSCRIPT

Page 1: Course End Survey DS_B SEC

1

MUFFAKHAM JAH COLLEGE OF ENGINEERING & TECHNOLOGY

DEPARTMENT OF INFORMATION TECHNOLOGY

COURSE END SURVEY

Subject Name: Data Structures Academic Year: 2014-2015

Class: B.E. (IT) 2014-15 I-SEM Section: B

Name: Roll No:

The following survey is an indirect assessment of your technical abilities with respect to subject mentioned above. Please read the following carefully and based on self-assessment of your own capabilities and tick the appropriate one.

Course Outcomes & Survey Questions Yes No

CO1 Describe the basic techniques of algorithm analysis and functionality of a data structure as an ADT

Q1: Able to analyze the performance of a given algorithm.

Q2: Able to write Abstract Data types of different data structures.

CO2 Explain various Linear Data Structures and Hashing

Q1: Able to implement the various operations on Linear data structures

Q2: Able to use hashing techniques for retrieval of elements.

CO3 Identify and explain various Non Linear Data Structures, and write algorithms to implement them

Q1: Able to differentiate among different types of non-linear data structures

Q2: Able to perform elementary operations on trees and graphs

CO4 Illustrate different types of sorting techniques, write algorithms to implement them, and analyze their performances

Q1: Able to sort given data elements using different sorting techniques

Q2: Able to write programs to implement sorting methods.

Please turn over to refer the program outcomes and course outcomes

Page 2: Course End Survey DS_B SEC

2

Course End Survey of Data Structures based on PO of IT Department

Program Outcomes of IT Department

1. Apply knowledge of computing, mathematics, science and IT engineering fundamentals for solution of

complex problems.

2. Analyze a problem, and identify and formulate the requirements appropriate to its solution

3. Design and implement a computer-based system, process, component, or program to meet the needs with

appropriate consideration for public health and safety, cultural, societal and environmental considerations.

4. Use research - based knowledge and research methods to derive valid conclusions for complex problems.

5. Use current techniques and modern tools necessary for computing practice i.e. for presentation and report.

6. Apply reasoning informed by the contextual knowledge to assess societal, health, safety, legal and cultural

issues and the consequent responsibilities relevant to the professional IT practice.

7. Examine the impact of professional engineering solutions in societal and environmental contexts and

demonstrate the knowledge of and need of sustainable development.

8. Understand professional, ethical, legal, security and social issues and responsibilities.

9. Function effectively individually and on teams, including diverse and multidisciplinary, to accomplish a

common goal.

10. Communicate effectively with a range of audiences in various formats.

11. Recognize and engage in continuous professional development.

12. An ability to understand engineering and management principles and apply these to one’s own work, as a

member and leader in a team, to manage projects.

Mapping of PO with Course Outcomes of Data Structures

BIT 204 PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9

PO10

PO11

PO12Data Structures

CO1: Describe the basic techniques of algorithm analysis and functionality of a data structure as an ADT

2 2

CO2 Explain various Linear Data Structures and Hashing

2 3

CO3 Identify and explain various Non Linear Data Structures, and write algorithms to implement them

2 3

CO4 Illustrate different types of sorting techniques, write algorithms to implement them, andAnalyze their performances.

2 3