RAVENSHAW UNIVERSITY

CUTTACK

BACHELOR OF DEGREE PROGRAMME IN

COMPUTER SCIENCE

SYLLABUS

(Effective from 2012 Admissions onwards)

PROPOSED SCHEME FOR B Sc Computer Science (HONS)

REVISED CURRICULUM - 2012

+3 1st Years

HONOURS

SEMESTER-1

Paper-1(SH-1.1.1)

DIGITAL CIRCUITS AND COMPUTER ORGANIZATION OPERATING SYSTEM

CONCEPTS.

Unit-1

Number systems (9 Lectures)

Decimal numbers, Binary Numbers, hexadecimal numbers, octal numbers.

Converting from One Number System to Another.

Converting to Decimal from Another Base, Binary to octal Conversion, Octal to Binary Conversion,

Binary to Hexadecimal Conversion, and Hexadecimal To binary Conversion. 1‟s and 2‟s complement of

Binary Numbers.

Boolean algebra and Logic gates

Definition of Boolean algebra. De Morgan‟s theorem. The inverter, AND, OR, NAND, OR, Exclusive

OR, Exclusive NOR Gates. Truth Table: Basic structure of Truth Table, Use of Truth Table for AND,

OR, NOT, XOR, NAND, NOR, XOR, XNOR GATES. Logic Circuits for expressions using NAND

and NOR gates. UNIT-II (13 lectures)

Computer Fundamentals

Introduction to Computer

Introduction to Computer, Characteristics of computer, application of computer in various fields,

Evolution & Generations of computer. types of computer ,basic computer organization. Processor.

Input and Output Devices

Input Devices (Keyboard, Mouse, Scanner, Track ball, Joystick, Light Pen).

Output Devices (Monitors, Printers, Plotters, Screen Image Project).

Memory Unit

Main Memory: (RAM ROM, PROM, EPROM, EEPROM, and Cache).

Secondary Storage Devices: Magnetic tape, Magnetic disk, Optical disk, Mass Storage Devices, Storage

Hierarchy)

Computer Software

Introduction, Relation between hardware & software, types of software (System Software & Application

Software).

Computer Language

Machine Language, Assembly Language, High level language, Interpreter & Compiler, Assembler.

UNIT-III (14 Lectures)

Operating system

Overview

Introduction. What is an operating system? Types of operating systems. Functions- OS as Resource

Manager.

Operating system structure

System components. Operating system services. System calls.

Process & Synchronization

Process concept, process scheduling, operation on process, co-operating process, threads,

Inter process communication.Syncronization (Critical section problem, Semaphores, Monitors).

CPU Scheduling

Basic concepts, Scheduling criteria, Scheduling algorithm (FCFS, SJF, RR, Multi Level queue,

Multi level feedback queue, Priority Level).Multiprocessor Scheduling.

References:

1. Computer System Architecture: M Maris Mano, PHI

2. Digital Electronics by R.K. Gaur.

3. Fundamental of Computers: Raja Raman

4. Computer Fundamentals – PK.Sinha-BPB

5. Operating System Concept, Galvin, Silverschtz,Willy Eastern

6. Operating System- Madnick, Donovan

Paper-2(SH-1.1.2)

PROGRAMMING IN ‘C’

UNIT-1 (11 Lectures)

OVERVIEW AND CONTROL FLOW:

Introduction to ‘c’:

An Overview of C Language, Structure of a C program. Fundamentals: The C Character Set. Keywords.

Constants (Rules for Constructing Numeric and Character Constants) .Variables, Data Types, Escape

Sequence, Designing and Developing Programs in C, Directives, Comments, Header Files. Some C

programs Examples.

Operators, Expressions and Assignment Statements:

Arithmetic Operators, Relational Operators, Logical Operators, Assignment Operators, Increment and

Decrement Operators, Conditional Operators, , Bitwise operator the Comma Operator. Arithmetic

Expressions. Evaluation of Expression. Type Conversions in Expressions.

Managing input and output operator:

Formatted console I/O (prints, scanf), unformatted console I/O (getchar(), putchar(), gets(), puts())

Control flow

Selection statements (if, if-else, if-else-if, nested if, switch), Iteration structure (for, while, do-while,

break, continue, goto)

UNIT –II (12 Lectures)

