be syllabus chandigarh university

Scheme & Syllabus of BE CSE 2012 Batch & BE LEET CSE 2013 Batch

Department of Computer Science & Engineering, UIE, Chandigarh University, Gharuan

SCHEME (2012-2016) B.E. CSE SCHEME (2013-2016) B.E. LEET CSE

3RD SEMESTER

S.NO SUBJECT CODE

SUBJECT NAME Hours Per Week

Marks Credits

L T P INT EXT Total

1 CST-201 ANALOG AND DIGITAL ELECTRONICS 3 1 - 40 60 100 3.5

2 CST-202

COMPUTER ORGANIZATION & ARCHITECTURE

3 0 - 40 60 100 3

3 CST-203 DATA STRUCTURES 3 - - 40 60 100 3

4 CST-204 DISCRETE MATHEMATICS 3 1 - 40 60 100 3.5

5 CST-205 OBJECT ORIENTED PROGRAMMING 3 - - 40 60 100 3

6 CSP-206

ANALOG AND DIGITAL ELECTRONICS LAB

- - 2 60 40 100 1

7 CSP-207 DATA STRUCTURES LAB - - 4 60 40 100 2

8 CSP-208 OBJECT ORIENTED PROGRAMMING LAB - - 4 60 40 100 2

9 CSP-209 SEMINAR - - 2 100 - 100 1

10 HUP-201

PROFESSIONAL COMMUNICATION SKILLS LAB

- - 2 60 40 100 1

11 CSP-210 INSTITUTIONAL PRACTICAL TRAINING - - 4 60 40 100 4

TOTAL 15 2 18 600 500 1100 27



4TH SEMESTER

S.NO SUBJECT CODE


Marks Credits

L T P INT EXT Total

1 CST-221 NUMERICAL & STATISTICAL TECHNIQUES 3 1 - 40 60 100 3.5

2 CST-222 MICRO PROCESSORS & INTERFACING 3 1 - 40 60 100 3.5

3 CST-223

DIGITAL COMMUNICATION & COMPUTER NETWORK

3 - - 40 60 100 3

4 CST-224 OPERATING SYSTEM 3 - - 40 60 100 3

5 CST-225 WEB TECHNOLOGIES 3 - - 40 60 100 3

6 CSP-226

MICRO PROCESSORS & INTERFACING LAB

- - 2 60 40 100 1

7 CSP-227 NETWORK & OPERATING SYSTEM LAB - - 4 60 40 100 2

8 CSP-228 WEB TECHNOLOGIES LAB - - 4 60 40 100 2

9 CSP-229 SEMINAR - - 2 100 - 100 1

10 HUP- 221 PROGRAMMING APPTITUDE - - 2 - - - 1

TOTAL 15 2 14 480 420 900 23

Note: Students will undergo 6 weeks vocational training after 4th semester. Students are required to

submit one minor project.



5TH SEMESTER

S.NO SUBJECT CODE


Marks Credits

L T P INT EXT Total

1 CST-301 DESIGN AND ANALYSIS OF ALGORITHMS 3 1 - 40 60 100 3.5

2 CST-302 SOFTWARE ENGINEERING 3 1 - 40 60 100 3.5

3 CST-303 SIMULATION AND MODELING 3 - - 40 60 100 3

4 CST-304

RELATIONAL DATABASE MANAGEMENT SYSTEMS

3 1 - 40 60 100 3.5

5 CST-305 WIRELESS NETWORKS 3 - - 40 60 100 3

6 CSP-306 SIMULATION AND MODELING LAB - - 2 60 40 100 1

7 CSP-307 SOFTWARE ENGINEERING LAB - - 4 60 40 100 2

8 CSP-308

RELATIONAL DATABASE MANAGEMENT SYSTEMS LAB

- - 4 60 40 100 2

9 CSP-309 INDUSTRIAL TRAINING I - - 4 60 40 100 4 10 CSP-310 SEMINAR - - 2 100 - 100 1

11 HUP- 301 SOFT SKILLS - - 2 40 60 100 1

TOTAL 15 3 16 580 520 1100 27.5



6TH SEMESTER

S.NO

SUBJECT CODE


Marks Credits

L T P INT EXT Total

1 CST-321 THEORY OF COMPUTATION 3 1 - 40 60 100 3.5

2 CST-322 SOFTWARE PROJECT MANAGEMENT 3 - - 40 60 100 3

3 CST-323 COMPUTER GRAPHICS 3 1 - 40 60 100 3.5

4 HUT-324 ENGINEERING ECONOMICS & PRINCIPLES OF MANAGEMENT

3 - - 40 60 100 3

5 ELECTIVE I 3 1 - 40 60 100 3.5

6 CSP-325 COMPUTER GRAPHICS LAB - - 4 60 40 100 2

7 CSP-326 SOFTWARE PROJECT MANAGEMENT LAB - - 2 60 40 100 1

8 ELECTIVE- I LAB - - 2 60 40 100 1

9 CSP-327 SEMINAR - - 2 100 - 100 1

10 HUP-302 APTITUDE SKILLS - - 2 40 60 100 1

TOTAL 15 3 12 520 480 1000 22.5

Note: Students will undergo 6 weeks vocational training after 6th semester. Students are required to submit one project.

ELECTIVE I

S.NO. SUBJECT CODE SUBJECT NAME

1 CST-331 and CSP-334

SOFTWARE TESTING & QUALITY ASSURANCE AND SOFTWARE TESTING & QUALITY ASSURANCE LAB


LINUX PROGRAMMING AND LINUX PROGRAMMING LAB


OBJECT ORIENTED SOFTWARE ENGINEERING AND OBJECT ORIENTED SOFTWARE ENGINEERING LAB


ENTERPRISE INTEGRATION AND ENTERPRISE INTEGRATION LAB


ADVANCED PROGRAMMING AND ADVANCED PROGRAMMING LAB



7TH SEMESTER

S.NO SUBJECT CODE SUBJECT NAME Hours Per Week Marks Credits

L T P INT EXT Total

1 CST-401 SYSTEM SOFTWARE 3 - - 40 60 100 3

2 CST-402 DIGITAL SIGNAL PROCESSING 3 1 - 40 60 100 3.5

3 CST-403 ARTIFICIAL INTELLIGENCE 3 - - 40 60 100 3

4 CST-404 SECURITY & CRYPTOGRAPHY 3 1 - 40 60 100 3.5

5 OPEN ELECTIVE 3 1 - 40 60 100 3.5

6 CSP-405 ARTIFICIAL INTELLIGENCE LAB - - 2 60 40 100 1

7 CSP-406 MINOR PROJECT LAB - - 8 60 40 100 4

8 CSP-408 SEMINAR - - 2 100 - 100 1

9 CSP-409 INDUSTRIAL TRAINING - II - - 4 60 40 100 6

TOTAL 15 3 16 480 420 900 28.5

OPEN ELECTIVE

S.NO. SUBJECT CODE

SUBJECT NAME

1 CST-441 Cyber Laws and Security 2

CST-442 Software Engineering Methodologies

3 CST-443 E-Banking & Commerce 4 CST-444 Enterprise Resource Planning



8TH SEMESTER

S.NO SUBJECT CODE SUBJECT NAME Hours Per Week Marks Credits

L T P INT EXT Total

1 CST-421 DIGITAL IMAGE PROCESSING 3 1 - 40 60 100 3.5

2 CST-422 BUSINESS INTELLIGENCE& ANALYSIS 3 - - 40 60 100 3

3 CST-423 SOFT COMPUTING 3 1 - 40 60 100 3.5

4 ELECTIVE-II 3 - - 40 60 100 3

5 CSP-424 DIGITAL IMAGE PROCESSING LAB - - 2 60 40 100 1

6 CSP-425 SOFT COMPUTING LAB - - 2 60 40 100 1

7 CSP-426 MAJOR PROJECT LAB - - 8 60 40 100 6

