D E P A R T M E N T O F C O M P U T E R S C I E N C E J.R .N . R … · 2018-06-08 · Write a C++...

DEPARTMENT OF COMPUTER SCIENCE

J.R.N. Rajasthan Vidyapeeth (Deemed to be University),

Udaipur (Raj.)

SYLLABUS OF

B.Sc. (COMPUTER SCIENCE) Session 2017-18 onwards

CHOICE BASED CREDIT SYSTEM

1

SEMESTER COURSE OPTED COURSE NAME Credits I Ability Enhancement Compulsory

Course-I English/MIL communications/ Environmental Science

2

Core course-I Mechanics 4 Core Course-I Practical/Tutorial Mechanics Lab 2 Core course-II Differential Calculus 6 Core Course-III Object Oriented Programming in

C++ 6

II Ability Enhancement Compulsory Course-II

English/MIL communications/ Environmental Science

2

Core course-IV Electricity, Magnetism and EMT 4 Core Course-IV Practical/Tutorial Electricity, Magnetism and EMT

Lab 2

Core course-V Differential Equations 6 Core Course-VI Data Structures and File Processing 6

III Core course-VII Thermal Physics and Statistical Mechanics

4

Core Course-VII Practical/Tutorial Thermal Physics and Statistical Mechanics Lab

2

Core course-VIII Real Analysis 6 Core Course-IX Numerical Computing 6 Skill Enhancement Course -1 SEC-1 2

IV Core course-X Waves and Optics 4 Course-X Practical/Tutorial Waves and Optics Lab 2 Core course-XI Algebra 6 Core course-XII Design and Analysis of Algorithms 6 Skill Enhancement Course -2 SEC -2 2

V Skill Enhancement Course -3 SEC -3 2 Discipline Specific Elective -1 DSE-1A 6 Discipline Specific Elective -2 DSE-2A 6 Discipline Specific Elective -3 DSE-3A 6

VI Skill Enhancement Course -4 SEC -4 2 Discipline Specific Elective -4 DSE-1B 6 Discipline Specific Elective -5 DSE-2B 6 Discipline Specific Elective-6 DSE-3B 6

Total Credits

120

2

DEPARTMENT OF COMPUTER SCIENCE J.R.N. Rajasthan Vidyapeeth (Deemed to be University), Udaipur (Raj.)

B.Sc. I Semester (CBCS) Session 2017-18 onwards

The examination shall consist of one theory paper and one practical.

S. No.

Paper Code

CC/DSE/

SEC Title

Hrs./week

Internal Exam.

External Exam. Total Credit Max.

marks Max.

marks 1 BSC-10

6 CC Object Oriented

Programming in C++

4 30 70 100 4

2 BSC-107

CC Practical 4 - 50 50 2

Note:

● CC - Core Course

4

B.Sc. Computer Science (CBCS) Programme SEMESTER I

PAPER – I

Object Oriented Programming in C++

Time: 3 Hrs. Max. Marks - 70

Note: The Paper will be divided into THREE sections.

Section A: Ten questions (short type answer) two from each Unit will be asked. Each question will be of one mark and the candidates are required to attempt all questions.

Total 10 Marks

Section B: Five questions (answer not exceeding 250 words) one from each Unit with internal choice will be asked and the candidates are required to attempt all questions. Each question will be of 6 marks.

Total 30 Marks

Section C: Four questions may be in parts covering all the five Units (answer not exceeding 500 words) will be asked. The candidates are required to attempt any TWO questions. Each question will be of 15 marks.

Total 30 marks

Unit-I

Programming Concepts: Algorithm and its characteristics, pseudo code / flow chart, program, identifiers, variables, constants, primitive data types, expressions, structured data types, arrays, compilers and interpreters.

Unit-II

Statements: Assignment statement, if then else statements, switch statement, looping statements- while, do while, for, break, continue, input/output statements, functions/procedures. Object Oriented Concepts: Abstraction, encapsulation, objects, classes, methods, constructors, inheritance, polymorphism, static and dynamic binding, overloading.

Unit-III

Program Development: Object oriented analysis, design, unit testing & debugging, system testing & integration, maintenance. Introduction to structured programming: data types- simple data types, floating data types, character data types, string data types,

5