ARRAY, FUNCTION AND STRING

Arrays & Strings

Single dimensional arrays, multidimensional arrays, initializing array using static declaration, Searching

and sorting of Arrays, Array of Characters, Character arrays and strings, String handling Functions.

User Defined Functions

Function declaration, definition & scope, recursion, Arrays and functions, call by value, call by

reference, Storage Classes: automatic, external (global), static & registers.

UNIT- III (13 Lectures)

POINTER, STRUCTURE AND FILE

Pointer Pointers: An introduction to Pointer, The & and * operators, pointer Assignments, pointer arithmetic,

Pointer versus Arrays, Array of pointers, Limitations of Array of pointers to String, Pointer to pointer,

Pointer to Functions. Dynamic Memory allocation.

Structure

Structures General form, Declaration, Accessing Structure Elements, Array of Structure, and Passing

structure Elements to Functions, Uses of Structures, and Unions: Declaration, Union of structures, Uses

of Unions.

File handling and C Preprocessor

Preprocessor commands, file handling: Opening a file, Reading from a file, closing the file.

Refernces:

1. Working with C – Y.R.Kartenkar – BPB.

2. Ansi C – E. Balagurusamy – BPB.

3. C in Depth – S. Srivastav, D. Srivastav.

Practical

(SH-1.1.3)

1. Introduction to Disk operating System. Internal & External Commands of Dos.

2. Introduction to Windows operating System,Ms-Word,Ms-Excel,Ms-Power point.

3. Programming using „C‟ Language.

SEMESTER-II

Paper-4(SH-1.2.4)

DIGITAL CIRCUITS-II, MICROPROCESSOR AND OPERATING SYSTEM-II

UNIT-1 (14 Lectures)

Combinational Circuit & Sequential logic circuit.

Combinational Circuit

Introduction, Half adder, Full adder, Half and Full substractor, Parallel binary adder, serial

adder, Multiplexer(4 to 1, 8 to 1), Demultiplexer(1 to 4 and 1 to 8) Decoder(BCD to Decimal and

BCD to Seven segment Decoder) Decimal to BCD encoder.

Sequential logic circuit

Introduction, Flip-flops, S-R and clocked S-R Flip-flop, flip-flop, T flip –flop, J –K Flip-Flop,

Master Slave Flip- Flop.

UNIT-II (8 Lectures)

Microprocessor

MICROPROCESSOR: Architecture, Bus Organization, Functional diagram and pin out diagram

of 8085, Addressing modes of 8085, Instruction set of 8085, I/O Schemes Peripherals and

Interfaces.

UNIT-III (14 Lectures)

Operating system-II

Memory Management: Swapping, Contagious memory allocation, Paging, Segmentation,

Segmentation with paging

Virtual Memory: Demand Paging, Process Creation, Page replacement algorithm, Allocation of

frames, Thrashing.

File-System Interface: file concept, access methods, directory structure, file system structure,

Protection. File system implementation: allocation methods, free space management Recovery

Text Books:

1. Digital Electronics by R.K. Gaur.

2. Operating System Concept, Galvin, Silverschtz,Willy Eastern Microprocessor & Peripherals. by : S. P. Chowdhury.

2) Microprocessors & Application by B. Ram (New Edition 2007)

3) Microprocessor & Applications by R. Gaonkar

Paper-5 (SH-1.2.5)

PROGRAMMING IN C++

UNIT-I (13 Lectures)

Principles of object oriented programming; OOP paradigm; Basic concepts of OOP; Benefits

applications. Introduction to C++, Structure of C++ program; how to create and execute a C++

Program. Function overloading.

Specifying a class; Defining member functions; making an outside function inline; nesting of

member functions; private member functions; arrays of objects; objects as function arguments;

returning objects; Nesting of classes. Static data members; static member functions; friendly

functions; Dynamic Memory Allocation.

UNIT-II (11 Lectures)

Constructors and destructors: - constructors with default arguments; Parameterized constructors;

copy constructor; Dynamic constructors; Destructors.

Operator overloading: - definition; overloading unary operators; overloading binary Operators;

overloading unary operators & binary operators using friends; manipulation of strings using

operators.

UNIT-III (12 Lectures)

Inheritance: Base class and derived class, types of inheritance- Single, Multilevel, Multiple,