8 CSP-427 SEMINAR - - 2 100 - 100 1

TOTAL 12 2 14 440 360 800 22

ELECTIVE-II

S.NO. SUBJECT CODE SUBJECT NAME

1 CST-431 EMBEDDED SYSTEMS

2 CST-432 ADVANCED DBMS 3 CST-433 MOBILE APPLICATION DEVELOPMENT 4 CST-434 BIOINFORMATICS 5 CST-435 CLOUD COMPUTING



CHANDIGARH UNIVERSITY GHARUAN

Scheme & Syllabus of B.E. Computer Science & Engineering [CSE]

3rd Semester



CHANDIGARH UNIVERSITY, GHARUAN

Analog and Digital Electronics (CST-201) L T P Credits

3 1 - 3.5

Total Hours: 48

Course Objectives:

To understand the operational basics and design of electronics devices & circuits.

To gain knowledge about various digital circuits and systems.

To develop an applied base for your field of practice knowledge.

UNIT-I

Electronic Devices: p-n junction diode and its characteristics, diode as a circuit element,zener diode,

pnp&npn transistor and characteristics in CB, CE and CC modes. [4]

Amplifiers:Concept of an amplifier, Class A direct coupled with resistive load, Transformer coupled with

resistive load, characteristics of amplifiers. [4]

Oscillators:Concept of feedback and its merits and demerits, block diagram of Oscillators, Conditions of

oscillations. [3]

Number Systems: Introduction, Binary, decimal, Octal and hexadecimal number systems (including

fractions), Conversion from one number system to another. [4]

UNIT-II

Computer Arithmetic: Signed and unsigned numbers, Binary operations-addition; Subtraction,

Multiplication and division, Floating Point addition & subtraction, Subtractions using 1's and 2's

compliment; codes : ASCII code; Excess 3 code Gray code [6]

Logic gates and functions: Introduction to digitization. Basic gates: AND,OR, NOT. Universal gates:

NAND, NOR. Basic idea of XOR and XNOR gates. Basic theorems of Boolean Algebra, principle of

duality. Sum of products (SOP) and Product of sums (POS), canonical form, simplification using K-map.

[8]

UNIT-III Combinational circuits: Multiplexers, demultiplexer, encoders, decoders, adders, subtracters and code

converters, BCD to 7 segment display. A/D and D/A convertors.[8]

Sequential Circuits: Difference between combinational and sequential circuits, Synchronous and

asynchronous sequential circuit. Flip flops: SR, JK, D, T, Shift registers and its operations,

counters:synchronous and asynchronous counters, modulo N counters, updown counters.[6]

Memories: RAM, ROM, EPROM, EEPROM, PLA. [5]



Text Books :

1. Malvino L., Digital Principle and Applications ,Tata McGraw Hill.

2. Ghoshal, Digital Electronic , Cengage Learning.

3. Boylestad ,R., Electronics Devices and Circuit Theory ,Pearson Publication.

Reference Books:

1. Halkias, Millman , Electronic Devices and Circuit, Tata McGraw Hill.

2. Mano Morris, Digital Design, Prentice Hall of India. 3. Fletcher, An Engg. Approach to digital design, Prentice Hall of India.

Instructions for paper setter.

The syllabus has been divided into three equal units. The paper setter is required to set Ten questions in

all, three questions from each unit and a compulsory question consisting of five sub parts and based on

the whole syllabus. The candidate will be required to attempt six questions including the compulsory

question number no 1 and not more than two questions from each unit.




Computer Organization and Architecture (CST-202)

L T P Credits

3- - 3

Total Hours:48

Course Objectives:

To familiarize students with the architecture of a processor.

To have a good understanding of various functional units of computer.

To understand the design of a basic computer system.

UNIT-I

Basic concepts-Digital computer with its block diagram, computer hardware components-ALU, registers,

memory, system bus structure-data, address and control bus. [4]

Instruction Set Architectures-Levels of programming Languages, Assembly Language Instructions:

instruction cycle, instruction types,addressing modes, RISC vs CISC. [6]

Computer Organization- CPU organization, Memory Subsystem Organization: Types of memory,

Internal Chip Organization, memory subsystem configuration. [6]

UNIT-II

Design of control unit - Hardwired control unit, Micro-Programmed control unit and comparative study.

[4]

Memory organization-Memory hierarchy, Cache Memory Associative Memory,Cachememory with

associative memory, Virtual Memory: Paging, Segmentation. [6]

Input output organization Asynchronous Data transfer: Source Initiated, Destination Initiated, Handshaking, Programmed I/O, Interrupts DMA, IOP [7]



UNIT-III

Introduction to Parallel Processing- Parallellism in uniprocessor system, Flynns Classification, Handlers Classification, concept of pipelining, Instruction Pipeline, Arithmetic Pipeline. [8]

Multiprocessors- Characteristics of multiprocessors, Uniform and non-uniform memory access multi

processors, various interconnection networks. [7]

Text Books:

1. CarpinelliJ.D,Computer systems organization &Architecture,Fourth Edition, Addison Wesley.

2. Patterson and Hennessy, Computer Architecture , Fifth Edition Morgaon Kauffman.

Reference Books:

1. J.P. Hayes , Computer Architecture and Organization, Third Edition. 2. Mano, M., Computer System Architecture, Third Edition, Prentice Hall. 3. Stallings, W., Computer Organization and Architecture, Eighth Edition, Pearson Education.









Data Structures (CST-203)

L T P Credits

3- - 3

Total Hours: 48

Course Objectives:

To understand the concept of the data structures and operations on them,

To apply different data structures for modeling real world problems.

Unit I

Introduction:Concept of data and information, Introduction to Data Structures, Types of data structure: Linear and non-linear data structures, operations on Data Structures, Algorithm complexity,

Time-space trade off, asymptotic notations. [4]

Arrays: Basic terminology,Linear arrays and their representation, Traversing Linear Array, Insertion & Deletion in arrays, searching linear search, binary search, sorting insertion sort , selection sort , bubble sort , merging arrays & merge sort , complexity analysis of each algorithm,Multi-dimensionalarrays and

their representation, Pointers; Pointer Arrays, Records; Record structure, representation of records in

Memory, Parallel Arrays, sparse matrices and their storage.

[12]

Unit II

Linked List: Linear linked list, Representation of Linked Lists in Memory, Traversing a linked list, searching a linked list, insertion in & deletion from linked list, Header Linked List, doubly linked list,

Operations on doubly linked list,complexity analysis of each algorithm, Application of linked lists.

[6]

Stacks:Basic terminology, Sequential and linked representations, Operations on stacks: PUSH & POP, Application of stacks: Parenthesis matching, evaluation of postfix expressions, conversion from infix to

postfix representation, Quick Sort and its complexity analysis.Meaning and importance of recursion,

principles of recursion& implementation of recursive procedure. [6]



Queues:Linear queue, Sequential and linked representation of Linear queue, Circular queue, Operations on queue, Deques, Priority queue. [4]

Unit III

Graphs:Graph Theory terminology, sequential representation of graphs (adjacency matrix, Path Matrix), traversing a graph, Operations on Graph. [4]

Trees:Basic terminology, Binary Trees, Representation of Binary Trees in Memory, traversing Binary Trees, Traversal Algorithms using stacks, Header Nodes; Threads, Binary Search trees, Searching,

Inserting & Deleting in Binary Search Trees, AVL Search trees, B Trees,Heap & Heap Sort.

[8]

Hashing& File Organization: Hash Table, Hash Functions, Collision Resolution Strategies, Hash Table Implementation. Concepts of files, Organization of records into Blocks, File organization:

Sequential, Relative, Index Sequential, Inverted File. [4]

Text Books:

1. Lipschutz, Seymour, Data Structures, Schaum's Outline Series, Tata McGraw Hill.

2. Gilberg/Forouzan, Data Structure with C ,Cengage Learning.

