Department Computer Science

Transcription

1 Department Computer Science PROGRAMME OUTCOMES OF B.SC. PROGRAMMES Apply the broaden and in-depth knowledge of science and computing to analyse, think creatively and generate solutions to face the global challenges. Foster intellectual curiosity, critical thinking and logical reasoning. Adapt to different roles and responsibilities and develop leadership qualities in multicultural working environment by relating to diversity and ethical practices. Update the techniques and acquire skills to develop systems and methods to solve current problems. PROGRAMME SPECIFIC OUTCOMES Upon completion of B.Sc. Degree programme, the graduates will be able to : PSO -1 Implementing the knowledge of computing in communication and ICT skills. PSO - 2 PSO - 3 Apply the broaden and in-depth knowledge of Mathematics, Science and computing to analyze, think creatively and generate innovative solutions to face the global challenges. Acquire current techniques and skills using modern tools to face day-to-day challenges. Semester: I Name of the Course: Programming in C Subject Code: SC1711 No. of hours per week No. of credits Total no. of hours Total marks Course Outcomes CO Upon completion of this course the students will be able to : PSO addressed CL CO-1 Recall the basic structure and key elements. PSO-1 R CO-2 Understand the fundamentals of C programming PSO-2 U CO-3 Analyze the various programming constructs and implement it to PSO-3 AN, AP perform specific task. CO-4 Design and develop modular programming skills PSO-3 C

2 Teaching Plan Total contact hours: 60 (Incl. lectures, assignments and test) Unit Module Topics hours I Introduction to C programming 1. History of C & Importance of C II 2. Basic Structure of C Programs 3. Character Set, Tokens, Keywords, Identifiers and Constants 4. Data Types and Variables, Declaration of variables & Assigning values to variables Learning Outcome 1 To understand how C language comes into existence and the reasons for learning C 1 To understand an overview of a C program 3 To understand the basic program elements of C 3 To understand the various data types in C To be able to declare and assign values to variables in program 5. Operators 2 To identify the various built-in operators 6. Expressions 2 To be able to evaluate the expressions Decision Making, Branching and Loop Statements 1. Formatted Input, Formatted Output 2. Decision Making Using if Statement 3. Switch statement, goto Statement 5 To understand the format for giving input in the program To understand the format for displaying the output 2 To develop programs using decision making statements 2 To analyze the various programming constructs and implement it to Pedagogy,, / through: short test Multiple choice questions Quiz

3 III IV perform specific task 4. While, do statement, For statement 3 To develop programs using loop structures 5. Jumps in loops 2 To distinguish the difference between break, continue, exit instructions Arrays and Strings 1. One-Dimensional array 2 To declare array variables and able to write programs using array 2. Two-Dimensional arrays 3. Reading Strings from Terminal 4. Writing Strings to Screen 5. String Handling Functions User-Defined Functions 1. Definition, Need and Function Calls, Function Declaration 2. No Arguments and No Return Values Arguments But No Return Values concept 1 To declare array variables and able to write programs using array concept 1 To be able to read strings from terminal 1 To be able to display strings to the screen 2 To understand the string functions that are supported by C library 2 To be able to differentiate calling function and called function To understand the reasons for using functions in a program 2 To acquire the skills to identify whether a function has arguments or not, whether it return values or not,,, Assignment on category of functions 3. Arguments Return Values 2 To acquire the skills to identify

4 No Argument But Returns a Value whether a function has arguments or not, whether it return values or not 4. Recursion 1 To develop programs using recursion concept V 5. Passing Arrays to Functions Structures, Unions and Pointers 1. Definition of Structure, Declaring structure variables, Accessing structure members & structure Initialization 1 To create programs by passing array values inside a function 2 To be able to define declare, access and initialize variables using structure To distinguish the difference between arrays and structures 2. Arrays of Structures 1 To be able to use arrays of structures in C program 3. Unions 1 To analyze how structures and unions differ in terms of their storage technique 4. Pointers 2 To be able to define, declare, access the address of variable using pointer Course Instructor: J. Anto Hepzie Bai,,,, HOD: J. Anto Hepzie Bai

