The document is a course exit survey for students completing a course on Discrete Computational Structures. It asks students to rate their ability on various course outcomes related to discrete structures like sets, relations, functions, counting, logic, and algebraic structures. For each outcome, students select from options indicating if they feel their ability is very strong, strong, weak, very weak, or unsure. It collects the student's roll number, name, and signature at the end.
The document is a course exit survey for students completing a course on Discrete Computational Structures. It asks students to rate their ability on various course outcomes related to discrete structures like sets, relations, functions, counting, logic, and algebraic structures. For each outcome, students select from options indicating if they feel their ability is very strong, strong, weak, very weak, or unsure. It collects the student's roll number, name, and signature at the end.
Original Description:
Course exit survey of Discrete Computational Structures
The document is a course exit survey for students completing a course on Discrete Computational Structures. It asks students to rate their ability on various course outcomes related to discrete structures like sets, relations, functions, counting, logic, and algebraic structures. For each outcome, students select from options indicating if they feel their ability is very strong, strong, weak, very weak, or unsure. It collects the student's roll number, name, and signature at the end.
The document is a course exit survey for students completing a course on Discrete Computational Structures. It asks students to rate their ability on various course outcomes related to discrete structures like sets, relations, functions, counting, logic, and algebraic structures. For each outcome, students select from options indicating if they feel their ability is very strong, strong, weak, very weak, or unsure. It collects the student's roll number, name, and signature at the end.
Download as XLS, PDF, TXT or read online from Scribd
Download as xls, pdf, or txt
You are on page 1/ 2
Department of Computer Science and Engineering
Course Exit Survey(B.Tech) - November 2017
Dear Students, In order to improve the teaching and learning of the course, a questionnaire is given below to obtain feedback from you on the achievement of the course outcome. For each question, please put tick mark in the appropriate box.
Course Name :CS 201 Discrete Computational Structures
How strong are you in identifying and applying operations on discrete structures such as sets, relations and CO-1. functions in different areas of computing? a) Very Strong b) Strong c) Weak d) Very Weak e) Unsure
CO-2. Rate your ability to solve problems using counting techniques and combinatorics. a) Very Strong b) Strong c) Weak d) Very Weak e) Unsure
CO-3. Are you able to verify the validity of an argument using propositional and predicate logic? a) Very Good b) Good c) Fair d) Poor e) Very Poor
CO-4. Are you able to apply recurrence relations to solve problems in different domains? a) Very Good b) Good c) Fair d) Poor e) Very Poor
CO-5. Rate your ability to solve problems using algebraic structures.
a) Very Strong b) Strong c) Weak d) Very Weak e) Unsure
Are you able to construct proofs using proof by contradiction, proof by contrapositive and by mathematical CO-6. induction? a) Very Good b) Good c) Fair d) Poor e) Very Poor
Roll No : Name : Signature :
Practice classical cryptographic algorithms Practice modern cryptographic algorithms Explain authentication protocols Discuss network security protocols Identify system security threats and security mechanisms.