Hierarchal, Hybrid, Multi path inheritance, public inheritance, private inheritance, constructors

in derived class.

Pointers, Virtual functions and polymorphism: Pointers to objects, Pointers to derived classes,

virtual functions, Rule for virtual functions.

C++ streams: stream classes, unformatted I/O operations(get(),getline(),read(),write(),put()),

formatted console I/O operations(width(),precision(),fill(),setf()).

Files: Introduction, classes for File stream classes, closing and opening a file, file modes, file

pointers and their manipulation Sequential Read / Write operations, written to & read from the

disk file, Random Access Operation.

Text book:

1. Object Oriented Programming with C++:E. Balagurusamy, Tata McGraw Hill.

Reference Books:

1. Object oriented programming in turbo C++: Robert Lafore, Galgotia

2. Object Oriented Programming with ANSI & Turbo C++: Ashok m

Kamthane.Pearson Education.

3. let us C++, Y. Kanethkar, BPB.

4. Mastering C++: K.R.Venugopal, Rajkumar, T Ravisankar, and Tata McGraw Hill

Practical

(SH-1.2.6)

1. Programming Using C++.

2. Shell Programming (Decisions & Loop Control Structure).

+3 2nd

Years

HONOURS

SEMESTER-III

Paper-7(SH-2.3.7)

DATABASE SYSTEMS

UNIT-1 (13 Lectures)

DBMS Definition, Characteristics of DBMS ,Application and advantages of DBMS,Instances ,

Schemas and Database States, Three Levels of Architecture , Data Independence, DBMS

languages, Data Dictionary, Database Users, Data Administrators.

E-R Modeling: entity set, Entity types, attribute and key, relationships, relation types, E-R

Diagram, weak entity set, specialization and generalization.

UNIT-II (14 Lectures)

Relation model: Relational model concepts, relational constraints, Relational Algebra (selection,

projection, union, intersection, Cartesian product, Different types of join like theta join, equi-

join, natural join, outer join), Tuple and Domain Relational Calculus.

Function dependency, Normalization Process, Normal forms: 1NF, 2NF, 3NF, 4NF, BCNF.

UNIT-III (13 Lectures)

Transaction processing and concurrency control: Transaction concepts, concurrency control,

Locking and Timestamp methods for concurrency control.

Database Recovery System: Types of Data Base failure & Types of Database Recovery, Recovery

Techniques.

Text Books: 1. Database System Concepts by Sudarshan, Korth (McGraw-Hill Education)

2. Fundamentals of Database System By Elmasari &Navathe- Pearson Education

References Books: (1) An introduction to Database System – Bipin Desai, Galgotia Publications

(2) Database System: concept, Design & Application by S.K.Singh (Pearson Education)

(3) Database management system by leon &leon (Vikas publishing House).

(4) Database Modeling and Design: Logical Design by Toby J. Teorey, Sam S. Lightstone, and

Tom Nadeau, “”, 4th Edition, 2005, Elsevier India Publications, New Delhi

(5) Fundamentals of Database Management System – Gillenson, Wiley India

Paper-8(SH-2.3.8)

File & Data Structure

UNIT – I (13 Lectures)

File concept: Field, Record, File, Characterstics ; of a File. Different file organizations & various

operations (Insertion, Deletion,Modification,searching) on Sequential, Indexed & direct files.

UNIT – II (14 Lectures)

Definition of a Data structure - primitive and composite Data Types, Introduction to Algorithm

Designing. Storage structure for arrays, sparse matrices.

Linked List: Introduction, Traversing a Linked List, Searching a link list, Insertion, Deletion in

Linked List. Double Linked List, Circular Linked List. Stack as an array & linked list (Push &

Pop operation). Application of Stack, Infix to Prefix, Infix to Postfix, Postfix to prefix, Postfix to

Infix. Queue as an array & linked list (Add & Delete operation).

UNIT – III (13 Lectures)

Tree: Introduction, binary tree, traversal of binary tree, representation of binary tree in computer

memory, traversal of binary tree, insertion and deletion of a node in binary tree.

Text Books:

1. Data Structure Using C by Yashwant Kanitkar.

2. Expert Data Structure by R.B. Patel.

3. Depth in C by Shrivastava.

