Click here to load reader
Click here to load reader
Nov 03, 2014
Faculty of Engineering and Technology
JECRC UniversityFaculty of Engineering and Technology Degree Programs and Their Course Structure
Course Structure For III to VIIIComputer Science and Engineering (B.Tech.)
JECRC University Faculty of Engineering and Technology B.Tech. (Computer Science and Engineering) 2nd Year Teaching Scheme Semester -III Code CS300 1 CS300 2 CS300 3 CS300 4 CS300 5 CS300 6 CS300 7 CS300 8 CS300 9 CS301 0 Subject Discrete Mathematical Structure Data structures and Algorithms Database Management System Software Engineering Digital Electronics Engineering Economics DBMS Lab Data structure and Algorithm Lab Digital Electronics Lab Unix LabTOTAL
Contact Hours L-T-P3-1-0 3-1-0 4-0-0 3-0-0 3-1-0 3-0-0 0-0-2 0-0-2 0-0-2 0-0-2 19-3-8
Credits4 4 4 3 4 3 1 1 1 1 26
Semester -IV Code CS400 1 CS400 2 CS400 3 CS400 4 CS400 5 CS400 6 CS400 Subject Statistics and probability Theory Computer Architecture Operating System Object Oriented Programming Computer Graphics Soft Skill Grammar OOPS Lab Contact Hours Credits L-T-P 3-1-0 3-1-0 3-1-0 3-1-0 3-0-0 3-0-0 0-0-2 4 4 4 4 3 3 1
7 CS400 Operating System Lab 8 CS400 Computer Graphics Lab 9 TOTAL
0-0-2 0-0-2 18-4-6
1 1 25
JECRC University Faculty of Engineering and Technology B.Tech. (Computer Science and Engineering) 3rd Year Teaching Scheme Semester -V Code CS500 1 CS500 2 CS500 3 CS500 4 CS500 5 CS500 6 CS500 7 CS500 8 CS500 9 CS501 0 Subject Introduction to Data Communication Design Analysis and Algorithms Java Programming Language Theory of Computation Organizational Behavior and Management Practices Soft Skills Vocabulary and Usage DAA Lab JAVA Lab Network Lab II Web Development Lab TOTAL Semester -VI Code CS6001 CS6002 CS6003 CS6004 CS6005 CS6006 CS6007 CS6008 CS6009 CS6010 Subject Compiler Construction Artificial Intelligence Computer Networks Microcontroller and Microprocessor Software Project Management Technical Writings Aptitude/Reasoning Network Programming Lab Microcontroller and Microprocessor Lab Compiler Designing Lab TOTAL Contact Hours Credits L-T-P 3-1-0 4 4-0-0 4 4-0-0 4 4-0-0 4 3-0-0 3 3-1-0 4 3-0-0 3 0-0-2 1 0-0-2 1 0-0-2 1 24-2-6 29 Contact Hours Credits L-T-P 3-1-0 3-1-0 3-0-0 3-1-0 3-0-0 2-1-0 0-0-2 0-0-2 0-0-2 0-0-2 17-4-8 4 4 3 4 3 3 1 1 1 1 25
JECRC University Faculty of Engineering and Technology B.Tech. (Computer Science and Engineering) 4th Year Teaching Scheme Semester-VII Code CS7001 CS7002 CS7003 CS7101 CS7104 CS7105 CS7108 CS7109 CS7004 CS7005 CS7006 CS7007 Subject Information System Security Real Time System Data Mining and Warehousing Elective-I Elective II 3-0-0 Practical Training Seminar Data Mining and Warehousing Lab Minor Project Seminar Training Seminar TOTAL 0-0-2 0-0-2 0-0-4 0-0-4 0-0-0 17-0-12 3 1 1 2 2 3 26 Contact Hours Credits L-T-P 4-0-0 4 4-0-0 4 3-0-0 3 3-0-0 3
Semester VIII Code Subject Contact Hours Credits L-T-P 0-0-0 0-0-0 20 20
CS8001 Major Project TOTAL
JECRC University Faculty of Engineering and Technology B.Tech. (Computer Science and Engineering) Proposed ELECTIVE Theory Subjects:Code CS7101 CS7102 Elective I Parallel Computing Simulation and Modeling Code CS7105 CS7106 Elective II Mobile Computing Multimedia Technology
Bio-informatics Human Computer Interaction
Natural Language Processing Neural Networks
Faculty of Engineering and Technology
B.Tech. in Computer Science and Engineering Semester III Contact Hours (L-T-P) : 3-1-0 CS3001- Discrete Mathematics: Course Outlines UNIT-1Sets: Definition and types, Set operations, Partition of set, Cardinality (Inclusion- Exclusion and Addition Principles), Recursive definition of set. Functions: Concept, Some Special Functions (Polynomial, Exponential and Logarithmic, Abslute Value, Floor and Ceiling, Mod and Div Functions), Properties of Functions, Cardinality of Infinite Set, Countable and Uncountable Sets,
UNIT-2Graph Theory: Graphs Directed, Undirected, Simple,. Adjacency and Incidence, Degre of Vertex, Subgraph, Complete graph, Cycle and Wheel Graph, Bipartite and Complete Bipartite Graph, Weighed Graph, Union of Simple Graphs. Complete Graphs. Isomorphic Graphs, Path, Cycles and Circuits Euclerian and Hamiltonian Graphs.Planar Graph: Kuratowskis Two Graphs, Eulers Formula, Kuratowskis Theorem. Trees: Spanning trees- Kruskals Algo, Finding Spanning Tree using Depth First Search, Breadth First Search, Complexity of Graph, Minimal Spanning Tree.
UNIT-3Semgroups, Groups and Coding: Binary Operations, Semigroups, Products and Quotients of Semigroups, Groups, Product and Quotients of Groups, Coding of Binary Information and Error Correction, Decoding and Error Correction. Language of Logic: Proposition, Compound Proposition, Conjunction, Disjunction, Implication, Converse, Inverse and Contrpositive, Biconditional Statements, tautology, Contradiction and Contingency, Logical Equivalences, Quantifiers, Arguments.
UNIT-4Proof Methods: Vacuous, Trivial, Direct, Indirect by Contrapositive and Contradiction, Constructive and Non-constructive proof, Counterexample. The Division Algorithm, Divisibilty Properties (Prime Numbers and Composite Numbers), Principle of Mathematical Induction, The Second Principle of Mathematical Induction, Fundamental Theorem of Arithmetic. Algorithm Correctness: Partial Correctness, Loop Invariant. Testing the partial correctness of linear and binary search, bubble and selection sorting.
UNIT-5Relations: Boolean Matrices, Binary Relation, Adjacency Matrix of Relation, Properties of Relations, Operations on Relations, The Connectivity Relations, Transitive Closure-Warshalls Algorithm, Equivalence relations- Congruence Relations, Equivalence Class, Number of Partitions of a Finite Set, Partial and Total Orderings.Suggested Books 1. 2. B.Kolman et.al- Discrete mathematical Structures, 5th Edn, Pearson Education, New Delhi - 2004. K.H. Rosen Discrete Mathematics and Its Applications 4th Edn, Tata McGraw Hill, New Delhi 2001 3. J.P. Tremblay et.al Discrete Mathematical Structures with Applications to Computer Science, TMH, New Delhi 2004. 4. Mott. J.L., Kandel A. and Baker, T.P. "Discrete mathematics for computer scientists and Mathematicians", Second Edition, Prentice Hall 1986.
Faculty of Engineering and Technology B.Tech. in Computer Science and Engineering Semester III Contact Hours (L-T-P) : 3-1-0 CS3002- Data Structures and Algorithms - Course Outlines UNIT-1 Introduction: Data structure, abstract data types. Linear Data Structures: Arrays, linked lists, stacks, queues, postfix, infix, prefix expressions and their conversion, evaluation of postfix expression, recursion, Tower of Hanoi problem, hashing and symbol tables, Huffman algorithm. UNIT-2 Non-Linear Data Structures: Trees and their traversals, binary trees, binary search trees, heaps, AVL trees, graph and their traversal. UNIT-3 Sorting and Searching: Sorting - insertion, selection, bubble, quick, heap, merge, shell, counting, bucket and radix sort, searching sequential and binary. UNIT-4 Analysis of Algorithms: Time and space complexity of algorithms, Big oh, Theta and Omega notations, performance analysis, best, worst, average case analysis of simple algorithms, performance measurement. Suggested Books1.
DSA by Herbert Schildt, Tata McGraw Hills,3rd Edition
Faculty of Engineering and Technology B.Tech. in Computer Science and Engineering Semester III Contact Hours (L-T-P) : 3-0-0 CS3003-Database Management Systems: Course Outlines UNIT-1Overview of DBMS: File system versus DBMS, advantages of DBMS, database users, data abstraction, data independence, and database system structure. Data Models: Relational model, hierarchal model and network model. Entity Relationship Model - overview of data design, entities, attributes and entity sets, relationship and relationship sets, features of the ER model key constraints, participation constraints, weak entities, class hierarchies, aggregation, conceptual data base design with ER model entity versus attribute, entity versus relationship, binary versus ternary relationship and aggregation versus ternary relationship.
UNIT-2Relational Algebra and Calculus: Relational algebra selection, projection, set operations, renaming, joins, division, relational calculus, expressive power of algebra and calculus. SQL Queries, Programming and Triggers: The forms of a basic SQL query, union, intersect and except, nested queries, correlated nested queries, set comparison operations, aggregate operators, null values and embedded SQL.
UNIT-3Schema Refinement and Normal Forms: Introduction to schema refinement, functional dependencies, normalization- decomposition, 1NF, 2NF, 3NF, BCNF, multi valued functional dependencies, 4NF. File Organization: Secondary storage devices, RAID, buffer management, heap files, sorted files, hashing static and dynamic, indexing- single level, multi level, static and dynamic, B-tree, B+-tree, ISAM.
UNIT-4Transaction Management: Transaction-concepts, states, ACID property, schedule, serializability of schedules, concurrency control techniques - locking, timestamp, deadlock handling, recovery-log based recovery, shadow paging. Concurrency Control: Implementation of Concurrency: Lock-based protocols, Timestamp-based protocols, Validation-based protocols, Deadlock handling,
UNIT-5Database Failure and Recovery: Database Failures, Recovery Schemes: Shadow Paging and Log-based Recovery, Recovery with Concurrent transactions.Suggested Books1. H.f. Korth and Silberschatz: Database Systems Concepts, McGraw Hill 2. Almasri and S.B. Navathe: Fundamentals of Database Systems, 3. Ramakrishnan and Gehrke: Database Management System, McGraw Hill 4. C.J. Date: Data Base Design, Addison Wesley 5. Hansen and Hansen : DBM