arithmetic operators and operator precedence, variables and constant declarations, expressions, input using the extraction operator >> and cin, output using the insertion operator << and cout, preprocessor directives, increment (++) and decrement operations (--), creating a C++ program, input/output, relational operators, logical operators.

Unit-IV

Logical expressions, if and if … else statement, switch and break statements, ―for‖, ―while‖ and ―do – while‖ loops, break and continue statement, nested control statement, value returning functions, void functions, value versus reference parameters.

Unit-V

Local and global variables, static and automatic variables, enumeration type, one dimensional array, two dimensional array, character array, pointer data and pointer variables.

Books Recommended

1. Richard Johnson, An Introduction to Object-Oriented Application Development, Thomson Learning, 2006

2. B. Stroupstrup, The C++ Programming Language, Addison Wesley, 2004.

6

B.Sc. Computer Science (CBCS) Programme

SEMESTER I

PRACTICAL : Object Oriented Programming in C++ Lab

● Write a C++ program for print Hello World

● Write a C++ program for addition of two numbers

● Write a C++ program for find area and circumference of circle

● Write a C++ program for find area of triangle

● Write a C++ program for find simple interest

● Write a C++ program for check number is even or odd

● Write a C++ program for find greatest number among three numbers

● Write a C++ program for print counting

● Write a C++ program for print table of given number

● Write a C++ program for find factorial of given number

● Write a C++ program for print Fibonacci series

● Write a C++ program for marksheet

● Write a C++ program for implementation of simple class

● Write a C++ program for this pointer

● Write a C++ program for constructor

● Write a C++ program for copy constructor

● Write a C++ program for destructor

● Write a C++ program for friend function

● Write a C++ program for single inheritance

● Write a C++ program for multiple inheritance

● Write a C++ program for multilevel inheritance

● Write a C++ program for virtual base class

● Write a C++ program for Method Overloading

● Write a C++ program for Method Overriding

● Write a C++ program for virtual function

7

● Write a C++ program for exception handling

● Write a C++ program for class template

● Write a C++ program for function template

● Write a C++ program for file handling


B.Sc. II Semester (CBCS) Session 2017-18 onwards


S. No

.

Paper Code

CC/DSE/

SEC Title

Hrs./week

Internal Exam.


marks Max.

marks 1 BSC-206 CC Data Structures

and File Processing

4 30 70 100 4

2 BSC-207 CC Practical 4 - 50 50 2

Note:


8

B.Sc. Computer Science (CBCS) Programme SEMESTER II

PAPER – I

Data Structures and File Processing




Total 10 Marks


Total 30 Marks


Total 30 marks

Unit-I

Basic Data Structures: Abstract data structures- stacks, queues, linked lists and binary trees. Sets: Dictionary implementation, use of priority queues, hashing, binary trees, balanced trees, sets with merge-find operations.

Unit-II

Searching: Internal and external searching, use of hashing and balancing techniques.

Unit-III

Memory Management: Garbage collection algorithms for equal sized blocks, storage allocation for objects with mixed size, buddy systems.

Unit-IV

Physical Devices: Characteristics of storage devices such as disks and tapes, I/O buffering. Basic File System Operations: Create, open, close, extend, delete, read- block, write-block, protection mechanisms.

9

Unit-V

File Organizations: Sequential, indexed sequential, direct, inverted, multi-list, directory systems, Indexing using B-tree, B+ tree and their variants, hashing – hash function, collision handling methods, extendible hashing.

Books Recommended

1. M.T. Goodrich, R. Tamassia and D. Mount, Data Structures and Algorithms in C++, John Wiley and Sons, Inc., 2004.

2. T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein, Introduction to Algorithms, 2nd Ed., Prentice-Hall of India, 2006.

3. Robert L. Kruse and A.J. Ryba, Data Structures and Program Design in C++, Prentice Hall, Inc., NJ, 1998.

4. B. Stroupstrup, The C++ Programming Language, Addison Wesley, 2004

5. D.E. Knuth, Fundamental Algorithms (Vol. I), Addison Wesley, 1997

10

B.Sc. Computer Science (CBCS) Programme SEMESTER II

PRACTICAL : Data Structures and File Processing Lab

● Write a C program that uses functions to perform the following: a) Create a singly linked list of integers. b) Delete a given integer from the above linked list. c) Display the contents of the above list after deletion.

