IT Engineering Syllabus Calicut University

I want to take admission in B.TECH Information Technology course offered at Calicut University . Will you please provide the syllabus for an idea ?

[Quick Sam]

As you are looking for the Calicut University B.TECH Information Technology course syllabus, here I am providing same for you.

Semester-III
Engineering Mathematics III
Computer Programming in C
Computer Organization & Design
Discrete Computational Structures
Electronic Circuits
Switching Theory & Logic Design
ProgrammingLab
DigitalElectronics Lab

Semester-IV
Engineering Mathematics IV
Environmental Science
Data Structures and Algorithms
Object Oriented Programming in Java
Systems Programming
Digital Data Communication
DataStructuresLab
ProgrammingEnvironments Lab

Semester-V
Industrial Economics and
Principles of Management
Software Engineering
Operating Systems
Database Management Systems
Introduction to
Microprocessor Systems
Theory of Computation
DatabaseManagement SystemsLab

Semester-VI
Digital Signal Processing
Computer Graphics & Multimedia
Compiler Design
Computer Networks
Human Computer Interaction
Object Oriented Modeling and Design
SystemsLab
MiniProject

Calicut University B.TECH Information Technology course syllabus
EN14 301: ENGINEERING MATHEMATICS III
(Common for all branches)
Objective
•To provide a quick overview of the concepts and results in complex analysis that may be useful in engineering.
•To introduce the concepts of linear algebra and Fourier transform which are wealths of ideas and results with wide area of application.
Module I: Functions of a Complex Variable (13 hours)
Functions of a Complex Variable – Limit – Continuity – Derivative of a Complex
function – Analytic functions – Cauchy-Riemann Equations – Laplace equation –
Harmonic Functions – Conformal Mapping – Examples: eZ, sinz, coshz, (z+1/Z )–
Mobius Transformation.
Module II: Functions of a Complex Variable (14 hours)
Definition of Line integral in the complex plane – Cauchy’s integral theorem (Proof
of existence of indefinite integral to be omitted) – Independence of path – Cauchy’s
integral formula – Derivatives of analytic functions (Proof not required) – Taylor
series (No proof) – Laurent series (No proof) – Singularities – Zeros – Poles –
Residues – Evaluation of residues – Cauchy’s residue theorem – Evaluation of real
definite integrals.
Module III: Linear Algebra (13 hours) – (Proofs not required)
Teaching scheme Credits: 4
3 hours lecture and 1 hour tutorial per week
Vector spaces – Definition, Examples – Subspaces – Linear Span – Linear
Independence – Linear Dependence – Basis – Dimension– Orthogonal and
Orthonormal Sets – Orthogonal Basis – Orthonormal Basis – Gram-Schmidt
orthogonalisation process – Inner product spaces – Definition – Examples –
Inequalities ; Schwartz, Triangle (No proof).
Module IV: Fourier Transforms (14 hours)
Fourier Integral theorem (Proof not required) – Fourier Sine and Cosine integral
representations – Fourier transforms – transforms of some elementary functions –
Elementary properties of Fourier transforms – Convolution theorem (No proof) –
Fourier Sine and Cosine transforms – transforms of some elementary functions –
Properties of Fourier Sine and Cosine transforms.
Text Books
Module I:
Erwin Kreysig, Advanced Engineering Mathematics, 8e, John Wiley and
Sons, Inc.
Sections: 12.3, 12.4, 12.5, 12.6, 12.7, 12.9
Module II:
Erwin Kreysig, Advanced Engineering Mathematics, 8e, John Wiley and
Sons, Inc.
Sections: 13.1, 13.2, 13.3, 13.4, 14.4, 15.1, 15.2, 15.3, 15.4
Module III:
Bernaed Kolman, David R Hill, Introductory Linear Algebra, An Applied First
Course, Pearson Education.
Sections: 6.1, 6.2, 6.3, 6.4, 6.8, Appendix.B.1
Module IV:
Wylie C.R and L.C. Barrett, Advanced Engineering Mathematics, McGraw
Hill.
Sections: 9.1, 9.3, 9.5
Reference books
1. H S Kasana, Complex Variables, Theory and Applications, 2e, Prentice
Hall of India.
2. John M Howie, Complex Analysis, Springer International Edition.
3. Anuradha Gupta, Complex Analysis, Ane Books India.
4. Shahnaz bathul, Text book of Engineering Mathematics, Special
functions and Complex Variables, Prentice Hall of India.
5. Gerald Dennis Mahan, Applied mathematics, Springer International
Edition.
6. David Towers, Guide to Linear Algebra, MacMillan Mathematical
Guides.
7. Inder K Rana, An Introduction to Linear Algebra, Ane Books India.
8. Surjeet Singh, Linear Algebra, Vikas Publishing House.
9. Howard Anton, Chris Rorres, Elementary Linear Algebra, Applications
Version, John Wiley and Sons.
10. Anthony Croft, Robert Davison, Martin Hargreaves, Engineering
Mathematics, Pearson Education.
Internal Continuous Assessment (Maximum Marks-50)
60% - Tests (minimum 2)
30% - Assignments (minimum 2) such as home work, problem solving,
group discussions, quiz, literature survey, seminar, term-project, software
exercises, etc.
10% - Attendance and Regularity in the class
University Examination Pattern
PART A: Analytical/problem solving SHORT questions 8x 5 marks=40 marks
Candidates have to answer EIGHT questions
out of TEN. There shall be minimum of TWO
and maximum of THREE questions from
each module with total TEN questions.
PART B: Analytical/Problem solving DESCRIPTIVE
questions
4 x 15 marks=60 marks
Two questions from each module with
choice to answer one question.
Maximum Total Marks: 100
Teaching scheme Credits: 4
2 hours lectures and 2 hours lab per week
Objectives
•To impart the basic concepts of computer and information technology
•To develop skill in problem solving concepts through learning C
programming in practical approach.
Module I (8 hours)
Introduction to Computers: CPU, Memory, input-output devices, secondary
storage devices, Processor Concepts – Evolution and comparative study of
processors. Machine language, assembly language, and high level language.
Inside a PC, Latest trends and technologies of storage, memory, processor,
printing etc. Concept of Program and data, System software – BIOS, Operating
System- Definition-Functions-Windows, and Linux. Compilers and assemblers,
Computer networks, LAN, WiFi.
Module II (9 hours)
Basic elements of C: Flow chart and algorithm – Development of algorithms for
simple problems. Structure of C program – Operators and expressions – Procedure
and order of evaluation – Input and Output functions. While, do-while and for
statements, if, if-else, switch, break, continue, goto, and labels. Programming
examples.
Module III (10 hours)
Functions and Program structures: Functions – declaring, defining, and accessing
functions – parameter passing methods – Recursion – Storage classes – extern,
auto, register and static. Library functions. Header files – C pre-processor. Example
programs. Arrays: Defining and processing arrays – passing arrays to functions –
two dimensional and multidimensional arrays – application of arrays. Example
programs.
Module IV (9 hours)
Structures – declaration, definition and initialization of structures, unions,
Pointers: Concepts, declaration, initialization of pointer variables simple examples
Concept of a file – File operations File pointer.
Text Books
1. P. Norton, Peter Norton’s Introduction to Computers, Tata McGraw Hill,
New Delhi.
2. E. Balaguruswamy, Programming in ANSI C, 3rd ed., Tata McGraw Hill, New
Delhi, 2004
Reference Books
B. Gottfried, Programming with C, 2nd ed, Tata McGraw Hill, New Delhi,
2006
B. W. Kernighan, and D. M. Ritchie, The C Programming Language,
Prentice Hall of India, New Delhi, 1988
K. N. King. C Programming: A Modern Approach, 2nd ed., W. W. Norton &
Company, 2008
P. Norton, Peter Norton’s Computing Fundamentals, 6th ed., Tata McGraw
Hill, New Delhi, 2004.
S. Kochan, Programming in C, CBS publishers & distributors
M. Meyer, R. Baber, B. Pfaffenberger, Computers in Your Future, 3rd ed.,
Pearson Education India
10
Internal Continuous Assessment (Maximum Marks-50)
50% - Lab Practical Tests
20% - Assignments
20% - Main Record
10% - Regularity in the class
University Examination Pattern
PART A: Analytical/problem solving SHORT questions 8x 5 marks=40 marks
Candidates have to answer EIGHT questions
out of TEN. There shall be minimum of TWO
and maximum of THREE questions from
each module with total TEN questions.
PART B: Analytical/Problem solving DESCRIPTIVE
questions
4 x 15 marks=60 marks
Two questions from each module with
choice to answer one question.
Maximum Total Marks: 100
Syllabus - B.Tech. Information Technology
Objectives
•To lay the foundation for the study of hardware organization of digital
computers. It brings out the interplay between various building blocks of
computers, without being specific to any particular computer. At the end of the
course, the student is expected to gain a fair idea about the functional aspects of
each building block in computer design, in the general sense.
Module I (14 hours)
Basic Structure of computers – functional units – Historical Perspective –Basic
operational concepts – bus structures, Measuring performance: evaluating,
comparing and summarizing performance. Memory locations and addresses –
memory operations – instructions and instruction sequencing ,Instruction sets- RISC
and CISC paradigms, Addressing modes
Module II (12 hours)
Computer arithmetic – Signed and unsigned numbers – Addition and subtraction –
Logical operations – Constructing an ALU – Multiplication and division – faster
versions of multiplication- floating point representation and arithmetic
Module III (12 hours)
The processor: Building a data path – Simple and multi-cycle implementations –
Microprogramming – Exceptions, Introduction to pipelining-pipeline Hazards
Module IV (14 hours)
Memory hierarchy – Caches – Cache performance – Virtual memory – Common
framework for memory hierarchies Input/output – I/O performance measures – I/O
techniques – interrupts, polling, DMA; Synchronous vs. Asynchronous I/O;
Controllers.Types and characteristics of I/O devices – Buses – Interfaces in I/O
devices – Design of an I/O system
Teaching scheme Credits: 4
3 hours lecture and 1 hour tutorial per week
Text Books
1. W. Stallings, Computer Organization and Architecture: Designing for Performance, 8th Ed.,
Pearson Education India. 2010.
2. D. A. Patterson and J. L. Hennessy, Computer Organization and Design, 4th Ed., Morgan
Kaufmann, 2008.
Reference Books
1. Heuring V.P. & Jordan H.F., Computer System Design & Architecture, Addison Wesley
2. Hamacher, Vranesic & Zaky, Computer Organisation, McGraw Hill
12
University Examination Pattern
PART A: Analytical/problem solving SHORT questions 8x 5 marks=40 marks
Candidates have to answer EIGHT questions
out of TEN. There shall be minimum of TWO
and maximum of THREE questions from
each module with total TEN questions.
PART B: Analytical/Problem solving DESCRIPTIVE
questions
4 x 15 marks=60 marks
Two questions from each module with
choice to answer one question.
Maximum Total Marks: 100
Syllabus - B.Tech. Information Technology
Internal Continuous Assessment (Maximum Marks-50)
60% - Tests (minimum 2)
30% - Assignments (minimum 2) such as home work, problem solving, group discussions, quiz,
literature survey, seminar, term-project, software exercises, etc.
10% - Regularity in the class
Structures
(Common with CS14 304)
Teaching scheme
Credits: 4
(3 hours lecture and 1 hour tutorial per week)
Objectives
•To provide the mathematical foundations required in any stream of study in
Computing.
•To provide a sound understanding of the various algorithms and methods
•To get familiar with the essential proof techniques, logic and useful
mathematical objects.
Module I (13 hours)
Logic – Logical connectives and Truth tables – Logical equivalence and laws of logic
– Logical implication and rules of inference- Quantifiers – Proofs of theorems using
rules of universal specification and universal generalization.
Module II (13 hours)
Relational Structures – Cartesian products – Relations – Relation matrices –
Properties of relations – Composition of relations – Equivalence relations and
partitions – Functions – One-to-one, onto functions – Composition of functions and
inverse functions – Partial orders – Hasse diagrams.
Module III (13 hours)
Group Theory – Definition and elementary properties – Cyclic groups –
Homomorphisms and Isomorphisms – Subgroups – Cosets and Lagrange’s theorem
– Elements of coding theory- Hamming metric – Generator matrices – Group codes
– Hamming matrices.
Module IV (13 hours)
Recurrence Relations – Introduction, Linear recurrence relations with constant
coefficients – Homogeneous solutions – Particular solutions – Total solutions
Generating Function – solutions of recurrence relations by the method of
generating functions.
Text Books
1. Ralph P Grimaldi, Discrete and Combinatorial Mathematics: An applied introduction
(Fourth Edition), Pearson Education
References
1. Truss J K, Discrete Mathematics for Computer Scientists, Pearson Education.
2. Donald F Stanat & David F McAllister, Discrete and Mathematical Structures in Computer
Science, Prentice Hall.
3. Thomas Koshy, Discrete Mathematics with Applications, Academic Press/Elsevier,
4. Kolman B & Busby R C, Discrete and Mathematical Structures for Computer Science,
Prentice Hall of India. 2005
5. C.L. Liu, Elements of Discrete Mathematics, Tata McGraw Hill, 2002
15
University Examination Pattern
PART A: Analytical/problem solving SHORT questions 8x 5 marks=40 marks
Candidates have to answer EIGHT questions
out of TEN. There shall be minimum of TWO
and maximum of THREE questions from
each module with total TEN questions.
PART B: Analytical/Problem solving DESCRIPTIVE
questions
4 x 15 marks=60 marks
Two questions from each module with
choice to answer one question.
Maximum Total Marks: 100
For detailed syllabus , here is the attachment;