3. Augenstein,Moshe J , Tanenbaum, Aaron M, Data Structures using C and C++, Prentice Hall of India.

Reference books:

1. Goodrich, Michael T., Tamassia, Roberto, and Mount, David M., Data Structures and Algorithms in C++, Wiley Student Edition.

2. Aho, Alfred V., Ullman, Jeffrey D., Hopcroft ,John E. Data Structures and Algorithms, Addison Wesley.









Discrete Mathematics (CST-204) L T P Credits

3 1 - 3.5

Total Hours: 48

Course Objectives:

To be familiar with fundamental mathematical structures useful for problem solving in engineering domain.

To understand basic data structures and algorithms

To recognize and represent problems in more better way to find the optimal solution.

Unit-I

Set Theory: Introduction to set theory, Set operations, Algebra of sets, combination of sets, Duality,

Finite and Infinite sets, Classes of sets, Power Sets, Multi sets, Cartesian Product. [4]

Relations and Functions : Representation of relations, Types of relation, Binary Relations, Equivalence

relations and partitions, Partial ordering relations and lattices, Mathematics Induction, Principle of

Inclusion & Exclusion. Function and its types, Composition of function and relations, Cardinality and

inverse relations. Functions &Pigeonhole principle. [8]

Propositional Calculus: Basic operations: AND(^), OR(v), NOT(~), Truth value of a compound

statement, propositions, tautologies, contradictions. [4]

Unit-II

Recursion And Recurrence Relation:Sequences, Introduction to AP and GP series, partial fractions,

linear recurrence relation with constant coefficients, Homogeneous solutions, Particular solutions, Total

solution of a recurrence relation using generating functions. [8]

Algebraic Structures : Definition, elementary properties of algebraic structures, Basic algebraic

structures : Semigroup,monoid, group, subsemigoup, submonoid, subsemigroup. Congruence relations.

Homomorphism, Isomorphism and Automorphism, Subgroups and Normal subgroups, Cosets,

Lagranges theorem, Cyclic groups. Rings, Types of rings, division rings, Integral domains and fields [8]

Unit-III

Combinatorial Mathematics: Techniques of counting: Rule of sum, Rule of product. Permutations and

combinations.Generating Functions. [4]

Graph Theory: Introduction to graphs , Directed and undirected graphs, Homomorphic and Isomorphic

graphs, Subgraphs, Multigraph and Weighted graph, Paths and circuits, Shortest path in weighted graphs,

Eulerian paths and circuits, Hamiltonian paths and circuits. Planar graphs, Eulers formula. [6]



Trees: Introduction to trees, Difference between a graph and a tree, Rooted Trees, Path length in

trees,Spanning Trees & cut-sets, Minimum cost spanning trees, Binary trees and its traversal.[6]

Text Books:

1. Liu C.L, Elements of Discrete Mathematics, McGraw Hill. 2. Santha, Discrete Mathematics with Graph Theory, Cengage Learning.

3. Ronald G, Knuth, Donald and Patashik, Oren, Concrete Mathematics: A Foundation for Computer Science, Addison-Wesley.

Reference Books:

1. Kolman ,B. and Busby ,R.C, Discrete Mathematical Structures, PHI. 2. Gersting, Judith L. Mathematical Structures for Computer Science, Computer Science Press . 3. Doerr and Levasseur , Applied Discrete Structures for Computer Science. 4. Tembley&Manohar , Discrete Mathematical Structures with Applications to Computers,

McGraw Hill.

5. Rosen K. H , Discrete Mathematics and its applications, Mc-Graw hill. 6. Lyengar, N Ch SN, Chandrasekaran, VM, Discrete Mathematics.









Object Oriented Programming (CST-205) L T P Credits

3 -- 3

Total Hours:48

Course Objectives: To understand object oriented programming concepts.

To differentiate between object oriented and procedural concepts.

To understand the Concept of classes, objects, constructors, destructors, inheritance, operator

overloading and polymorphism, pointers, virtual functions, templates, exception handling, file, file

operations and handling.

UNIT-I

Introduction: Differences between object oriented and procedureoriented programming.

Object Oriented Programming Paradigm, Basic Object oriented concepts: class, object, data abstraction

and encapsulation information hiding, inheritance, polymorphism, dynamic binding, message passing.

Benefits of OOPS. [6]

Basic Constructs In C++: Basic structure of a C++ program, main function, input and output operators,

tokens, keywords, identifiers and constants, basic data types, user defined data types, operators in C++,

unformatted and formatted I/O Operations, manipulators control statements, functions:

function call, parameter passing mechanisms, function overloading, inline functions, Arrays and Strings.

[6]

Classes and Objects:, Difference between structure and class, specifying a class, access specifiers, creating objects , accessing class members, defining a member function inside and outside class, private

member function, static data members & member functions. Objects as function arguments, friend

function and returning objects to functions. [6]

UNIT-II

Constructors And Destructors: Need for constructors, types of constructors: parameterized,

Constructors with default arguments,Constructor Overloadingand copy constructors, destructors and their

need. [4]

Operator Overloading and Type Conevrsions: Defining operator overloading, rules for overloading

operators, overloading of unary & binary operators, type conversion - basic type to class type & vice

versa. [4]

Inheritance: Defining derived class, modes of inheritance, types of inheritance, ambiguity in inheritance,

virtual base class, Function overriding, order of execution of constructors, Member Classes: Nesting of

Classes [6]



UNIT-III

Pointers, Virtual Functions& Polymorphism: Introduction &types of polymorphism: static and

dynamic binding, Introduction to pointers, need for pointers, declaring & initializing pointers, Array of

pointers, pointer to objects, this pointer, pointer to derived classes, Dynamic memory allocation: new and

delete operator, virtual functions and pure virtual functions, abstract class.

[7]

Templates & Exception Handling:Concept of Templates & Generic Programming, Class Templates,

Function Templates, Overloading of Template Functions, Basics of C++ Exception Handling: Try,

Throw, Catch, Throwing an Exception, Catching an Exception, Re-throwing an Exception.

[5]

Files: Introduction to File streams, Hierarchy of file stream classes, File operations, File I/O, File opening

Modes, Reading/Writing of files, Error handling in files, Random-access to files. [4]

Text books:

1. Balagurusami, E., Object Oriented Programming in C++, Tata McGraw-Hill. 2. Lafore Robert, Object Oriented Programming in C++, Waite Group.

Reference Books:

1.Scildt, Herbert, C++- The Complete Reference, Tata McGraw-Hill. 2. Stroustrup, Bjarne, The C++ Programming Language, Pearson Education. 3. Ravichandran D., Programming with C++,Tata McGraw-Hill. 4. Farrell, Object Oriented Programming Using C++,Cengage Learning.









Analog and Digital Electronics Lab (CSP-206) L T P Credits

- - 2 1

Course Objectives:

To study the characteristics of different amplifiers and oscillators.

To realize different combinational and sequential circuits.

UNIT I

1. StudyZener regulator as voltage regulator.

2. Plot the input and output characteristics of CE configuration.

3. Study the characteristics of a Class- A amplifier.

4. Study the response of RC phase shift oscillator and determine frequency of oscillation.

UNIT II

5. Study the response of Hartley oscillator and determine frequency of oscillation.

6. Truth-table verification of OR, AND, NOT, XOR, NAND and NOR gates.

7. Realization of OR, AND, NOT and XOR functions using universal gates.

UNIT III

8. Realization Half Adder / Full Adder using Logic gates.

9. Design 4-Bit magnitude comparator using logic gates. Multiplexer: Truth-table verification and

realization of Half adder and Full adder using MUX.

10. Flip Flops: Truth-table verification of RS, JK , D, JK Master Slave Flip Flops.




Data Structures Lab (CSP-207) L T P Credits

- - 4 2

Course Objectives:

To implement various data structure and operations on them using C++.