● Write a C program that uses functions to perform the following: a) Create a doubly linked list of integers. b) Delete a given integer from the above doubly linked list. c) Display the contents of

the above list after deletion.

● Write a C program that uses stack operations to convert a given infix expression into its postfix Equivalent, Implement the stack using an array.

● Write C programs to implement a double ended queue ADT using

i) array and ii) doubly linked list respectively.

● Write a C program that uses functions to perform the following: a) Create a binary search tree of characters. b) Traverse the above Binary search tree recursively in Postorder.

● Write a C program that uses functions to perform the following: a) Create a binary search tree of integers. b) Traverse the above Binary search tree non recursively in inorder.

● Write C programs for implementing the following sorting methods to arrange a list of integers in ascending order:

a) Insertion sort b) Merge sort

● Write C programs for implementing the following sorting methods to arrange a list of integers in ascending order:

11

a) Quick sort b) Selection sort

● Write a C program to perform the following operation: A) Insertion into a B-tree

● Write a C program for implementing Heap sort algorithm for sorting a given list of integers in ascending order.

● Write a C program to implement all the functions of a dictionary (ADT) using

hashing.

● Write C programs for implementing the following graph traversal algorithms: a)Depth first traversal b)Breadth first traversal


B.Sc. III Semester (CBCS) Session 2018-2019 onwards

The examination shall consist of one theory paper and two practicals.

S. No

.

Paper Code

CC/DSE/

SEC Title

Hrs./week

Internal Exam.


marks Max.

marks 1 BSC-306 CC Numerical

Computing 4 30 70 100 4


3 BSC-317 SEC Practical

HTML Programming

4 - 50 50 2

Note:


● SEC - Skill Enhancement Course

12

B.Sc. Computer Science (CBCS) Programme SEMESTER III

PAPER – I

Numerical Computing




Total 10 Marks


Total 30 Marks


Total 30 marks

Unit-I

Solution to Transcendental and Polynomial Equations: Iterative methods, bisection method, secant method, Newton-Raphson method, fixed point iteration, methods for

13

finding complex roots.

Unit-II

Matrices and Linear System of Equations: LU decomposition method for solving systems of equations, Symmetric positive definite matrices and least square approximation, iterative algorithms for linear equations.

Unit-III

Interpolation: Polynomial interpolation, Newton-Gregory, Stirling‘s, Bessel‘s and Lagrange‘s interpolation formula, Newton‘s divided differences interpolation formulae. Curve fitting: B- spline and Approximation: Fitting linear and non-linear curves, weighted least square approximation, method of least square for continuous functions.

Unit-IV

Numerical Differentiation and Integration: Numerical differentiation and errors in numerical differentiation, Newton-Cotes formulae, trapezoidal rule, Simpson‘s rule, Gaussian integration.

Unit-V

Numerical Solutions of Ordinary Differential Equations: Picard‘s and Taylor‘s series, Euler‘s and Runge-Kutta (RK) methods. Finite Element Method: Boundary value problems, Rayleigh and Galerkin methods of approximation, applications.

Books Recommended

1. K.E. Atkinson, W. Han, Elementary Numerical Analysis, 3rd Ed., Wiley, 2003.

2. C. Xavier, S.S. Iyengar, Introduction to Parallel Algorithms, Wiley-Interscience, 1998.

3. A. Kharab, R.B. Guenther, An Introduction to Numerical Methods: A MATLAB Approach,

1st Ed., Chapman and Hall/CRC, 2001. 4. B. Bradie, A Friendly Introduction to Numerical Analysis, Pearson Education, 2007.

5. S.R. Otto and J.P. Denier, An Introduction to Programming and Numerical Methods in MATLAB, Springer, 2005.

6. M.K. Jain, S.R.K. Iyengar and R.K. Jain, Numerical Methods for Scientific and

14

Engineering Computation, 7th Ed., New Age International Publishers, 2007.


SEMESTER III

PRACTICAL : Numerical Computing Lab

1. Develop a C program to find a root of a non-linear equation using Bisection method.

2. Develop a C program to find a root of a non-linear equation using False Position

method.

3. Develop a C program to find a root of a non-linear equation using Secant method.

4. Develop C program to find a root of a non-linear equation using Newton-Raphson

method.

5. Develop a C program to find a root of a non-linear equation using Barirstow's method.

6. Develop a C program to implement Simpsons 1/3rd Rule.