4. An introduction to Database System – Bipin Desai, Galgotia Publications

Reference Book 1) Data Structure in C – Schaum Series

2) Database Management Systems –Arun K. Majumdar,Pritimoy Bhattacharya.

Paper-9(SH-2.3.9)

Practical

1. DATA STRUCTURE

a. Implement PUSH, POP operations of stack Using Arrays & Link list.

b. Implement add, delete operation of a queue using Arrays & Link List.

c. Creation, Insertion and Deletion in single linked list using inheritance.

2. SQL

DDL (Create, Alter, Drop, Constraints), DML (Select, Insert, Update, Delete And

Merge), DCL (Commit, Rollback, Savepoint)

3. PL/SQL

Introduction to PL/SQL,Variables,Constant,Conditional statements,Iterative

statemens,Cursor,procedures,Functions,triggers,Exception hansaling.

+3 2nd Years

HONOURS

SEMESTER-IV

Paper-10(SH-2.4.10)

SOFTWARE ENGINEERING

UNIT-1: (12 Lectures)

Introduction: Evolution and impact of Software engineering.

Software life cycle models: Classical waterfall model, Iterative waterfall model, Evolutionary

model. Requirement analysis and specification: Requirement Gathering and analysis, software requirements

Specifications.

Object - Oriented Design: Overview of Object-Oriented concepts, Object modeling using UML:

use case diagram, class diagram.

UNIT-1I: (12 Lectures)

Software Project Management: Responsibilities of a Software Project Manager: Job

Responsibilities of a Software Project manager,Skills Necessary for Software Project

Management.Project Planning:The SPMP Document.Metrics for Project Size

Estimation:LOC,Function Point Metrics.Project Estimation Techniques:Empirical estimation

Techniques(Expert Judgement Technique,Delphi Cost estimation.),Heuristic Techniques(Basic

COCOMO Model,Intermediate COCOMO,Complete COCOMO),Analytical Estimation

Techniques.

UNIT-III:

(16 lectures) Testing: Objectives, Black box and White box testing, various software testing strategies: Unit testing

(Driver and Stub Modules), Integration testing. Debugging (Debugging Approaches, Debugging

Guidelines).

Software Reliability: Hardware Vs. Software reliability,Realiability Metrics,Realiability Growth

Modeling.

Quality management System:ISO and SEI CMMI, PSP and Six Sigma.

Text Books: 1. Fundamental of Software Engineering by Rajib Mall,PHI.

Paper-11(SH-2.4.11)

Visual Basic UNIT-1: (16 lectures)

Introduction to Visual Basic: Visual programming, event driven programming, VB Environment:New

Project window, property window, Form layout window, toolbar, menu bar, tool box, form Window,code

Editor window.

Managing Control: Form properties, label control, text box, command button, list box, combo box, timer,

option button, check box, frame, picture box, image control, event procedure.

Variable & operator: Data type,Variable:Declaring Variable,Type Declaration Characters,Fixed &

variable Length string Declaration,Assignvalues to variable,Implicit & Explicit variable

Declaration,Variable scope(Private(or Local),Module Scope,Public Scope).Operators:Math

Operators,Conacatenate Operator,Realational & Logical Operators.

Control structures: If-else, Nested If--else, select case, goto, do loop, For Next. Arrays.

UNIT-II: (12 lectures)

Library Functions : Numeric functions(val,rnd,int) ,date functions(Now,date,time,day, year, month),

stringfunctions(lcase&ucase,Len,trim,Ltrim&Rtrim,Left,Right,Mid,StrReverse,str),

Miscellaneous functions (Msgbox(),Input box(),)

Procedure,Functions,& Modules:-Introduction,Types of procedures(Sub,Function & Property

Procedures),Code module:Form Module,Standard Module,Class Module.

Creating Menus: Application wizard for menu, menu editor, creating menu, adding code to menus.

Concept of MDI.

File handaling in Vb:file system controls,Sequential File.

Unit-III: (12 lectures)

Database Program in VB:Data Concepts,Creating new database through Visual data

manger,adding table to databse,field to a table.What is ODBC?Setup connection to Remote Data

object through ODBC.

VB Data Environment &Data Report:what is connection objects to dataEnvironment.Section of

the data report,Adding data report,controls,Creating a simple report,grouped data Report.

