Calicut University Syllabus IT: Difference between revisions
| (One intermediate revision by the same user not shown) | |||
| Line 1: | Line 1: | ||
IT: INFORMATION TECHNOLOGY | IT: INFORMATION TECHNOLOGY | ||
The syllabus | The syllabus at University of Calicut. | ||
= COMBINED FIRST AND SECOND SEMESTER = | = COMBINED FIRST AND SECOND SEMESTER = | ||
| Line 1,545: | Line 1,545: | ||
Lab -1 : (object-oriented programming in - Java /C+ +) - Programs to bring out concepts of classes and objects - for example the abstract data type binary tree | Lab -1 : (object-oriented programming in - Java /C+ +) - Programs to bring out concepts of classes and objects - for example the abstract data type binary tree | ||
Lab - 2 : (object oriented programming) Programs to demonstrate inheritance and class hierarchy - for example define a base class “shape” and derived classes for rectangle, square, ellipse, circle with proper class hierarchy | Lab - 2 : (object oriented programming) Programs to demonstrate inheritance and class hierarchy - for example define a base class “shape” and derived classes for rectangle, square, ellipse, circle with proper class hierarchy | ||
Lab - 3 : (object oriented programming) - Programs to demonstrate polymorphism, virtual functions - for example define base class for vectors and use inheritance to define complex and real vector with standard operations | Lab - 3 : (object oriented programming) - Programs to demonstrate polymorphism, virtual functions - for example define base class for vectors and use inheritance to define complex and real vector with standard operations | ||
Lab - 4 : (functional programming - in Lisp / scheme / Haskell) - Program to demonstrate functional specification for a solution - for example implementation of quick sort | Lab - 4 : (functional programming - in Lisp / scheme / Haskell) - Program to demonstrate functional specification for a solution - for example implementation of quick sort | ||
Lab - 5 : (functional programming) - Program to demonstrate implementation of conventional data structures - for example implementation of binary search tree with insertion, deletion, and search operations | Lab - 5 : (functional programming) - Program to demonstrate implementation of conventional data structures - for example implementation of binary search tree with insertion, deletion, and search operations | ||
Lab -6 : (functional programming) - Program to demonstrate use of available data structures in functional programming languages - for example implementation of set with membership, union, and intersection operations | Lab -6 : (functional programming) - Program to demonstrate use of available data structures in functional programming languages - for example implementation of set with membership, union, and intersection operations | ||
Lab - 7 : (logic programming - in prolog / VisiCalc) - Program to demonstrate ready implementation of propositional logic statements - for example implementation of logic program to find the gcd of two given integers | Lab - 7 : (logic programming - in prolog / VisiCalc) - Program to demonstrate ready implementation of propositional logic statements - for example implementation of logic program to find the gcd of two given integers | ||
Lab - 8 : (logic programming) - Program to demonstrate language specific features - for example implement a logic program to check whether a given NFA accepts the given string | Lab - 8 : (logic programming) - Program to demonstrate language specific features - for example implement a logic program to check whether a given NFA accepts the given string | ||
Lab - 9 : (concurrent programming - Java / Ada) Demonstration of concurrency support - for example program to find the least common ancestor of two given nodes in a binary tree may be implemented. | Lab - 9 : (concurrent programming - Java / Ada) Demonstration of concurrency support - for example program to find the least common ancestor of two given nodes in a binary tree may be implemented. | ||
Lab - 10 : (concurrent programming) - Demonstration of synchronized concurrency - for example program for the readers and writers problem may be implemented. | Lab - 10 : (concurrent programming) - Demonstration of synchronized concurrency - for example program for the readers and writers problem may be implemented. | ||
| Line 1,566: | Line 1,575: | ||
Regularity = 5 | Regularity = 5 | ||
Total marks = 50 | Total marks = 50 | ||
== IT04 508(P) : HARDWARE LAB == | == IT04 508(P) : HARDWARE LAB == | ||
3 hours practical per week | 3 hours practical per week | ||