7. Develop a C program to solve linear equation using Gauss Elimination method.

8. Develop a C program to solve linear equation using Gauss Seidel method.

9. Develop a C program to compute the Gauss Jacobi Interactive methods.

10. Develop a C program to compute the interpolation value using Newton’s Forward

Difference formula.

11. Develop a C program to compute the interpolation value using Newton’s Backward

Difference formula.

15

12. Develop a C program to compute derivatives of a tabulated function at a specified

value using the Newton interpolation approach.

13. Develop a C program to implement Simpsons 3/8th Rule.

14. Develop a C program to implement Runge- Kutta 2nd order method.

15. Develop a C program to implement fitting of straight line.

16. Write a program to find mean for direct series.

17. Write a program to find median for direct series.

18. Write a program to calculate different percentiles.

19. Write a program to calculate mode for discrete distribution.

20. Write a program to calculate harmonic and geometric means for any distribution.

21. Write a program to calculate probability using binomial distribution and Poisson

distribution.

16

B.Sc. Computer Science (CBCS) Programme SEMESTER III

PRACTICAL : HTML Programming

Create an HTML document with the following formatting options: I. Bold

II. Italics III. Underline IV. Headings (Using H1 to H6 heading styles) V. Font (Type, Size and Color)

VI. Background (Colored background/Image in background) VII. Paragraph

VIII. Line Break IX. Horizontal Rule X. Pre tag

Create an HTML document which

consists of: I. Ordered List

II. Unordered List III. Nested List IV. Image

17

Create an HTML document which implements Internal linking as well as External linking. Create a table using HTML which consists of columns for Roll No., Student‘s name and grade.

Result Roll No. Name Grade

Create a Table with the following view:

Place an image here

Create a form using HTML which has the following types of controls:

I. Text Box II. Option/radio buttons

III. Check boxes IV. Reset and Submit buttons

Create HTML documents (having multiple frames) in the following three formats:

Frame1

Frame2

19


B.Sc. IV Semester (CBCS) Session 2018-2019 onwards

The examination shall consist of one theory paper and two practicals.

S. No

.

Paper Code

CC/DSE/

SEC Title

Hrs./week

Internal Exam.


marks Max.

1 BSC-406 CC Design and Analysis of Algorithms

4 30 70 100 4


3 BSC-417 SEC Practical

R Programming

4 - 50 50 2

Note:

20



B.Sc. Computer Science (CBCS) Programme SEMESTER IV

PAPER – I

Design and Analysis of Algorithms




Total 10 Marks


Total 30 Marks

Section C: Four questions may be in parts covering all the five Units (answer not 21

exceeding 500 words) will be asked. The candidates are required to attempt any TWO questions. Each question will be of 15 marks.

Total 30 marks

Unit-I

Introduction: RAM model, O(log n) bit model. Review of data structures: Balanced

trees, Mergeable sets. Algorithm Design Techniques: Iterative techniques, Divide and

conquer, dynamic programming, greedy algorithms.

Unit-II

Searching and Sorting Techniques: Review of elementary sorting techniques-selection

sort, bubble sort, insertion sort, more sorting techniques-quick sort, heap sort, merge

sort, shell sort, external sorting.

Unit-III

Lower bounding techniques: Decision Trees, Adversaries. String Processing: KMP,

Boyre- Moore, Robin Karp algorithms.

Unit-IV

Introduction to randomized algorithms: Random numbers, randomized Qsort, randomly

Built BST Number Theoretic Algorithms: GCD, Addition and Multiplication of two

large numbers, polynomial arithmetic, Fast-Fourier Transforms.

Unit-V

Graphs: Analysis of Graph algorithms Depth-First Search and its applications, minimum

Spanning Trees and Shortest Paths. Introduction to Complexity Theory: Class P, NP,

NP- Hard, NP Completeness. Introduction to Approximation Algorithms

Books Recommended

1. T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein, Introduction to Algorithms, Prentice-Hall of India, 2006.

22

2. J. Kleinberg and E. Tardos, Algorithms Design, Pearson Education, 2006.

3. S. Baase, Computer Algorithms: Introduction to Design and Analysis, Addison Wesley, 1999.

4. A.V. Levitin, Introduction to the Design and Analysis of Algorithms, Pearson Education, 2006.