To implement various sorting and searching algorithms using C++.

UNIT-I

1. Write a menu driven program that implement following operations (using separate functions) on a

linear array:

a)Insert a new element at end as well as at a given position

b)Delete an element from a given whose value is given or whose position is given

c)To find the location of a given element

d)To display the elements of the linear array

2. Program to demonstrate the use of linear search to search a given element in an array.

3. Program to demonstrate the use of binary search to search a given element in a sorted array in

ascendingorder.

4.Program to sort an array of integers in ascending order using bubble sort.

5. Program to sort an array of integers in ascending order using selection sort.

6. Program to sort an array of integers in ascending order using insertion sort.

7. Program to sort an array of integers in ascending order using merge sort.

UNIT-II

8. Write a menu driven program that maintains a linear linked list whose elements are stored in on

ascending order and implements the following operations (using separate functions):

a) Insert a new element

b) Delete an existing element

c) Search an element

d) Display all the elements

9. Write a program to demonstrate the use of stack (implemented using linear array) in converting

arithmetic expression from infix notation to postfix notation.

10. Program to demonstrate the use of stack (implemented using linear linked lists) in evaluating

arithmetic expression in postfix notation.

11. Program to sort an array of integers in ascending order using quick sort.

12. Program to demonstration the implementation of various operations on a linear queue represented

using a linear array.

13. Program to demonstration the implementation of various operations on a circular queue represented

using a linear array.



UNIT-III

14. Program to demonstrate the implementation of various operations on a queue represented using a

linear linked list (linked queue).

15. Program to illustrate the implementation of different operations on a binary search tree.

16. Program to sort an array of integers in ascending order using heap sort.

17. Program to illustrate the traversal of graph using breadth-first search.

18. Program to illustrate the traversal of graph using depth-first search.




Object Oriented Programming Lab (CSP-208)

L T P Credits

- - 4 2 Course Objectives:

To implement basic programs using C++.

To implement various object oriented concepts like classes, objects, inheritance, polymorphism,

overloading etc. using C++.

To handle exceptions in C++.

UNIT-I

1. Write a program to print prime numbers bet. 1 to 100. 2. Write a program to find whether a given number is palindrome or not. (For Ex- 2112 is

palindrome)

3. Write a program to find whether a given string is palindrome or not. (For Ex- MADAM is palindrome)

4. Write a program which takes two n*n matrices where n will be specified by the user. Write a method which does summation of both matrices and store the result in third matrix also display

the resultant matrix.

5. Write a program to generate the Fibonacci series up to user specified limit using recursive function.

6. Define the structure called student having properties like stud_id, stud_name, stud_branch, and email_add. Write a program which takes the details of 5 students and print them

on console.

7. Write a program having class calculator, such that the function addition, subtraction are defined inside a class and multiplication and division are defined outside the class.

8. Write a program which takes 10 integer numbers from user. Save all the positive numbers to one file, all the negative numbers to another file.

UNIT-II

9. Write a program to demonstrate constructor overloading in a class. 10. Write a program to define a static data member which has the initial value of 55 and to find the

sum of the following series. Sum=1+2+3+4+10. The addition of series is to be repeated five times.

11. Write a program for addition of complex numbers by overloading binary operator. 12. Write a program to demonstrate the overloading of increment and decrement operator. 13. Write a program to access the private data of a class by non-member function through friend

function.



14. Write a program to read the derived class data members such as name, roll no, sex, marks and displays it on screen. The program should follow single inheritance concept.

15. Write a program having three classes Person, Student and Exam. The Person class is the base class, Student class is derived from Person and Exam class is derived from Student.

16. Write a program that shows order of execution of base and derived class constructors and destructors using inheritance.

UNIT-III

17. Write a program to display the concept of virtual functions. 18. Write a program to demonstrate the use of new and delete operators. 19. Write a program to demonstrate the exception handling. 20. Write a program to demonstrate use of template function in a template class. 21. Write a program to store the information of about 5 students in a file student and read the

content and print them on screen.

22. Write a program to put Integer values in file and then opens that file and put odd numbers in file named odd and even numbers in file named even and display the contents of both files.

23. Write a program to demonstrate the use of File Pointers.



CHANDIGARH UNIVERSITY

GHARUAN

Scheme & Syllabus of B.E. Computer Science & Engineering [CSE]

4thSemester




Numerical and Statistical Techniques - (CST-221)

L T P Credit

3 1 - 3.5

Total Hours:48

Course Objectives:

To co-relate knowledge in mathematic with engineering situations.

To lay a foundation for further studies in Engineering Mathematics.

UNIT -I

Interpolation: - Newtons interpolation formulas, Newtons forward interpolation formula, Newtons backward interpolation formula, Interpolation with unequal intervals: Lagranges formula for unequal intervals, divided differences, Newtons divided differences formula. [7]

Numerical Integration: Trapezoidal Rule, Simpsons one third Rule, Simpsons three eighth Rule. [5]

Numerical solution of Ordinary Differential Equations: Introduction, Solution of Polynomial equation by Bisection and Newton Raphson Method, Eulers method, Modified Eulers Method, Runge Kutta method of fourth order, Predictor Corrector Method-Milnes method.AdamBashforth. [5]

UNIT-II

Statistics: - Measure of central tendency: Mean, Median and Mode, Measures of dispersion coefficient of variations, Relations between measures of dispersion, Standard deviation of the combination of two

groups, Skewness, Kurtosis. [8]

Probability: Basic concepts and axioms in probability, conditional probability, Bayes theorem, Bernoulli trials. [7]

UNIT-III

Random Variables: Discrete and continuous random variables. Basic discrete distributions: Binomial, geometric and Poisson distribution. Basic continuous distributions: Exponential and normal distributions. [8]

Sampling and Testing of Hypothesis: Sampling methods. student t-test, Chi-square , F-test and curve fitting. Correlation and regression analysis. [8]



Text Books:

1. Kreyszig , E., Advanced Engineering Mathematics, John wiley.

2. Grewal, B.S., Higher Engineering Mathematics, Khanna Publishers. New Delhi.

3. Bali, N. P., A Text Book on Engineering Mathematics, Luxmi Pub., New Delhi.

4. Fisher Sir Ronald Aylmer, Statistical Methods for Research Workers, Oliver & Boyd

publishers.

Reference Books:

1. Ott. R. Lyman, Longnecker T. Micheal, An Introduction to Statistical Methods and Data Analysis,

Cenage Learning.

2. Ray Whlie, C., Advanced Engineering Mathematics, McGraw Hill.

3. Schilling, Numerical Methods Using C, Cengage Learning.

4. Freund, Mohr, Wilson, Statistical Methods, Academic Press.









Microprocessors and Interfacing (CST-222) L T P Credit

3 1 - 3.5

Total Hours:48

Course Objectives:

To understand the architecture , components, flags and instruction set of 8085 and 8086.

To design interfacing circuits using 8085 and 8086.

To gain familiarity with 8255(PPI), 8253(Programmable interval timer), 8259( PIC), 8237(DMA)

and advanced microprocessor chips.

Unit-I

Introduction: Review of Hardwired Logic v/s Flexible Logic, Tri State Logic.Introduction to

microprocessor, Difference between microprocessor and microcomputer, Basic components of a

microprocessor, system bus: address, data and control buses. [6]

8085 microprocessor: Architecture, pin diagram, flags, addressing modes, instruction set and assembly

language programming, timing diagrams, interrupt structure of 8085. [8]

Memory Interfacing: Interfacing memory- Interfacing SRAM, DRAM, EPROM etc.

[3]

Unit-II

Interfacing devices:

Architecture, Block Diagram, Control words , Modes and working of 8255 [4]

Architecture, Block Diagram and working of8251 [3]

Architecture, Block Diagram and working of 8253 [3]



Unit-III

8086 Microprocessor:Architecture, block diagram and pin diagram of 8086, operating modes of 8086,

