Computer Science 190815


Download Computer Science 190815


Preview text

UTTAR PRADESH TECHNICAL UNIVERSITY LUCKNOW
SYLLABUS Bachelor of Computer Science & Engineering
& Bachelor of Computer Science & Information
Technology
rd
3 Year (V & VI Semester)
(Effective from Session: 2015-2016)

U.P. TECHNICAL UNIVERSITY, LUCKNOW

STUDY EVALUATION SCHEME

B. TECH. COMPUTER SCIENCE & ENGINEERING &
B. TECH. COMPUTER SCIENCE AND INFORMATION TECHNOLOGY

YEAR THIRD, SEMESTER –V (Effective from the session: 2015-16)

S. Course Subject No Code .

Periods L TP

THEORY SUBJECT

1 NCS Design and Analysis of 3 1 0

501 Algorithm

2 NCS Database Management 3 1 0

502 System

3 NCS Principle of

3 10

503 Programming Language

4 NCS Web Technology

3 10

504

5 NCS Computer Architecture 2 1 0

505

6 NHU5 Engineering Economics 2 0 0

01

PRACTICAL/DESIGN/DRAWING

7 NCS Design and Analysis of 0 0 3

551 Algorithm Lab

8 NCS DBMS Lab

0 03

552

9 NCS Principle of

0 02

553 Programming Language

10 NCS Web Technology Lab 0 0 2

554

11 NGP GP

501

TOTAL

16 5 10

Evaluation Scheme
Sessional Exam ESE CT TA Total 30 20 50 100 30 20 50 100 30 20 50 100 30 20 50 100 15 10 25 50 15 10 25 50
10 10 20 30 10 10 20 30 10 10 20 30 10 10 20 30
50

Subject Credit Total

150 4

150 4

150 4

150 4

75

3

75

2

50

1

50

1

50

1

50

1

50

1000 25

STUDY EVALUATION SCHEME

B. TECH. COMPUTER SCIENCE & ENGINEERING &
B. TECH. COMPUTER SCIENCE AND INFORMATION TECHNOLOGY

YEAR THIRD, SEMESTER –VI (Effective from the session : 2015-16)

S. Course Subject No Code .

Periods L TP

THEORY SUBJECT

1 NCS Computer Networks 3 1 0

601

2 NCS Software Engineering 3 1 0

602

3 NCS Compiler Design

3 10

603

4

Departmental Elective-I 3 1 0

5

Departmental Elective-II 2 1 0

6 NHU Industrial Management 2 0 0

601

PRACTICAL/DESIGN/DRAWING

7 NCS Computer Networks Lab 0 0 3

651

8 NCS Software Engineering 0 0 3

652 Lab

9 NCS Compiler Design Lab 0 0 2

653

10 NCS SEMINAR

0 02

654

11 NGP GP

601

TOTAL

16 5 10

Departmental Elective-I

Evaluation Scheme
Sessional Exam ESE CT TA Total 30 20 50 100 30 20 50 100 30 20 50 100 30 20 50 100 15 10 25 50 15 10 25 50
10 10 20 30 10 10 20 30 10 10 20 30
50 50 50

Subject Credit Total

150 4

150 4

150 4

150 4

75

3

75

2

50

1

50

1

50

1

50

1

50

1000 25

1. NCS 061: Computational Geometry 2. NCS 062: Complexity Theory 3. NCS 063: Parallel Algorithm 4. NCS 064: Approximation & Randomized Algorithm 5. NCS 065: Concurrent System

Departmental Elective-II 1. NCS 066: Data Warehousing & Data Mining 2. NCS 067: Distributed Database 3. NCS 068: E‐Commerce 4. NCS 069: Advance DBMS 5. NCS 070: Human Computer Interface

NCS- 501 Design and Analysis of Algorithms

Unit

Topic

I. Introduction : Algorithms, Analyzing algorithms, Complexity of algorithms, Growth of functions, Performance measurements, Sorting and order Statistics - Shell sort, Quick sort, Merge sort, Heap sort, Comparison of sorting algorithms, Sorting in linear time.
II. Advanced Data Structures: Red-Black trees, B – trees, Binomial Heaps, Fibonacci Heaps.

31 0 Proposed Lectures
8
8

III. Divide and Conquer with examples such as Sorting, Matrix Multiplication, Convex

8

hull and Searching.

Greedy methods with examples such as Optimal Reliability Allocation, Knapsack,

Minimum Spanning trees – Prim’s and Kruskal’s algorithms, Single source shortest

paths - Dijkstra’s and Bellman Ford algorithms.