Text Books: 1. VB Guide 6.0, Black Book, Peter Norton, Techmedia.

2. Mastering VB 6.0, Evangelous Petroustos, BPB.

3. Visual Basic ( The Complete Reference) ,Noel Jerke, Tata McGraw Hil

Paper-12(SH-2.4.12)

Practical As Per the Theory Syllabus Visual Basic

+3 3rd

Years

HONOURS

SEMESTER-V

Paper-13(SH-3.5.13)

OOPs in JAVA

UNIT-1: (12 Lectures)

Object oriented concept. Java Evolution (History and features of Java.). How java differ from C

and C++. Java environment, Java Tokens, JVM, Command line arguments, constants, variables,

Data types (Primitive and non primitive Data type), Simple Java program (concept of class,

static, main method). Control Statement (Branching & Looping) , Array: Creating an array,

program for 1D and 2D array, string.

Creation of objects (Dynamic creation), Invoking members of objects, Types of methods,

method overloading, constructor, overloading of constructors, finalize method.

UNIT-II: (12 Lectures)

Inheritance , Method overriding

Interface: Defining Interface, Extending Interface, Implementing Interface, Accessing Interface

Variables.

Packages: Introduction, Java API packages, creating a Package, Accessing & using a package.

Multithreaded Programming: Introduction, life cycle of a thread, creating a Thread by

extending the Thread Class and Implementing Runnable interface, Stopping & Blocking a

thread.

Exception: Types of error, compile time error, runtime error, syntax for exception Handing.

UNIT-III: (16 Lectures)

Java Applet: introduction, applet life cycle, creating an applet, passing parameter to applet.

Graphics class: line and rectangle, circle and ellipse, font setting.

Java AWT: text component class, textfield, Button, Label ,scroll bar, textarea, menu bar Check

box group, choice class, list,GUI application using desktop application and applet .

Event Handling: event classes, event listeners, Action Event, key events, mouse events

Text Book :

1. OOPs in Java – E.Balagurusamy – BPB

2. Complete Reference – TMH

Paper-14(SH-3.5.14)

Computer Graphics

UNIT-1: (12 lectures)

Overview of Graphics System: Video display devices: Refresh cathode-Ray tubes, Raster scan

displays, Random scan displays, and Input devices: Keyboard, Mouse, Trackball and Space ball,

Joysticks, Data Glove, Digitizers, Image scanners, Touch panel, Light pen, Voice systems, Hard

copy devices.

Output Primitives: Line drawing Algorithms: DDA and Bresenham‟s Line Algorithm.

Circle Generating algorithm: Midpoint circle algorithm. Aliasing, Antialiasing Technique.

UNIT-II: (16 lectures)

Two Dimensional Geometric Transformations: Basic Transformations: Translation,

Rotation, Scaling, Composite Transformations, Other Transformations: Reflection, shear.

Transformation between coordinate systems.

Two Dimensional viewing: Window to view port coordinates transformation. Line

Clipping (Cohen-Sutherland Algorithm, LiangBraskey) and Polygon Clipping

(Sutherland-HodgemanAlgorithm).

UNIT-III: (12 lectures)

Three Dimensional Geometric Transformations and representation: Translation

Rotation, Scaling, Reflections, shear, Composite Transformation.

Spline Representation, Interpolation and Approximation Spline, Cubic Bezier Spline

Projections: Parallel Projection and Perspective Projection.

Text Books

1. ComputerGraphics, Hearn &Baker, Pearson Prentice Hall

Paper-15(SH-3.5.15) SYSTEM ANALYSIS AND DESIGN

UNIT-I: (12 Lectures)

What is System analysis and Design?Business system concepts: What is a System?System

Model,Important Systems Characterstics, Element of a System, Business Systems,Business

Information Systems.Categories of Information System:Transaction Process

Systems,management Information Systems,Decision Support Systems, Scope of Information

System, Feasibility study,System Development Life Cycle.

UNIT-II (12 Lectures)

Role of information system, Information system planning, Fact finding techniques, Tools

for documenting procedure and decisions, Structured Analysis, Data flow analysis, Features

and tools of data flow strategy, Advantage of data flow analysis, Physical and Logical data

flow diagrams. Data dictionary features, Processes in the Data dictionary.