5 Digital Computer Fundamentals Subject Code: SA1711 Number of Credits Total number of Marks Hours/Week hours Course Outcomes CO Upon completion of this course the students will be able to : PSO addressed CL CO-1 Understand the basic architecture of Computer PSO-1 U system CO-2 Understand the various Input, Output Devices PSO-1 U CO-3 Perform conversions among different number systems PSO-1 AP CO-4 CO-5 CO-6 Became familiar basic logic gates and understand Boolean algebra and simplify simple Boolean functions by using basic Boolean properties Design of sequential Circuits such as Flip-Flops, Registers, and Counters. Design of combinational circuits such as MUX, DEMUX, Encoder and Decoder etc. Teaching Plan Total contact hours: 60 (Including lectures, assignments and tests) PSO-3 PSO-3 PSO-3 AN,U C AP Unit Module Topics Hours I Computer Organization and Architecture Learning outcome Pedagogy 1. Central Processing Unit, Internal Communication 2. Machine Cycle, The Bus, Memory Representation 3. Random Access Memory, Read Only Memory, Storage System, Magnetic Storage System, Optical Storage System II Input and Output Devices 4 To analyze the parts of Central Processing Unit 3 To create the knowledge about Memory Representation 5 To understand the Memory storage 1. Key Board, Pointing Devices, Scanning Devices 4 To create the knowledge about various input devices through: short test

6 2. Optical Recognition Devices, Digital camera. Display Monitors 3. Impact Printers, Non Impact Printers, Plotters 5 To understand the Optical Recognition Devices 3 To distinguish the types of printers Multiple choice questions III Digital Systems and Binary Numbers 1. Digital Systems, Binary Numbers, Number Base conversion 2. Octal and Hexadecimal Numbers, Complements, Subtraction r s Complement,Subtraction (r-1) s Complement 3. Binary Codes, Registers, Integrated Circuits IV Boolean Algebra And Logic Gates 4 To analyze the Digital Systems 3 To create the knowledge about Octal and Hexadecimal Numbers and about Complements, 5 To understand the Integrated Circuits Quiz 1. Basic definition of Boolean algebra, Axiomatic definition of Boolean algebra 2. Basic Theorems and Properties of Boolean Algebra 3. Digital Logic Gates, Gate Level Minimization 4. NAND Implementation, NOR Implementation, XOR Function V Combinational Logic 1. Binary Adder, Subtractor, Binary Multiplier 2. Decoders, Encoders, Multiplexer 3 To analyze the Basic definition of Boolean algebra, Axiomatic definition of Boolean algebra 3 To analyze the Basic Theorems and Properties of Boolean Algebra 4 To understand the Digital Logic Gates, Gate Level Minimization 3 To analyze the NAND Implementation, NOR Implementation, XOR Function 4 To distinguish the Binary Adder, Subtractor, Binary 4 To understand the Decoders, Encoders, Multiplexer through: short test Multiple

7 3. D Flip-flop, JK Flip-flop, Master-Save Flip-flop 3 To analyze the D Flipflop, JK Flip-flop, Master-Save Flip-flop choice questions Course Instructor: J. Jackulin Reeja HOD: J. Anto Hepzie Bai Semester: I CorelDraw Subject code: SNM171 No. of hours per No. of credits Total no. of Total marks week hours Course Outcomes CO Upon completion of this course the students will be able to : CO-1 Create Professional for designing magazines, Company logo, Brochures, Book Cover, Visiting Card PSO addressed PSO-3 CO-2 Develop images of the highest Quality PSO-4 AN CO-3 Illustrate Sufficient knowledge aboutcorel Basic PSO-3 AP CO-4 Understand tools for creating, drawing, text manipulation and PSO-1 R output options for printing. CO-5 Importing, Exporting, Printing, Applying Effects used in order to manipulate Images. Teaching Plan PSO-1 Total contact hours: 60 (Including lectures, assignments and tests) CL AP C Unit Module Topics II I Corel draw Basics 1 Getting started CorelDraw, Creating a new file, The CorelDraw Screen and Property Bar 2 Drawing Basic Geometric Figures Drawing Polygons, Drawing and Selecting Hours Learning Outcome 3 To Understand the various components in CorelDraw Screen 3 To draw the basic geometric figures Pedagogy through: short test 1 Getting familiar the Toolbox, 3 To recall the tools in toolbox,