PRACTICAL : Design and Analysis of Algorithms Lab

● Sort a given set of elements using the Quick sort method and determine the time required

to sort the elements. Repeat the experiment for different values of n, the number of elements in the list to be sorted and plot a graph of the time taken versus n. The elements can be read from a file or can be generated using the random number generator.

● Using Open, implement a parallelized Merge Sort algorithm to sort a given set of

elements and determine the time required to sort the elements. Repeat the experiment for different values of n, the number of elements in the list to be sorted and plot a graph of the time taken versus n. The elements can be read from a file or can be generated using the random number generator.

23

● a. Obtain the Topological ordering of vertices in a given digraph. b.Compute the

transitive closure of a given directed graph using Warshall's algorithm.

● Implement 0/1 Knapsack problem using Dynamic Programming.

● From a given vertex in a weighted connected graph, find shortest paths to other vertices using Dijikstra’s algorithm.

● Find Minimum Cost Spanning Tree of a given undirected graph using Kristal’s

algorithm.

● a. Print all the nodes reachable from a given starting node in a digraph using BFS method. b. Check whether a given graph is connected or not using DFS method.

● Find a subset of a given set S = {sl,s2,.....,sn} of n positive integers whose sum is equal to

a given positive integer d. For example, if S= {1, 2, 5, 6, 8} and d = 9 there are two solutions{1,2,6}and{1,8}.A suitable message is to be displayed if the given problem instance doesn't have a solution.

● Implement any scheme to find the optimal solution for the Traveling Salesperson

problem and then solve the same problem instance using any approximation algorithm and determine the error in the approximation.

● Find Minimum Cost Spanning Tree of a given undirected graph using Prim’s algorithm.

● Implement All-Pairs Shortest Paths Problem using Floyd's algorithm. Parallelize this

algorithm, implement it using Open and determine the speed-up achieved. 12. Implement N Queen's problem using Back Tracking.


PRACTICAL : R Programming

1. Write a program that prints ‘Hello World’ to the screen.

2. Write a program that asks the user for a number n and prints the sum of the

numbers 1 to n

3. Write a program that prints a multiplication table for numbers up to 12.

24

4. Write a function that returns the largest element in a list.

5. Write a function that computes the running total of a list.

6. Write a function that tests whether a string is a palindrome.

7. Implement the following sorting algorithms: Selection sort, Insertion sort,

Bubble Sort

8. Implement linear search.

9. Implement binary search.

10. Implement matrices addition , subtraction and Multiplication.


B.Sc. V Semester (CBCS) Session 2019-2020 onwards


S. No

.

Paper Code

CC/DSE/

SEC Title

Hrs./week

Internal Exam.


marks Max.

marks 25

1 BSC—511

DSE-I Operating System 4 30 70 100 4

2 BSC-512 DSE-II Cryptography

4 30 70 100 4

3 BSC-528 SEC Practical PHP Programming

4 - 50 50 2

Note:

● DSE - Discipline Specific Elective Courses


● Students will opt any one Discipline Specific Elective Courses (DSE) out of given

options.


SEMESTER V

PAPER – I

Operating System



Section A: Ten questions (short type answer) two from each Unit will be asked. Each 26

question will be of one mark and the candidates are required to attempt all questions.

Total 10 Marks


Total 30 Marks


Total 30 marks

Unit-I

Introduction: Operating System as a resource manager, operating system classification, system calls, traps, architectures for operating systems.

Unit-II

Device Management: Goals of I/O software, Design of device drivers. Processor Management: Process overview, process states and state transition, multiprogramming, multi-tasking, levels of schedulers and scheduling algorithms.

Unit-III

Process Synchronization - Critical section and mutual exclusion problem, classical synchronization problems, deadlock prevention.

Unit-IV

Multithreading Memory Management: Classical memory management techniques, paging, segmentation, virtual memory.

Unit-V

File Management: Overview of file management system, disk space management, directory structures. Protection domains, access control lists, protection models.

Books Recommended

27

1. A.S. Tanenbaum, Modern Operating Systems, 3rd Ed., Prentice-Hall of India, 2008.

2. William Stallings, Operating Systems: Internals and Design Principles, 5th Ed., Prentice-Hall of India, 2006.

3. Gary Nutt, Operating Systems: A Modern Approach, 3rd Ed., Addison Wesley, 2004.