IV. Dynamic programming with examples such as Knapsack.

8

All pair shortest paths – Warshal’s and Floyd’s algorithms, Resource allocation

problem.

Backtracking, Branch and Bound with examples such as Travelling

Salesman Problem, Graph Coloring, n-Queen Problem, Hamiltonian Cycles

and Sum of subsets.

V. Selected Topics: Algebraic Computation, Fast Fourier Transform, String Matching,

8

Theory of NP-completeness, Approximation algorithms and Randomized algorithms.

Text books: 1. Thomas H. Coreman, Charles E. Leiserson and Ronald L. Rivest, “Introduction to Algorithms”, Printice Hall of India. 2. E. Horowitz & S Sahni, "Fundamentals of Computer Algorithms", 3. Aho, Hopcraft, Ullman, “The Design and Analysis of Computer Algorithms” Pearson Education, 2008.
References:
1. Jon Kleinberg and Éva Tardos, Algorithm Design, Pearson, 2005. 2. Michael T Goodrich and Roberto Tamassia, Algorithm Design: Foundations, Analysis, and
Internet Examples, Second Edition, Wiley, 2006. 3. Harry R. Lewis and Larry Denenberg, Data Structures and Their Algorithms, Harper Collins, 1997 4. Robert Sedgewick and Kevin Wayne, Algorithms, fourth edition, Addison Wesley, 2011. 5. Harsh Bhasin,”Algorithm Design and Analysis”,First Edition,Oxford University Press. 6. Gilles Brassard and Paul Bratley,Algorithmics:Theory and Practice,Prentice Hall,1995.

NCS-502 Database Management System

31 0

Unit

Topic

I. Introduction: An overview of database management system, database system Vs file system, Database system concept and architecture, data model schema and instances, data independence and database language and interfaces, data definitions language, DML, Overall Database Structure. Data Modeling using the Entity Relationship Model: ER model concepts, notation for ER diagram, mapping constraints, keys, Concepts of Super Key, candidate key, primary key,
Generalization, aggregation, reduction of an ER diagrams to tables, extended ER model,
relationship of higher degree.

Proposed
Lectures 8

II. Relational data Model and Language: Relational data model concepts, integrity

8

constraints, entity integrity, referential integrity, Keys constraints, Domain constraints,

relational algebra, relational calculus, tuple and domain calculus.

Introduction on SQL: Characteristics of SQL, advantage of SQL. SQl data type and literals.

Types of SQL commands. SQL operators and their procedure. Tables, views and indexes.

Queries and sub queries. Aggregate functions. Insert, update and delete operations, Joins,

Unions, Intersection, Minus, Cursors, Triggers, Procedures in SQL/PL SQL

III. Data Base Design & Normalization: Functional dependencies, normal forms, first, second,

8

third normal forms, BCNF, inclusion dependence, loss less join decompositions,

normalization using FD, MVD, and JDs, alternative approaches to database design.

IV. Transaction Processing Concept: Transaction system, Testing of serializability,

8

serializability of schedules, conflict & view serializable schedule, recoverability, Recovery

from transaction failures, log based recovery, checkpoints, deadlock handling.

Distributed Database: distributed data storage, concurrency control, directory system.

V. Concurrency Control Techniques: Concurrency control, Locking Techniques for

8

concurrency control, Time stamping protocols for concurrency control, validation based

protocol, multiple granularity, Multi version schemes, Recovery with concurrent transaction,

case study of Oracle.

Text books:

1.Korth, Silbertz, Sudarshan,” Database Concepts”, McGraw Hill 2.Date C J, “ An Introduction to Database Systems”, Addision Wesley
3. Elmasri, Navathe, “ Fudamentals of Database Systems”, Addision Wesley 4. O’Neil, Databases, Elsevier Pub.

References:

1.Leon & Leon,”Database Management Systems”, Vikas Publishing House 2.Bipin C. Desai, “ An Introduction to Database Systems”, Gagotia Publications 3. Majumdar & Bhattacharya, “Database Management System”, TMH

NCS- 503 Principle of Programming Language

Unit

Topic

31 0 Proposed

Lectures

I. Introduction

8

The Role of Programming Languages: Why Study Programming Languages,

Towards Higher-Level languages, Programming paradigms, Programming

environments

Language Description: Syntactic structure, language Translation Issues: Programming

language Syntax, Stages in translation, Formal translation Models

II. Language Properties

8

Modeling Language Properties, Elementary Data Types, Encapsulation, Inheritance,

Sequence Control, Subprogram Control

III. Programming Paradigms

8