8 III Getting Started the Project, More about Lines 2 Working Objects Shapes, Using the Transformations Docker, Adding Effects to Objects Working Text To draw a house in CorelDraw 3 To apply various effects for images, Ask questions Ask to draw a house 1 The Text Tool, Getting Started the Book Cover 2 To be able to design a book cover To distinguish the difference between the artistic text and paragraph text Ask to design book cover IV Working Images V 1 Bitmap and Vector Images, Importing Images, Resizing, Rotating and Skewing Images 2 Cropping an Image, Importing Images from a CD, Converting to Bitmap Working Images 1 Adding Special effects to Bitmaps, Exporting Files to other Applications 2 Publishing to PDF, Backup and Recovering File Course Instructor: J. Anto Hepzie Bai 3 To import, resize, rotate and skew images and objects To distinguish the difference between bitmap and vector images 3 To crop and import images from CD to system 2 To apply special effects to images To save files in different formats 2 To take backup files HOD: J. Anto Hepzie Bai Ask to import images from CD Programming in Java Subject Code: SC1731 No. of Hours per Credit Total No. of Hours Marks Week

9 Course Outcomes and Teaching Plan CO Upon completion of this course the students will be able to : PSO addressed CO- 1 Define the Concept of OOP PSO-2 R CO- 2 Understand the Structure of the Java programming Language PSO-2 U CO- 3 Implement various Errors handling technique using Exception PSO-5 A Handling to solve complicated problem. CO -4 Understand the Applet program to display window based Activities. PSO-5 U CO- 5 Create PSO-5 C CL Unit Module Topics Hours Learning Outcome Pedagogy I II Data Types, Variables and Arrays, Operators and Control Statements 1 Object Oriented Programming &A first Simple program, Two Control Statements, Lexical Issues& Java Class Libraries, Java is a Strongly Typed Language &The Simple Styles, Integers &Floating point 2 Characters& Boolean, A Close Look at Literal &Variables, Arrays, Arithmetic Operators &The Bitwise Operator, Relational Operator &Boolean Logical 3 Operator, The Assignment Operator, The? Operator, Operator Precedence &Using Parenthesis, Java Selection Statements, Iteration Statements &Jump Statements 4 Define the Concept of OOP and Various Data types 5 Understand the Structure of the Java programming Language 3 To distinguish the difference types of operators Methods an Classes, Inheritance, Packages and Interfaces. 1 Class Fundamentals, Declaring Objects &Assigning Object, Reference Variables &Introducing Methods, Constructors &The this 3 To cite the example of java class,object and Methods, Group discussion,,, through short test Multiple choice question through short test Class test

10 III keyword, 2 Overloading Methods, Using 4 To understand Objects as Parameters& java method, Recursion, parameters and Inheritance Basics &Using Inheritance Super, Basic Creating a Multilevel Hierarchy & When Constructors are Called, Method Overriding &Dynamic Method Dispatch 3 Using Abstract Classes 4 Define java &Using Final Package Inheritance, Packages, Access Protection &Importing packages, Interface Exception Handling and Multithreaded Programming presentation Multiple choice question IV 1 Fundamentals &Exception Types, Uncaught Exceptions &Using Try and Catch Clauses Nested Try Statements &Throw, Throws-Finally Java s Built in Exceptions 2 Creating Your Own Exceptions Subclasses, The java Thread Model,The Main Thread & Creating Thread, Creating Multiple Threads &Using is alive ( ) and join(), Thread Priorities The Applet Class and Event Handling 4 Implement various Errors handling technique using Exception Handling 4 To distinguish the Java Thread Model presentation through short test Class test Multiple choice question 1 Applet Basics &Applet Architecture, An Applet Skeleton, Simple Applet Display Methods, The HTML APPLET Tag, Passing Parameter to Applets &Applet Context and Show Document 2 Two Event Handling Mechanisms & 5 To create the Applet program to display window based Activities. 5 To be able to evaluate the presentation, Group through short test, Class test, Multiple choice question,