4. D.M. Dhamdhere, Operating Systems: A Concept Based Approach, 2nd Ed., Tata McGraw-Hill, 2007.


SEMESTER V

PAPER – II

Cryptography

28




Total 10 Marks


Total 30 Marks


Total 30 marks

Unit-I

Overview of cryptography: Need of security, cryptographic goals, security approaches, basic terminology and concepts, symmetric key encryption - block cipher and stream cipher, substitution cipher and transposition ciphers, key space, public key cryptography, symmetric key v/s public key cryptography.

Unit-II

Protocols and mechanisms, key management through symmetric key and public key techniques, attacks on encryption schemes, attacks on protocols, models for evaluating security, perspective for computational security.

Unit-III

Elementary number theory: Prime numbers, Fermat‘s and Euler‘s theorems, Testing for primality, Chinese remainder theorem, discrete logarithms.

Unit-IV

Finite fields: Review of groups, rings and fields; Modular Arithmetic, Euclidean Algorithms, Finite fields of the form GF(p), Polynomial Arithmetic, Finite fields of the form GF(2).

29

Unit-V

Data Encryption Techniques: Algorithms for block and stream ciphers, private key encryption – DES, AES, RC4; Algorithms for public key encryption – RSA, DH Key exchange, KERBEROS, elliptic curve cryptosystems.

Book Recommended

1. W. Stallings, Cryptography and Network Security Principles and Practices, 4th Ed., Prentice-Hall of India, 2006.

2. C. Pfleeger and S.L. Pfleeger, Security in Computing, 3rd Ed., Prentice-Hall of India, 2007.

3. M.Y. Rhee, Network Security, John Wiley and Sons, NY, 2002.


30

SEMESTER V

PRACTICAL : PHP Programming

1. Create a PHP page using functions for comparing three integers and print

the largest number.

2. Write a function to calculate the factorial of a number (non-negative integer). The

function accept the number as an argument.

3. WAP to check whether the given number is prime or not.

4. Create a PHP page which accepts string from user. After submission that page

displays the reverse of provided string.

5. Write a PHP function that checks if a string is all lower case.

6. Write a PHP script that checks whether a passed string is palindrome or not? ( A

palindrome is word, phrase, or sequence that reads the same backward as forward,

e.g., madam or nurses run)

7. WAP to sort an array.

8. Write a PHP script that removes the whitespaces from

a string. Sample string : 'The quick " " brown fox'

Expected Output : Thequick""brownfox

9. Write a PHP script that finds out the sum of first n odd numbers.

10. Create a login page having user name and password. On clicking submit, a welcome

message should be displayed if the user is already registered (i.e.name is present in

the database) otherwise error message should be displayed.

11. Write a PHP script that checks if a string contains another string.

12. Create a simple 'birthday countdown' script, the script will count the

number of days between current day and birth day.

13. Create a script to construct the following pattern, using nested for loop.

*

* *

* * *

* * * *

31

* * * * *

14. Write a simple PHP program to check that emails are valid.

15. WAP to print first n even numbers.