details of sub-blocks such as EU, BIU; memory segmentation and physical address computations,

program relocation, addressing modes. [9]

Advanced microprocessors: Introduction to 80186, 80286, 80386, 80486. Pentium microprocessors.

[6]

Text Books:

1. Gaonkar, Ramesh S., Microprocessor Architecture, Programming & Applications with

8085,Wiley Eastern Ltd.

2. Ayala, The 8086 Microprocessor :Programming& Interfacing the PC , Cengage Learning.

3. Bhurchandi,K.M , Ray, A.K , Advanced microprocessors and peripherals, TMH.



Reference Books:

1. Brey,The Intel Microprocessors 8086- Pentium processor, PHI.

2. Triebel and Singh,Avtar , The 8088 & 8086 Microprocessors-Programming, interfacing,

Hardware & Applications ,PHI .

3. Liu,Yu-Chang &Gibson, Glenn A,Microcomputer systems: The 8086/8088 Family:

architecture, Programming & Design, PHI.

4. Antonakos, James L., The Pentium processor, Pearson.









Digital Communication & Computer Network (CST-223) L T P Credit

3 - - 3

Total Hours: 48

Course Objectives:

To understand Data Communication , its components & network types

To understand and Compare models, signals, multiplexing, switching & transmission media.

UNIT I

Introduction: Introduction to network, types of transmission technologies, Network Categories: LAN,

MAN, WAN (Wireless /Wired), Network Software: Concept of Layers, Protocols, interfaces and services.

Reference Models: OSI, TCP/IP and comparison. [8]

Physical Layer: Bit rate,Baud rate, Bandwidth, Transmission Impairments: Attenuation, Distortion,

Noise; Data rate limits: Nyquist formula, Shannon Formula, Modulation & modems; Transmission

Modes, Multiplexing: Frequency Division, Time Division, Wavelength Division;Concept of Topologies,

Transmission Media: Twisted pair, coaxial, fiber optics, Wireless Transmission (radio, microwave &

infrared);Message switching,Circuit Switching & Packet Switching.

[8]

UNIT II

Data Link Layer: Design issues, Error Detection & Correction; Flow control & Error Control;Sliding

Window Protocols,ARQ: Stop & Wait , Go Back n, Selective Repeat ; Examples of DLL protocols HDLC, PPP;Medium Access Sub layer: Channel Allocation; Random Access: ALOHA, CSMA

protocols; Controlled Access: Polling, Reservation, Token Passing;Examples of IEEE

802.2,802.3,802.4, 802.5,802.11 standards. [8]

Network Layer: Design issues, Logical Addressing: IPv4 & IPv6; Packet Formats & their comparison

IPv4 & IPv6;Routing Algorithms: Distance Vector, Link State, Hierarchical, Supernetting and subnetting

;Congestion Control: Principles of congestion control; Congestion prevention policies, Leaky bucket &

Token Bucket Algorithms. [8]

UNIT III

Transport Layer: Services provided to upper layers, Elements of Transport protocols.Addressing, Flow

Control & buffering;Example Transport protocols: TCP, SCTCP & UDP [8]

Application Layer: Network security, Domain Name System, Simple Network Management Protocol,

Electronic Mail, World Wide Web. [8]

Text Books:



1. Forouzan, Behrouz A.: Data Communications & networking, 4th edition TataMcgraw Hill.

2. Tanenbaum, Andrew S: Computer networks, 4th Edition, Pearson education.

Reference Books:

1. Stallings, William : Data and computer communications, 8th edition,Pearson Education.

2. Ross, Kurose,Computer Networking: A top down Approach, 2nd edition, Pearson Education.

3. Coomer,Douglas E.: Internet working with TCP/IP , 2 nd edition, Pearson Education

4. Dave , Computer Networks, Cengage Learning.









Operating System (CST-224) L T P Credit

3 - - 3

Total Hours: 48

Course Objectives:

To grasp a fundamental understanding of operating systems and its functionalities.

To understand process management, various scheduling algorithms, concurrency and

synchronization.

To understand memory management and virtual memory concepts in modern Operating systems.

UNIT I

Introduction to the Operating System: Introduction to Operating Systems, Operating System Structure,

Main Functions and characteristics of Operating Systems, Types of Operating Systems, System calls,

Types of system calls, System programs. [5]

Process Management: Process Concept, Process Control Block, Process Scheduling, Threads, CPU

Scheduling : Preemptive/ Non Preemptive Scheduling, Scheduling Criteria, Scheduling Algorithms,

inter-process communication, remote procedure calls, Process Synchronization. [6]

Deadlocks: Deadlock characterization and conditions for deadlock, deadlock prevention, Deadlock

avoidance-safe state, resource allocation graph algorithm, Bankers algorithms-Safety algorithm, Deadlock detection, Recovery from deadlock. [6]

UNIT II

Memory Management: Address binding, logical versus physical address space, dynamic loading,

Swapping, contiguous memory allocation,Fragmentation, Paging, Segmentation, Segmentation with

Paging, Virtual Memory Concept, Demand Paging, Page Replacement, Page Replacement Algorithms.

[6]

Device Management: Disk Structure, Disk formatting, Disk Scheduling Algorithms, RAID structure-

RAID levels, problems with RAID. [5]

File ManagementFile Concepts, Access Methods, Directory Structure, Allocation Methods, Free Space

Management. [5]



UNIT III

System Protection and Security:Goals, principles and domain of protection, Access matrix,

implementation of access matrix, The security problem, program threats, system and network threats.

[8]

Distributed and Network Operating Systems: Overview: Topology, connection strategy, network

operating system types: Peer to Peer & Client server, Distributed message passing. [7]

Text Books:

1. Galvin, Peter B.,Silberchatz, A., Operating System Concepts, Addison Wesley, 8th Edition.

2. Flynn, Operating Systems, Cengage Learning.

3. Dhamdhere, D.M., "Operating System:A Concept Based Approach",

Tata Mc-Graw- Hill.

Reference Books:

1. Madnick , Stuart E., Donovan, John J. Operating System, McGraw Hill.

2. Stalling,William,Operating Systems, Pearson Education, Fifth Edition.









Web Technologies (CST-225) L T P Credit

3 - - 3

Total Hours: 48

Course Objectives:

To design and format web pages using HTML and CSS.

To handle events and client side processing using Java Scripts

To handle graphics and media objects in Web page

To gain familiarity with the principles of electronic documentation and structured documents, particularly the XML standard family.

UNIT I

Introduction: Web Standards, Web browsers, Variety of displays, Server & server software, HTTP and

FTP , WCAG 1.0, 2.0, Character sets & encoding. [5]

Document structure: Minimal document structure, type declaration, switching, route and header

elements, text and formatting tags, links, images and objects, table, Frames and Frame sets, Forms

[5]

Web Publishing using CSS: CSS Basics: benefits of CSS, selectors and its types, adding styles,

introduction to box model, browser support, Creating an overall look: font and text properties, basic box

properties, colors and backgrounds, floating and positioning. [6]

UNIT II

Formatting: Table formatting, list and generated content, two, three column layouts, Box formatting,

image replacement, rollovers, Navigation bars. [6]

Introduction to java script: Dos and Donts, implementation method, Java script syntax: Statements, variables, data types, arrays, Operators, Control statements, Objects, Event handling, Browser object,

DOM Scripting, Functions, Dialogs: performing I/O. [9]

UNIT III

Objects in java script: Such as Array, date, math, string, Accessing page elements using DOM

(Document object model) [4]

Web Graphics Overview: Web graphic file formats, image resolution, web graphic production tips, Gif

format, jpeg format, PNG format, Animated GIFs. [4]



Media: Basic digital audio concepts, Creating and optimizing audio for the web, Streaming audio, Audio

formats, Basic digital video concepts, Compression, Video File formats, Adding video to HTML

document. [4]