11 V The delegation Event Model, Event Classes, Sources of Events, Event Listener interfaces, Using the Delegation Event Model Event handling Mechanisms. Introducing AWT,AWT Controls, Layout Managers and Menus 1 AWT Classes, Window Fundamentals, Working Frame Windows, Working Graphics 2 Working color, Control Fundamentals, Labels, Using Buttons 3 Applying Check Boxes &Checkbox Group, Choice Controls Using Lists, Using Text Field, Using a Text area 4 To able to Define AWT Classes 4 Understand the AWT window 4 Understand the Applet window based Activity discussion presentation through short test, Class test Multiple choice question Course Instructor: J.Lidia HOD: J. Anto Hepzie Bai Semester: III Name of the Course: Microprocessor and Assembly Language Programming Subject Code: SC1732 No. of Hours per Credit Total No. of Hours Marks Week Course Outcomes CO Upon completion of this course the students will be able to: PSO addressed CL CO-1 To understand basic architecture of 8 bit microprocessor PSO-1 R CO-2 CO-3 CO-4 Understand and realize the Interfacing of memory & various I/O devices 8085 microprocessor Understand and classify the instruction set of 8085 microprocessor and distinguish the use of different instructions and apply it in assembly language programming. Understand the difference between 8085 and advanced microprocessor. PSO-2 PSO-2 PSO-2 U AP U

12 Teaching Plan Total contact hours: 75(Including lectures, assignments and tests) Unit Module Topics Hours Learning outcome Pedagogy I Microcomputers, Microprocessors, and Assembly Language 1. A Microprocessor as a Programmable Device, Microprocessor as a CPU 2. Organization of a Microprocessor Based System, Working of Microprocessor 3. Microprocessor Architecture and Micro Computer Systems: Microprocessor Architecture and its Operations Microprocessor Architecture and Memory Interfacing: The 8085 MPU, Memory Interfacing. II Introduction to 8085 assembly language Programming 3 To understand the importance of micro processor 4 To know microprocessor based system 4 To know full architecture of microprocessor 6 To distinguish the MPU Quiz 1. The 8085 Programming Model, Instruction Classification 5 Discuss and draw the microprocessor format Multiple choice questions 2. Instruction Format: Instruction Word Size, Opcode Format, To Write, Assemble and Execute a Simple Program 5 To study about the programming structure and execute method in microprocessor 3. Programming Techniques Additional Instruction: Programming Techniques 4 To know all the major techniques in microprocessor With 4. Looping, Counting and Indexing, Arithmetic Operations Related to Memory, Logic Operations III Introduction to 8085 Instructions 4 To understand the arithmetic operations and all the logical operations With

13 1. Introduction to 8085 Instructions: Data Transfer (Copy) Operations, Arithmetic Operations, Logic Operations, Branch Operations 2. Writing Assembly Language Programs 3. Code Conversion, BCD Arithmetic and 16-bit Data Operations: BCD to Binary Conversions, Binary to BCD Conversion 6 To be able to know copy and transfer the data from one place to another 4 To understand the assembly language 6 To know the binary values and its conversion types IV Counters and Time Delays Stack and Sub routine 1. Counters and Time Delays. 3 To know the system timing and signal allocations 2. Stack and Sub routine: Stack -Sub Routine - Restart, Conditional Call and Return Instructions. 3. Interrupts: The 8085 Interrupt - RST Instructions - An Implementation of the 8085 Interrupt - Multiple Interrupts and Priorities. Specifications, Plug and Play BIOS, BIOS Error Messages V Case Study Architecture Architecture Architecture 2. A Comparative Study of Pentium I, II, III & IV- Intel Dual Core - Intel Core 2 Duo 3. Introduction to Microcontroller - Comparative Studies of Microprocessor and Microcontroller. Course Instructor: V. Abisha 3 To understand the push and pop operations instructions 4 To be able to identify the internal problem the help of interrupts 5 To know full architecture in micro processor unit 5 Discuss and get knowledge about the Intel memory 4 To know difference between micro controller and micro processor HOD: J. Anto Hepzie Bai Quiz