Imperative Programming: Statements, Types, Procedure Activations Object-Oriented Programming: Grouping Of Data and Operations, object oriented

programming

Functional Programming: Elements, Programming in a Typed language, Programming

with lists

IV. Other Programming Paradigms

8

Logic Programming, Concurrent Programming, Network Programming , Language

Description: Semantic Methods

V. Lambda Calculus

8

Introduction to Lambda Calculus, Simple types, Subtyping

Text books:

1. “Programming Languages: Design and Implementations” , Terrance W.Pratt, Marvin V. Zelkowitz, T.V.Gopal,Fourth ed.,Prentice Hall

2. “Programming Language Design Concept”, David A. Watt, Willey India 3. “Programming languages: Concepts and Constucts”, Ravi Sethi, Second Ed.,Pearson.

4. “Types and programming Languages”, Benjamin C. Pierce. The MIT Press Cambridge,

Massachusetts London, England

References: th
1. Concepts of Programming Languages, Robert W. Sebesta, 10 Ed.,Pearson

NCS- 504 Web Technology

3 1 0

Unit

Topic

Proposed

I. Introduction:

Lectures 8

Introduction and Web Development Strategies, History of Web and Internet,

Protocols governing Web, Writing Web Projects, Connecting to Internet,

Introduction to Internet services and tools, Introduction to client-server

computing.

Core Java: Introduction, Operator, Data type, Variable, Arrays, Methods &

Classes, Inheritance, Package and Interface, Exception Handling, Multithread

programming, I/O, Java Applet, String handling, Event handling, Introduction to

AWT, AWT controls, Layout managers.

II. Web Page Designing:

8

HTML: list, table, images, frames, forms, CSS, Document type definition, XML:

DTD, XML schemes, Object Models, presenting and using XML, Using XML

Processors: DOM and SAX, Dynamic HTML.

III. Scripting:

8

Java script: Introduction, documents, forms, statements, functions, objects;

introduction to AJAX, VB Script, Introduction to Java Beans, Advantage,

Properties, BDK, Introduction to EJB, Java Beans API.

IV Server Site Programming:

8

. Introduction to active server pages (ASP), Introduction to Java Server Page

(JSP), JSP Application Design, JSP objects, Conditional Processing, Declaring

variables and methods, Sharing data between JSP pages, Sharing Session and

Application Data, Database Programming using JDBC, development of java

beans in JSP, Introduction to Servelets, Lifecycle, JSDK, Servlet API, Servlet

Packages, Introduction to COM/DCOM/CORBA.

V. PHP (Hypertext Preprocessor):

8

Introduction, syntax, variables, strings, operators, if-else, loop, switch, array,

function, form, mail, file upload, session, error, exception, filter, PHP-ODBC, Text books:

1. Burdman, Jessica, “Collaborative Web Development” Addison Wesley

2. Xavier, C, “ Web Technology and Design” , New Age International

3. Ivan Bayross,” HTML, DHTML, Java Script, Perl & CGI”, BPB Publication

4. Bhave, “Programming with Java”, Pearson Education

5. Herbert Schieldt, “The Complete Reference:Java”, TMH. 6. Hans Bergsten, “Java Server Pages”,

SPD O’Reilly

6. Ullman, “PHP for the Web: Visual QuickStart Guide”, Pearson Education

7. Margaret Levine Young, “The Complete Reference Internet”, TMH

8. Naughton, Schildt, “The Complete Reference JAVA2”, TMH

9. Balagurusamy E, “Programming in JAVA”, TMH

References:
1. Ramesh Bangia, “Internet and Web Design” , New Age International 2. Ivan Bayross,” HTML, DHTML, Java Script, Perl & CGI”, BPB Publication 3. Deitel, “Java for programmers”, Pearson Education 4. Chris Bates, “Web Programing Building Internet Applications”, 2nd Edition, WILEY, Dreamtech
5. Joel Sklar , “Principal of web Design” Vikash and Thomas Learning
6. Horstmann, “CoreJava”, Addison Wesley

NCS- 505 Computer Architecture

Unit

Topic

2 1 0 Proposed

Lectures

I Introduction:. Digital computer generation, computer types and classifications,

8

functional units and their interconnections, buses, bus architecture, types of buses and

bus arbitration. Register, bus and memory transfer.

Central Processing Unit: Addition and subtraction of signed numbers, look ahead carry adders. Multiplication: Signed operand multiplication, Booths algorithm and array multiplier. Division and logic operations. Floating point arithmetic operation Processor organization, general register organization, stack organization and addressing modes.