Introduction to XML: XML basics, XML document syntax, Well-Formed and Valid XML, XML

Document type definition, XML on the web, XML application. [5]

Text Books:

1. Niederst ,Jennifer , Web design in a nutshell, O'Reilly Media. 2. Moseley Ralph, Savaliya M. T., Developing Web Applications, Wiley India.

Reference Books:

1. Powers S., Dynamic Web Publishing, Tech Media. 2. Thomas A. Powell, The Complete Reference HTML & XHTML, Tata McGraw-hill. 3. Sklar, Web Design Principles, Cengage Learning.









Microprocessors &Interfacing Lab (CSP-226) L T P Credits

- - 2 1

Course Objectives:

To get familiarization with 8085 kit and simulator.

To implement basic programs using 8085 kit/simulator.

UNIT-I

1. To study 8085-microprocessor trainer kit. 2. Addition of two 8-bit numbers; sum 8 bits 3. Addition of two 16 bit number; sum 16- bits. 4. Subtraction of two 8-bit numbers; result 8 bits. 5. Subtraction of two-16 bit numbers; sum 16 bits.

Unit-II

6. Find ones complement of an 8-bit number. 7. Find ones complement of a 16-bit number. 8. Find twos complement of a 8-bit number. 9. Find twos complement of a 16- bit number. 10. Shift an 8 -bit number to left by 1- bit. 11. Shift an 8-bit number to left by 2-bits. 12. Shift a 16 -bit number to left by 1- bit. 13. Shift a 16-bit number to left by 2- bits.

Unit- III

14. Mask of least significant 4 bits of an 8-bit number. 15. Mask of most significant 4 bits of an 8-bit number. 16. Find the smaller out of two numbers. 17. Find the smaller number in a data array 18. Find the larger out of two numbers. 19. Find the largest number from data array.




Network &Operating System Lab (CSP-227) L T P Credit

- - 4 2

Course Objectives:

To understand Computer Hardware and networking.

To execute various commands in LINUX.

To understand the concept of shell programming.

UNIT I

1. Familiarization with Computer Hardware & writespecifications of latest desktops and laptops.

2. Installation Process of various operating systems.

3.Study of LAN Components .

4. Introduction of Shell programming using

- command syntax

- simple functions

- basic tests

5. Preparing straight and cross cables.

UNIT

6. (a)Write programs using the I/O system calls of UNIX operating system (open, read, write etc.)

(b)Write C programs to simulate UNIX commands like ls, grep, etc.

7. Familiarization with transmission media viz. coaxial cable, twisted pairs, optical fibre networking, wireless networking, connectors etc.

8. Write programs using the following system calls of UNIX operating system:

fork, exec, getpid, exit, wait, close, stat, opendir, readdir.

9. Creation of different topologies.

UNIT III

10. Simulate the Bankers algorithm for deadlock avoidance and deadlock prevention.

11. Sharing of resources with two connected nodes.

12. Configuration of TCP/IP Protocols .

13. Network troubleshooting.




Web technologies Lab (CSP-228) L T P Credit

- - 4 2

Course Objectives:

To design web pages using HTML and CSS

To handle client side processing of web page using java script.

To learn the storage and retrieval of data using XML.

Unit I

1. Design Simple Web Pages using standard HTML tags like, HEAD, TITLE, BODY 2. Design HTML web pages, which make use of INPUT, META, SCRIPT, FORM, BGSOUND, 3. Working with various attributes of standard HTML elements. 4. Design an image library of your department activities using HTML and CSS. 5. Design a web template using HTML and CSS.

Unit II

6. Using Java Script's Window and document objects and their properties and various methods like alert (), evaI (), Parselnt (), input() etc. methods to give the dynamic functionality to HTML web

pages.

7. Writing Java Script snippet which make use of Java Script's inbulit as well as user defined objects like navigator, Date Array, Event, Number etc.

8. Create a web page of user records. These records should be entered using form elements on the same page and page should be updated dynamically using JavaScript.

9. Write code which does the form validation in various INPUT elements like TextFiled, Text Area, Password, Selection list etc.

Unit III

10. Writing XML web Documents which make use of XML Declaration, Element Declaration, Attribute Declaration.

11. Write a Java script code to read the data from XML and embed in HTML document. 12. Write a java script code to read the data from the HTML form elements and store it in XML file. 13. Create a web page using HTML and JavaScript to search the records with different search criteria

from XML file and display the result in tabular form on the page.

14. Modify above page by adding an option to edit the searched record and update it in XML file.

Note: Students are alsorequired to make one small project by using different concepts of

webtechnologies.




GHARUAN

Scheme & Syllabus of B.E. Computer Science &Engineering [CSE]

5thSemester




Design and Analysis of Algorithms (CST-301) L T P Credit

3 1 - 3.5

Total Hours:48

Course Objective:

To understand meaning and characteristics of algorithms

To study different algorithm design techniques.

To implement different algorithm design techniques for solving engineering and related problems.

UNIT-I

Algorithm and its characteristics: - Algorithms and its characteristics, Growth of functions: asymptotic

notations, Analyzing and design of algorithms, Performance analysis and measurement of algorithms,

Time and space complexity. [6]

Elementary Data Strictures: - Stacks, Queues, Trees, Graphs, Sets and Disjoint Set, Union[4].

Divide and Conquer: - General method, Binary Search,Merge sort, Quick sort, Finding maximum and

minimum. [6]

UNIT-II

Greedy Algorithms: - General method,Elements of greedy strategy, An Activity Selection Problem,

Knapsack problem. Huffman codes, Minimum cost spanning trees. [6]

Dynamic Programming:- General method,Elements of dynamic programming, Matrix-chain

multiplication problem, Longest common Subsequence Problem, Multistage Graph, 0/1 Knapsack,

Travelling salesperson problem (TSP). [6]

Back Tracking: - General method, 8 queen's problem, Graph coloring. [4]

UNIT-III

Elementary Graph Algorithms: - Basic terminology, Representation of Graphs, Depth First Search,

Breath First search, topological sort, Single source shortest path: Bellman- Ford algorithm, Dijkstras Algorithm, All Pair shortest paths: Floyd Warshall algorithm. [8]

Branch and Bound: - Branch and Bound method, 0/1 Knapsack problem, Travelling salesperson

problem. [4]

NP Hard and NP Complete Problems: - Basic concepts, The classes P and NP, NP Hard and NP

Complete problems, NP-completeness & reducibility. [4]



Text Books:

1. Cormen, Leiserson, Rivest, Stein, Introduction to Algorithms, Prentice Hall of India, 3rd edition

2012.

2. Horowitz, Sahni and Rajasekaran, Fundamentals of Computer Algorithms, University Press (India),

2nd

edition.

Reference Books:

1. Tanenbaum, Augenstein, &Langsam, Data Structures using C and C++, Prentice Hall of India.

2. Brassard, Bratley, Fundamentals of Algorithms, Prentice Hall of India.

3. Knuth The Art of Computer Programming, Volume 1: Fundamental Algorithms (Addison-Wesley,

Third Edition).

4. Lipschutz, S., Data Structures, Schaum's Outline Series, Tata McGraw Hill.

5. Kruse, Data Structures & Program Design, Prentice Hall of India.

6. Aho, Haperoft and Ullman, The Design and analysis of Computer Algorithms, Pearson Education

India.









Software Engineering (CST-302)

L T P Credits

3 1 - 3.5

Total Hours: 48

Course Objectives:

To study and learn various methods of software engineering.

To understand the various phases of software development.

To understand the various testing techniques.

To learn various user interface designs.

UNIT-I

Introduction:Definition of software and Software engineering, Difference between Program and Product,

Software development life cycle, Different life cycle models (waterfall, Iterative waterfall, Prototype,

Evolutionary and Spiral model), Agile software development and Their characteristics .

[6]

Software requirement: Requirement Analysis, Analysis principle, Software prototyping Specification,