14 Semester: III Name of the Course: Data Structure and Algorithms Subject Code: SS1733 No. Of Hours Per Credit Total No. Of Hours Marks Week Course Outcomes CO Upon completion of this course the students will be able to : PSO addressed CO-1 Define basic static and dynamic data structures and relevant standard PSO-2,PSO- 5 R algorithm for them CO-2 Demonstrate advantages and disadvantages of specific algorithms and data PSO-2 U structures CO-3 Select basic data structures and algorithms for simple programs PSO-2 AP CO-4 Determine and demonstrate bugs in program, recognizes needed basic operations data structures PSO-2 CO-5 Formulate new solutions for programming problems. PSO-5 C CO-6 Analyze algorithms and data structures in terms of time and space PSO-2 AN complexity of basic operations Teaching Plan Total contact hours: 75(Including lectures, assignments and tests) CL E Unit Module Topics Hours Learning Outcome 1 Problem Solving 1 Introduction to 2 To understand Data Structures data structures 2 How to Write an 2 Able to write data algorithm structure II 3 Asymptotic Notation algorithms 1 To understand asymptotic notation 4 Arrays 2 To understand about arrays 5 Concept of Linked 1 To understand List about linkedlist 6 Circular and Doubly Linked List and its algorithm 2 To get idea about different link list types Stacks 1 Concept of Stack 2 To understand the concept of Pedagogy / Short Test, Quiz

15 stack 2 Linked Stack 2 To understand about Linked stack 3 Evaluaton of 1 To write postfix Postfix expression Expression 4 Recursion 1 To understand about the recursion 5 Queues 1 To understand about queues 6 Types of Queues 5 Getting knowledge about different types of Queues 111 Tree Structure 1 Introduction 1 To understand the tree structue 2 Binary Trees 2 To understand about Binay trees, its reprentation and traversal method 3 AVL Trees 4 To understand how AVL Tree is represented and how the search process is performed 4 Heaps 3 It deals about the heap and the operation performed in the heap structure. IV Graphs 1 Introduction 2 To understand graph structure 2 Representation of Graph 3 Application of Graph and its properties 3 To understand the representation of graph 2 It deals about the application and able to understand about spanning tree 4 Shortest Path 3 To understand about the shortest method method ppt method Quiz Quiz Quiz

16 V path algorithm and able to find the shortest path. 5 Topological Sort 1 To understand about the topological sort. Algorithm Design and analysis 1 Greedy Algorithms 1 To understand about rules Greedy algorithm 2 Knapsac Problem 2 To solve Knapsac problem 3 Huffman Code 2 To get knowledge about Huffman code 4 Divide and Conquer Method 3 To solve problems based on divide and conquer method 5 Backtracking 2 To understand the backtracking method Course Instructor: P.Jasmine Lizy Quiz HOD: J. Anto Hepzie Bai Semester: III Name of the Course : Numerical and Statistical Methods Subject code: SA1731 No. of Hours per Week Credit Total No. of Hours Marks Course Outcomes CO Upon completion of this course the students will be able to : PSO addressed CL CO-1 Solve an algebraic and Transcendental Equations using an PSO-4,PSO- 5 C appropriate numerical methods CO-2 Find an error analysis for a given numerical method PSO-3 R CO-3 Solve a simultaneous equation using an appropriate numerical PSO-4,PSO- 5 C CO-4 method Find inverse of a matrix using Back Substitution method PSO-4 R CO-5 Find a polynomial using interpolation methods PSO-4 R CO-6 Determine correlation and rank correlation coefficient between PSO-3,PSO- 5 E two variables CO-7 Find a regression equations using the given data PSO-4 R CO-8 Acquire problem solving techniques and Baye s Theorem to solve real world problems PSO-2, PSO-4, PSO- 5 AP