UNIT-III: (12 Lectures)

System Design: Objectives in designing an information system, software development

specification. Elements of the design, Design of output, Design of files, Design of Database

Interaction, Design of Input, Design of control, Design of Procedure, Design of Program

specification. Design of computer output, types of output.

TEXT BOOKS

1. Analysis & Design of Information system – James A. Senn –McGraw Hill

2. System Analysis and Design – Awadh

Paper-16(SH-3.5.16)

Theory of Computation & Compiler Construction

UNIT – I (13 Lectures)

Finite Automata:

Definition of an Automaton, Description of a finite automaton, Transition systems,

Acceptability of a string by a finite automaton, Types of finite automaton, NFA, DFA, The

equivalence of DFA and NFA.

Formal languages

Basic definition of a regular expression, Regular expressions for regular languages, Regular

Grammars, Pumping lemma for regular sets, Closure properties of regular sets.

UNIT – II (13 Lectures)

Context Free Languages:

Context Free Languages and Derivation Trees, Ambiguity in Context Free Grammars, Normal

Forms for Context Free Grammars – CNF and GNF , Pumping lemma for Context Free

Grammars.

Push Down Automata:

Basic Definition, Acceptance by Push Down Automata, PDA and Context Free Languages,

Parsing and Push Down Automata.

UNIT – III (14 Lectures)

Compiler Design:

Introduction to Compiler, Phases of a compiler, Implementation of a Lexical Analyser, Syntactic

analysis – Parsers, Shift Reduce parsing, Operator Precedence Parsing, Top down Parsing, Brief

idea about Predictive LR, SLR and LALR parsers, Syntax Directed translation, Code Generation

and Optimization.

TEXT BOOKS:

1. Introduction to Theory of Computation : By John E. Hopcroft and Jeffery D. Ullman -

Narosa

2. Theory of Computer Science : By K.L.P. Mishra and N. Chandrasekharan – PHI

3. An Introduction to Formal Languages and Automata : By Peter Linz – Narosa

4. Principle of Compiler Design : By Alfred V. Aho, Jeffrey D. Ullman - Narosa

Paper-17(SH-3.5.17)

Practical

As per Theory syllabus Java.

Paper-18(SH-3.5.18)

Practical

HTML tags <HTML>, <HEAD>,<BODY>, Paragraphing, line Break tag, Bullet and Numbering

tag, Text formatting tags,(Bold, Italic, Underline, strike through, subscript, superscript) ,Marquee

tag,Meta command, Hyperlink tag, Inserting Back ground image, Horizontal Rule, Changing the

Background and fore ground color, LIST tags : Unordered & ordered list ,Creating table,

merging cells, splitter cells, table caption, creating frames & forms (Frameset definition, frame

definition, nested frameset, HTML forms, elements of a form).Style sheet.

(Submission HTML Project)

+3 3rd

Years

HONOURS

SEMESTER-VI

Paper-19(SH-3.6.19)

COMPUTER NETWORK

UNIT-1: (13 Lectures)

Introduction to Network, LAN, MAN, WAN, Protocols and standards, ISO/OSI reference model,

TCP/IP Protocol suite.

Physical Layer:

Analog signal, Digital signal, Transmission Impairment, Data rate limits, Transmission modes,

Modulations, Multiplexing – FDM, WDM,TDM.

Transmission Media: Guided media (Twisted Pair cable, Co - axial cable, Optical fiber cable.),

unguided media (Radio Transmission, Microwave communication).

Circuit Switching Vs packet Switching.

UNIT-II: (13 Lectures)

Data link Layer:

Data link Layer design Issues.Error Detection and Error Correction mechanisms.

Network Layer:

Need for Network Layer, IPv4 Addresses, notation, Classful Addressing, IPv6 Addresses, IPv4

Datagram.

UNIT-III: (14 Lectures)

Transport Layer:

Process to Process Delivery, connection management-addressing,establishing and releasing

connection, Transport Layer Protocol: UDP, TCP

Application Layer:

Domain Name System (DNS), File Transfer Protocol (FTP), Simple Mail Transfer Protocol

(SMTP), World Wide Web (WWW), Hyper Text Transfer Protocol (HTTP)

Text Books:

1. Data Communications and Networking: Behrouz A. Forouzan, Tata McGraw-Hill.