Data modeling, Functional modeling and information flow, behavioral modeling, Mechanics of structural

modeling, Data dictionary. [4]

Function and Object oriented design:Structured analysis, Data flow diagrams, Basic object orientation

concepts, Unified modeling language, Unified modeling language, Use case model, Class diagrams,

Interaction diagrams, Activity diagrams, State chart diagrams. [6]

UNIT -II

Software design: Design process and concepts, Effective Modular design, The design model, Design

documentation, Approaches to Software design [4]

Software Project management: Software project planning, Project estimation techniques, COCOMO

Model, Project scheduling, Risk analysis and management, Software quality and management, Staffing,

software configuration management . [7]

User interface Design:Characteristics of good user interface design, Command language user interface,

Menu based, Direct manipulation interfaces, Fundamentals of command based user interface.

[5]

UNIT-III

Software Testing: Testing levels, Activities, Verification and Validation, Unit testing , System testing

Integration testing, Validation testing, Black box and white box testing. [4]



Quality management:Software quality, Software reliability, Software reviews, Formal technical reviews,

Statistical SQA, Software reliability, The ISO 9000 coding standards, SQA plan, SEICMM.

[6]

Software Maintenance and Reuse: Definition, .Types of maintenance, Software reverse engineering,

Different Maintenance models, Basic issue in any reuse program, reuse approach.

[6]

Text Books:

1. Pressman Rogers,Software Engineering: A Practitioner's Approach,Sixth edition. 2. Somerville Ian, Software Engineering, Addison Wesley ,8th Edition.

Reference Books:

1. James FPeters and PedryezWitold, Software Engineering An Engineering Approach, Wiley Student Edition.

2. Kassem , Software Engineering,Cengage Learning.









Simulation and Modeling (CST-303)

L T P Credit

3 - - 3

Total Hours: 48

Course Objectives:

To have a strong foundation on concept of simulation, and modeling.

To understand the techniques of random number generations.

To understand the techniques of testing randomness.

To design simulation models for various case studies like inventory, traffic flow networks, etc.

To practice on simulation tools and aquire knowledge on building simulation systems

UNIT I

Introduction :Systems, modeling, general systems theory, Concept of simulation, Simulation as a

decision making tool, types of simulation. [8]

Random Numbers: Pseudo random numbers, methods of generating random variables, discrete and

continuous distributions, testing of random numbers. [8]

UNIT II

Design Of Simulation Experiments: Problem formulation, data collection and reduction, time flow

mechanism, key variables, logic flow chart, starting condition, run size, experimental design

consideration, output analysis and interpretation validation. [10]

Simulation Languages: Comparison and selection of simulation languages, study of anyone simulation

language. [7]

UNIT III

Case Studies: Development of simulation models using simulation language studied for systems like

queuing systems, Production systems, Inventory systems, maintenance and replacement systems

andInvestment analysis. [15]



Text Books: 1.Seila Andrew F."Applied Simulation Modeling,Cengage Learning. 2.Geoffrey Gordon, System Simulation, 2nd Edition, Prentice Hall, India. 3. NarsinghDeo, System Simulation with Digital Computer, Prentice Hall, India.

Reference Books: 1. Jerry Banks and John S.Carson, Barry L. Nelson, David M.Nicol, Discrete Event System Simulation, 3rd Edition, Prentice Hall, India.

2. Shannon, R.E. Systems simulation, The art and science, Prentice Hall. 3. Thomas J. Schriber,Simulation using GPSS, John Wiley.









Relational Data Base Management Systems (CST-304)

L T P Credit

3 1 - 3.5

Total Hours: 48

Course Objectives:

To have good understanding of database system concepts and design databases for different

applications.

To learn how to use a DBMS and RDBMS.

To implement and understand different types of DDL, DML and DCL statements.

To understand transaction concepts related to databases and recovery/backup techniques required

for the proper storage of data.

UNIT-I

Overview of Databases: Database concepts, DBMS, Data Base System Architecture (Three Level ANSI-

SPARC Architecture), Advantages and Disadvantages of DBMS, Data Independence, DBA and

Responsibilities of DBA, Relational Data Structure, Keys, Relations, Attributes, Schema and Instances,

Referential integrity, Entity integrity. [6]

Data Models: Relational Model, Network Model, Hierarchical Model, ER Model: Design, issues,

Mapping constraints, ER diagram, Comparison of Models. [4]

Relational Algebra & Relational Calculus: Introduction, Syntax, Semantics, Additional operators,

Grouping and Ungrouping, Relational comparisons, Tuple Calculus, Domain Calculus, Calculus Vs

Algebra, Computational capabilities. [6]

UNIT-II

Functional dependencies and Normalization: Functional dependencies, Decomposition, Full

Functional Dependency (FFD), Transitive Dependency (TD), Join Dependency (JD), Multivalued

Dependency (MVD), Normal Forms (1NF, 2NF, 3NF, BCNF), Denormalization. [8]

Database Security: Introduction, Threats, Counter Measures. [2]

Control Structures: Introduction to conditional control, Iterative control and sequential control

statements, Cursors, Views. [6]

UNIT-III

Package, Procedures and Triggers: Parts of procedures, Parameter modes, Advantages of procedures,

Syntax for creating triggers, Types of triggers, package specification and package body, developing a

package, Bodiless package, Advantages of packages. [6]



Transaction Management and Concurrency Control: Introduction to Transaction Processing,

Properties of Transactions, Serializability and Recoverability, Need for Concurrency Control, Locking

Techniques, Time Stamping Methods, Optimistic Techniques and Granularity of Data items.

[7]

Database Recovery of database: Introduction, Need for Recovery, Types of errors, Recovery

Techniques. [3]

Text Books:

1. RamezElmasri and Shamkant B. Navathe, Fundamentals of Database System, The Benjamin /

Cummings Publishing Co.

2. Korth and Silberschatz Abraham, Database System Concepts, McGraw Hall.

3. Pratt, DBMS, Cengage Learning.

Reference Books:

1. C.J.Date, An Introduction to Database Systems, Addison Wesley.

2. Thomas M. Connolly, Carolyn & E. Begg, Database Systems: A Practical Approach to Design,

Implementation and Management, 5/E, University of Paisley, Addison-Wesley.

3. Rob, Database Principal Fundamental Design, Cengage Learning.









Wireless Networks (CST-305)

L T P Credit

3- - 3

Total Hours: 48

Course Objectives:

To familiarize with evolution, deployment and implementation of wireless networks

To critically examine existing and emerging wireless networks technologies.

To learn and analyze various IEEE standards for wireless telecommunications.

UNIT I

Introduction: History & evolution of wireless communication, Examples of wireless communication,

IEEE standards for wireless. , Overview of Existing Network Infrastructure, Review of Seven- Layer

OSI Model, Wireless Network Applications: Wireless Markets, Future Wireless Networks.

[5]

Evolution and Deployment of Cellular Telephone Systems: Different Generation of Wireless Cellular

Networks, 1G Cellular Systems,2G Cellular Systems, 2.5G Cellular Systems, 3G Cellular Systems, 4G

Cellular Systems and Beyond, Wireless Standards Organizations. [6]

Common Cellular System Components: Common Cellular Network Components, Hardware and

Software Views of the Cellular Network, 3G Cellular System Components, Cellular Component

Identification, Call Establishment. [5]

UNIT-II

.

Wireless Network Architecture and Operation: The Cellular Concept, Cell Fundamentals, Capacity

Expansion Techniques, Cellular Backhaul Networks, Mobility Management, Radio Resources and Power

Management, Wireless Network Security. [6]

GSM and CDMA Technology: Introduction to GSM, TDMA and CDMA, GSM Network and System

Architecture, GSM Channel [4]

Wireless Modulation Techniques And Hardware: Transmission Characteristics of Wireline and Fiber