16. $color = array('white', 'green', 'red'')

Write a PHP script which will display the colors in the

following way : Output :

white, green, red,

● green

● red

● white

17. Using switch case and dropdown list display a ―Hello‖ message depending on

the language selected in drop down list.

18. Write a PHP program to print Fibonacci series using recursion.

32


B.Sc. VI Semester (CBCS) Session 2019-2020 onwards


S. No

.

Paper Code

CC/DSE/

SEC Title

Hrs./week

Internal Exam.


marks Max.

marks 1 BSC-611 DSE-I Computer

Networks 4 30 70 100 4

2 BSC-612 DSE-II Database Applications

4 30 70 100 4

3 BSC-628 SEC Practical MySQL(PL/SQL)

4 - 50 50 2

Note:

● DSE - Discipline Specific Elective Courses


● Students will opt any one Discipline Specific Elective Courses (DSE) out of given

options.

33

B.Sc. Computer Science (CBCS) Programme SEMESTER VI

PAPER – I

Computer Networks




Total 10 Marks


Total 30 Marks


Total 30 marks

Unit-I

Basic Concepts: Components of data communication, distributed processing, Line configuration, topology, transmission mode, and categories of networks. OSI and TCP/IP Models: Layers and their functions, comparison of models.

Unit-II

Digital Transmission: Interfaces and Modems: DTE-DCE Interface, modems, cable modems. Transmission Media: Guided and unguided, Attenuation, distortion, noise, throughput, propagation speed and time, wavelength, Shannon Capacity.

Unit-III Telephony: Multiplexing, error detection and correction, Many to one, one to many,

34

WDM, TDM, FDM, circuit switching, packet switching and message switching. Data Link control protocols: Line discipline, flow control, error control, synchronous and asynchronous protocols overview. ISDN: Services, historical outline, subscriber‘s access, ISDN, Layers, and broadband ISDN.

Unit-IV Devices: Repeaters, bridges, gateways, routers, The Network Layer, Design Issues, Network Layer Addressing and Routing concepts (Forwarding Function, Filtering Function);Routing Methods (Static and dynamic routing, Distributed routing, Hierarchical Routing);Distance Vector Protocol, Link State protocol.

Unit-V Transport and upper layers in OSI Model: Transport layer functions, connection management, Functions of session layers, Presentation layer, and Application layer. Books Recommended 1. A.S. Tenanbaum, Computer Networks, 4th Ed., Pearson Education Asia, 2003. 2. Behrouz A. Forouzan, Data Communication and Networking, 2nd Ed., Tata McGraw Hill. 3. D. E. Comer, Internetworking with TCP/IP, Pearson Education Asia, 2001.

4. William Stallings, Data and Computer Communications, 7th Ed., Pearson education Asia, 2002.

35

B.Sc. Computer Science (CBCS) Programme SEMESTER VI

PAPER – II

Database Applications




Total 10 Marks


Total 30 Marks


Total 30 marks

Unit-I

Application Design and Development: User interfaces and tools, web interfaces to Databases Web Fundamentals: HTML, static vs. dynamic web pages, client (Java script/VB) and server side scripting (JSP/ASP/PHP/VB).

Unit-II

Web servers and sessions, two level & three level architecture, Real Life Application Development using Popular DBMS: SQL, procedures & functions, exception handling,

36

triggers, large objects, user defined data types, collection types, bulk loading of data.

Unit-III

Query Optimization: Query Processing, query tree, query plans, measures of query cost, estimates of basic operations, equivalent relational algebra expressions, evaluation of expressions.

Unit-IV Authorizations in SQL: System and user privileges, granting and revoking privileges, roles, authorization on views, functions and procedures.

Unit-V

Limitations of SQL authorizations, audit trails Application Security: Encryption techniques, digital signatures and digital certificates. Books Recommended 1. A. Silberschatz, H. Korth and S. Sudarshan, Database System Concepts, 5th Ed., Tata McGraw Hill, 2006. 2. J. Morrison, M. Morrison and R. Conrad, Guide to Oracle 10g, Thomson Learning, 2005. 3. Loney and Koch, Oracle 10g: The Complete Reference, Tata McGraw Hill, 2006. 4. David Flanagan, Java Script, The Definitive Guide, O‘Reilly Media, 2006. 5. Marty Hall, Larry Brown, and Yaakov Chaikin, Core Servlets and Java Server Pages: Core Technologies (Vol. II), 2nd Ed., Sun Microsystems Press, 2006. 6. S.K. Singh, Database Systems Concepts, Design and Applications, Pearson Education 2006.

37


SEMESTER VI

PRACTICAL : MySQL(SQL/PL-SQL) Lab

[SQL COMMANDS]

1) SQL* formatting commands

2) To create a table, alter and drop table.

3) To perform select, update, insert and delete operation in a table.

4) To make use of different clauses viz where, group by, having, order by, union and intersection,

5) To study different constraints.

[SQL FUNCTION]

6) To use oracle function viz aggregate, numeric, conversion, string function.

7) To understand use and working with joins.

8) To make use of transaction control statement viz rollback, commit and save point.

9) To make views of a table.

10) To make indexes of a table.

[PL/SQL]

38

11) To understand working with PL/SQL

12) To implement Cursor on a table.

13) To implement trigger on a table

39

D E P A R T M E N T O F C O M P U T E R S C I E N C E J.R .N . R … · 2018-06-08 · Write a C++...

Documents

Transcript of D E P A R T M E N T O F C O M P U T E R S C I E N C E J.R .N . R … · 2018-06-08 · Write a C++...