II Control Unit: Instruction types, formats, instruction cycles and subcycles ( fetch and

8

execute etc) , micro-operations, execution of a complete instruction. Hardwire and

microprogrammed control: microprogramme sequencing, wide branch addressing,

microinstruction with next address field, pre-fetching microinstructions, concept of

horizontal and vertical microprogramming.

III Memory: Basic concept and hierarchy, semiconductor RAM memories, 2D & 2 1/2D

8

memory organization. ROM memories. Cache memories: concept and design issues 9

performance, address mapping and replacement) Auxiliary memories: magnetic disk,

magnetic tape and optical disks Virtual memory: concept implementation.

IV Input / Output: Peripheral devices, I/O interface, I/O ports, Interrupts: interrupt

8

hardware, types of interrupts and exceptions. Modes of Data Transfer: Programmed

I/O, interrupt initiated I/O and Direct Memory Access., I/O channels and processors.

Serial Communication: Synchronous & asynchronous communication, standard

communication interfaces.

TEXT BOOK:
1. Carl Hamacher, Zvonko Vranesic and Safwat Zaky, “Computer Organization”, Fifth Edition, Tata McGraw Hill, 2002. 2. William Stallings, “Computer Organization and Architecture – Designing for Performance”, Sixth Edition, Pearson Education, 2003. REFRENCE BOOKS:1. Patterson, Computer Organisation and Design, Elsevier Pub. 2009 2. Vravice,Hamacher & Zaky, “Computer Organization”, TMH 3. Mano,” Computer System Architecture”, PHI 4. John P Hays, “ Computer Organization”, McGraw Hill
5. Tannenbaum,” Structured Computer Organization’, PHI 6.
P Pal chaudhry, ‘ Computer Organization & Design’, PHI

NCS 551 Design and analysis of algorithms Lab
Objective :1. Program for Recursive Binary & Linear Search. 2. Program for Heap Sort. 3. Program for Merge Sort. 4. Program for Selection Sort. 5. Program for Insertion Sort. 6. Program for Quick Sort.
7.Study of NP-Complete theory.
8.Study of Cook’s theorem.
9.Study of Sorting network.

NCS 552 DBMS Lab
Objectives:1. Installing oracle. 2. Creating Entity-Relationship Diagram using case tools. 3. Writing SQL statements Using ORACLE
/MYSQL: a)Writing basic SQL SELECT statements. b)Restricting and sorting data. c)Displaying data from multiple tables. d)Aggregating data using group function. e)Manipulating data. e)Creating and managing tables. 4. Normalization in ORACLE. 5. Creating cursor in oracle. 6. Creating procedure and functions in oracle. 7. Creating packages and triggers in oracle.

NCS 553 Principles of programming languages

1. Define a LISP function to compute sum of squares.

2 2

2 2

2. Define a LISP function to compute difference of squares. (if x > y return x -y , otherwise y - x )

3. Define a Recursive LISP function to solve Ackermann’s Function.

4. Define a Recursive LISP function to compute factorial of a given number.

5. Define a Recursive LISP function which takes one argument as a list and returns last element of

the list. (do not use last predicate)

6. Define a Recursive LISP function which takes one argument as a list and returns a list except last

element of the list. (do not use but last predicate)

7. Define a Recursive LISP function which takes one argument as a list and returns reverse of the

list. (do not use reverse predicate)

8. Define a Recursive LISP function which takes two arguments first, an atom, second, a list, returns a

list after removing first occurrence of that atom within the list.

NCS 554 Web Technology Lab
Objectives:1. Write HTML/Java scripts to display your CV in navigator, your Institute website, Department Website and Tutorial website for specific subject 2. Design HTML form for keeping student record and validate it using Java script. 3. Write an HTML program to design an entry form of student details and send it to store at database server like SQL, Oracle or MS Access. 4. Write programs using Java script for Web Page to display browsers information. 5. Write a Java applet to display the Application Program screen i.e. calculator and other. 6. Writing program in XML for creation of DTD, which specifies set of rules. Create a style sheet in CSS/ XSL & display the document in internet explorer. 7. Using ASP for server side programming, ASP for user name and password and to retrieve & match the value. It display success and failure messages. ASP for creating text file local drive, ASP for keeping the student record in database. 8. Program to illustrate JDBC connectivity. Program for maintaining database by sending queries. Design and implement a simple servlet book query with the help of JDBC & SQL. Create MS Access Database, Create on ODBC link, Compile & execute JAVA JDVC Socket. 9. Design and implement a simple shopping cart example with session tracking API.

Preparing to load PDF file. please wait...

0 of 0
100%
Computer Science 190815