Systems, Air Interface, Wireless Coding Techniques, Digital Modulation Techniques, Ultra-Wide Band

Radio Technology, GSM System Hardware, CDMA System Hardware [6]



UNIT-III

Wireless LAN/IEEE 802.11x: Introduction to WLAN, Evolution, Design Issues, Layer Operation,

wireless LAN security, Competing wireless technologies, typical WLAN hardware [5]

Wireless PANs : WPAN IEEE 802.15x Technologies, Wireless PAN Application and Architecture,

Bluetooth Link Controller Basics, Operational States, IEEE 802.15.1 Protocols, Evolution of IEEE

802.15 Standards. [6]

Broadband Wireless MANs: Introduction, IEEE 802.16 Wireless MANs, MAC Layers Physical Layer,

Common System Operations,Introduction to Emerging Wireless Technologies

[5]

Text Books:

1. Mullet,Wireless Telecommunication Systems & Networks,Cengage learning.

2. Theodre S. Rappaport, Wireless communication:Principles&Practices,Pearson.

Reference Books:

1. Behrouz A Forouzan , Data Communications & Networking , TMH.

2. Stallings William, Wireless Communication and Networks, Pearson Education Ltd.









Simulation and Modeling Lab (CSP-306)

L T P Credit

- - 2

1

Course Objectives:

To learn use of MATLAB simulator with various exercises

To implement Real time applications using MatLab simulator.

UNIT I

1. Write a statement to evaluate each of common mathematical expressions like Square, squareroot,

Sine, cosine functions.

2. Write a statement that converts temperature in Fahrenheit, f, to Celsius, c

3. Write a program to create a vector containing the rst n Fibonacci numbers.

4. Use the Matlab function isprime to discover which of the rst 40 Fibonacci numbers are prime.

UNIT II

5. Calculate the day of the week when you were born using Calendar function.

6. Generate an m-by-n matrix with random entries between 0 and 1 using Matlab function rand(m,n)

7. Write code for PerformingVector-matrix multiplication.

8. Write code for Performing arithmetic operations on Matrices.

UNIT III

9. Using geometry, trigonometry and arithmetic with complex numbers, arrange the four pieces to

form the capital Tshape.

10. Write code to design Tic Tac Toe game.

11. Write statements to implement Sudoku Game.




Software Engineering Lab (CSP-307) LT P Credits

- - 4 2

Course Objectives:

To study and draw different level DFD and charts.

To study and design models using UML modeling objects

UNIT I 1. To draw a different level DFD.

2. To draw a ER diagram.

3. To draw a case diagrams.

UNIT II 4. To draw a sequence diagrams..

5.To draw a class diagrams .

6. To draw a collaboration diagrams .

UNIT III 7. To draw Gantt chart and network diagram. 8.To draw a structured chat




Relational Database Management Systems Lab (CSP-308)

L T P Credits

- - 4 2

Course Objectives:

To enable students to retrieve and update data from relational databases.

To implement programs using procedural language structure.

To have good understanding of implementation and use of cursors, procedures, packages,

triggers etc.

UNIT-I

1. To implement different types of DDL, DML, DCL queries.

2. To explore SELECT clause using where, order by, between, like, group by, having etc.

UNIT-II

3. Introduction and implementation of programs using

a. Block Structure and Variables b. To write programs using control structures of

i. If-else statements.

c. To write programs using loops like

i. For

ii. Do-while

iii. while

d. Cursors e. Views

UNIT-III

4. Introduction and implementation of programs of

a. Procedures b. Packages c. Triggers




GHARUAN

Scheme & Syllabus of B.E. Computer Science &Engineering [CSE]

6thSemester



CHANDIGARH UNIVERSITY GHARUAN

Theory of Computation (CST-321) L T P Credit 3 1 - 3.5

Total Hours: 48

Course Objectives:

To understand the concept of formal languages and their relation with finite automata.

To study and design different finite automata.

To study context free grammars and ambiguity related issues.

To gain familiarization with Push- Down Automata and Turing Machines.

To explore relationship between different classes of formal languages.

UNIT -I

Introduction: Basic Terminology: Alphabet, Formal Language and operations on formal languages,

Examples of formal languages. [4]

Finite automata : Concept of Basic Machines, Properties and Limitations of Finite State Machines,

Deterministic Finite Automata(DFA),Non-Deterministic Finite Automata(NFA),Equivalence of DFA and

NDFA , Non-Deterministic Finite automata with -Transitions. [7]

Regular expression: Regular Languages and Regular Expressions, Kleens Theorem. Ardens Method. [5]

UNIT II

Properties of Regular sets: The Pumping Lemma for Regular sets, Application of the Pumping Lemma,

Closure Properties of Regular Sets,Myhill- Nerode Theorem and Minimization of Finite Automata,

Minimization Algorithm. [6]

Finite Automata with output : Moore and Mealy Machines. Equivalence of Moore and Mealy

Machines. [4]

Context Free Grammars: Examples and Definitions, Derivation trees and ambiguity, An Unambiguous

CFG for Algebraic Expressions. Regular Grammar, Simplified forms and Normal forms: Removal of

useless symbols and unit production, Removal of -moves, Chomsky Normal Form (CNF), Griebach Normal Form (GNF). [7]

UNIT-III

Pushdown Automata : Introduction and Definition of Push-Down Automaton , Applications of Push

Down Automata. [4]



Turing Machines: Definitions and Examples, Deterministic and Non- Deterministic Turing Machines,

Unsolvable Problems: A Nonrecursive Language and an Unsolvable Problem, PCP Problem and MPCP

Problem. [6]

More General Languages and Grammars: Recursively Enumerable and Recursive Languages,

Unrestricted grammars, Context sensitive Language and grammar. Relation between languages of classes,

Chomsky hierarchies of grammars. [5]

Text Books:

1. Martin J.C., Introduction to Languages and Theory of Computation, Tata McGraw-Hill

Publising Company Limited, 3rd

Edition.

2. Hopcroft J.E. and Ullman J.D., Introduction to Automata Theory Languages and Computation,

Narosa Publications.

Reference Books:

1. Sipser, Theory Of Computation ,Cengage Learning.

2. Daniel I.A. Cohen, Introduction to computer Theory, John Wiley.









Software Project Management (CST-322) L T P Credit

3 - - 3

Total Hours: 48

Course Objectives:

To study software planning and scheduling methods.

To detail various software auditing and testing techniques.

To learn about Risk analysis and management.

To study software quality concepts and standards.

UNIT-I

Introduction to Project Management:The characteristics of software projects, Objectives of project

management: time, cost and quality, Basics of Project Management, Stakeholders, Stages of Project, The

Feasibility Study, Cost-benefit Analysis, Planning, Project Execution, Project and Product Life Cycles,

Project Management Knowledge areas, Project Management Tools & Techniques, Project success factors,

role of project manager. [5]

Project Management & Planning:System view of project management, Understanding organizations,

stakeholders management, project phases & project life cycles. Why planning is necessary, Iterative steps for planning, Project Plan documentation methods, Software Requirement Specification.

[4]

Measurement and Control: Measurements for project Monitoring, what and when to measure, Plan

versus Control, managing the plan, The Deadline Effect. Reviews, feedback and reporting mechanisms,

revisiting the plan. [4]

Project Scope Management:Scope Planning & Scope management plans, Function point calculation,

Scope definitions & project scope statement, Work Breakdown Structure (WBS), WBS dictionary, scope

verification, scope control. [4]

UNIT-II

Time Management:Project time management, activities sequencing, network diagrams, activity recourse

estimation, activity duration estimation, schedule development, Gantt Charts, Critical path

method,Programme evaluation & review technique (PERT) and CPM, concept of slack time, schedule

control. [4]

Project Cost management:Basis principl

be syllabus chandigarh university

Documents

cse scheme

leet cse

subject code subject

software engineering

modeling lab

gharuan scheme

scheme syllabus

digital electronics