2. Computer Networks: A. S. Tannenbum, D. Wetherall, Prentice Hall, Imprint of Pearson

3.William Stallings, Data and Computer Communications

Paper-20(SH-3.6.20)

PROGRAMMING IN C#.NET

Unit–1 (10 lectures)

Introduction to C#:Introduction to .NET, Features of .NET, Overview of C#, Literals,

Variables, Data types, Operator and Expressions, Branching, Looping, Methods, Arrays, Strings,

Structures.

Unit–2: (12 lectures)

Object Oriented Aspects of C#:Classes, Objects, Inheritance, Polymorphism, Interfaces,

Operator Overloading, Errors and Exceptions

Unit–3: (18 lectures)

Advance C# Concepts: Windows Applications: Forms,Labels,Text Field,

Button,Checkbox,Radiobutton,List box, Picturebox,Combobox,Timer, Event Handling,

Dialog Box functions. How ADO.NET Works, The object model. Benefits of ADO.NET. The

Ado.Net Architecture (Dataset, Data providers, connection features, The DataSet, The managed

providers, ADO.NET.Reading Database Using the SQL Manager provider.

Text Books:

1. Programming in C#, E.Balagurusamy (Unit I, II) 2. Programming in C# - Wrox publication. 3. Complete Reference C#, TMH.

Paper-21(SH-3.6.21)

DESIGN AND ANALYSIS OF ALGORITHMS

Unit-1: (14 Lectures)

Introduction to designing and analysis of algorithm, performance analysis, Time and space

complexity, Growth of Functions, Asymptotic notations (Ω, Θ, Ο), standard notations and

common functions), Recurrences, solution of recurrences by substitution and Master Methods.

Divide and Conquer – Design & Analysis of Divide and conquer algorithms.Analysis of Quick sort,

Merge sort, Heap sort.Binary search.

Unit-II: (12 Lectures)

Dynamic programming: Matrix-chain multiplication, Elements of dynamic programming,

Longest common subsequence.Greedy method – General method, knapsack problem, Huffman

coding, Brute-Force and Rabin-Karp string matching algorithm.

Unit-III: (14 Lectures)

Graph :Graph in Traversals(BFS & DFS), shortest paths problems(Bellman-ford and Dijkstra's

algorithms). Minimum spanning tree(Kruskal& Prim).

Text Books:

1.T.H. Cormen, C.E. Leiserson, R.L. Rivest, Introduction to Algorithms, Prentice Hall of

India. 2. Ellis Horowitz, SartajSahni, SanguthevarRajasekaran, “Fundamentals of Computer

Algorithms”, Galgotia Publications Pvt. Ltd., 2008.

Paper-22(SH-3.6.22)

COMPUTER SECURITY

UNIT-I (14Lectures)

The meaning of computer Security, Computer Criminals, Methods of Defense; Elementary

Cryptography: Substitution Ciphers, Transpositions, Private-Key Cryptosystems, The Data

Encryption Standard, The AES Encryption Algorithm, Public-Key Cryptosystems, RSA

Algorithm.

UNIT-II (12Lectures)

Secure Programs, Non-malicious Program Errors, viruses, worms and other malicious code,

Targeted Malicious code, controls Against Program Threats,File protection Mechanisms,Digital

Signatures Authentication, Secret Sharing, Group-oriented cryptography, Identification

UNIT-III (14Lectures)

Security requirements, Reliability and integrity, Sensitive data, Inference, multilevel database,

proposals for multilevel security; Security in Network; Threats in Network, Network Security

Controls, Firewalls, Intrusion Detection Systems, Secure E-mail.Legal and Ethical Issues in

Computer Security: Protecting Programs and data, Information and the law

Text Book:

1. Charles P. Pfleeger& Shari Lawrence Pfleeger,“Security in Computing”, Fourth Edition,

2007, Pearson Education, Inc. New Delhi.

2. Josef Pieprzyk, Thomas Hardjono, Jennifer Seberry, "Fundamentals of Computer

Security", 2003, Springer & Universities Press India, New Delhi.

Paper-23(SH-3.6.23)

Practical

As per Theory syllabus C#.NET

UNIT-I, II

Paper-24(SH-3.6.24)

Practical

C#.NET (Advance)

UNIT-III