17 Teaching Plan Total contact hours: 75(Including lectures, assignments and tests) Unit I Mo Topics dule Hours Algebraic and Transcendental Equations Learning Outcome Pedagogy / II 1 Introduction 1 2 Errors in Numerical 1 Find an error analysis for Computation a given numerical method 3 Iteration Method- Theorem 4 Iteration Method- Problem Iteration Method- Problem Bisection Method- Problem Bisection Method- Problem 4-7 Simultaneous Equations 1 Introduction 1 2 Simultaneous Equations 3 Back Substitution Method- Theorem 4 Gauss Elimination Method- Problem Gauss Elimination Method- Problem 4,5 6 Gauss Jordan Elimination Method- Problem Gauss Jordan Elimination Method- Problem 4, 5 8 Calculation of Inverse of a Matrix- 1 Solve an algebraic and Transcendental Equations 2 Solve an algebraic and Transcendental Equations 2 Solve an algebraic and Transcendental Equations 2 Solve an algebraic and Transcendental Equations 2 Solve an algebraic and Transcendental Equations 1 Solve a simultaneous equation 1 Solve a simultaneous equation 2 Solve a simultaneous equation 1 Solve a simultaneous equation 2 Solve a simultaneous equation 1 Solve a simultaneous equation 2 Find inverse of a matrix on iteration method test1 on Gauss Elimination method test1

18 Problem 1-3 test2 9 Calculation of Inverse of a Matrix- Problem 4, 5 1 Find inverse of a matrix III IV Interpolation 1 Introduction 1 2 Newton s forward Interpolation formulae- Theorem 3 Newton s forward Interpolation formulae- Problem 1, 2 4 Newton s forward Interpolation formulae- Problem 3,4 5 Newton s backward Interpolation formulae- Theorem 6 Newton s backward Interpolation formulae- Problem Find a polynomial 2 Find a polynomial 1 Find a polynomial 1 Find a polynomial 2 Find a polynomial 7 Lagrange s Interpolation formulae- Theorem 1 Find a polynomial 8 Lagrange s Interpolation formulae- Problem Find a polynomial 9 Lagrange s Interpolation formulae- Problem 4,5 1 Find a polynomial 10 Divided differences 1 Find a polynomial 11 Newton s divided differences- Theorem 1 Find a polynomial 12 Newton s divided differences- Problem Find a polynomial 13 Newton s divided differences- Problem 4,5 1 Find a polynomial Correlation and Regression 1 Introduction 1 2 Correlation 2 Determine correlation Theorem coefficient between two 3 Correlation Problem 1,2 4 Correlation Problem Correlation Problem 6,7 variables 2 Determine correlation coefficient between two variables 2 Determine correlation coefficient between two variables 1 Determine correlation coefficient between two variables test2 on Newton s forward & backward interpolation on Newton s divided differences test2

19 V 6 Rank Correlation- Theorem 7 Rank Correlation- Problem Rank Correlation- Problem 4,5 9 Regression- Theorem Regression- Theorem Regression- Problem Regression- Problem 4-7 Probability 1 Determine rank correlation coefficient between two variables 2 Determine rank correlation coefficient between two variables 1 Determine rank correlation coefficient between two variables 2 Find a regression equations using the given data 1 Find a regression equations using the given data 2 Find a regression equations using the given data 2 Find a regression equations using the given data 1 Introduction 1 2 Definition and 2 Acquire problem Examples solving techniques 3 Conditional 1 Acquire problem Probability solving techniques 4 Properties of 2 Acquire problem Independent Events solving techniques 5 Baye s Theorem 1 Use Baye s Theorem to solve real world problems 6 Problem using 2 Baye s Theorem to Baye s Theorem 1-3 solve real world 7 Problem using Baye s Theorem 4,5 8 Real life Problems Real life Problems Real life Problems 9-12 problems 1 Baye s Theorem to solve real world problems 2 Solve real life problems 2 Solve real life problems 2 Solve real life problems on correlation test3 on Baye s Theorem test3 Course Instructor: D. Berla Jeyanthi HOD: J. Anto Hepzie Bai