Anna University Syllabus

Author: zerlina // Category: , ,

ANNA UNIVERSITY syllabus

B.TECH. INFORMATION TECHNOLOGY


GE1301 PROFESSIONAL ETHICS AND HUMAN VALUES 3 0 0 100

Objective
· To create an awareness on Engineering Ethics and Human Values.
· To instill Moral and Social Values and Loyalty
· To appreciate the rights of Others

1. Human Values 10
Morals, Values and Ethics – Integrity – Work Ethic – Service Learning – Civic Virtue – Respect for Others – Living Peacefully – caring – Sharing – Honesty – Courage – Valuing Time – Co-operation – Commitment – Empathy – Self-Confidence – Character – Spirituality

2. Engineering Ethics 9
Senses of 'Engineering Ethics' - variety of moral issued - types of inquiry - moral dilemmas - moral autonomy - Kohlberg's theory - Gilligan's theory - consensus and controversy – Models of Professional Roles - theories about right action - Self-interest - customs and religion - uses of ethical theories.

3. Engineering as Social Experimentation 9
Engineering as experimentation - engineers as responsible experimenters - codes of ethics - a balanced outlook on law - the challenger case study

4. Safety, Responsibilities and Rights 9
Safety and risk - assessment of safety and risk - risk benefit analysis and reducing risk - the three mile island and chernobyl case studies.
Collegiality and loyalty - respect for authority - collective bargaining - confidentiality - conflicts of interest - occupational crime - professional rights - employee rights - Intellectual Property Rights (IPR) - discrimination.

5. Global Issues 8
Multinational corporations - Environmental ethics - computer ethics - weapons development - engineers as managers-consulting engineers-engineers as expert witnesses and advisors -moral leadership-sample code of Ethics like ASME, ASCE, IEEE, Institution of Engineers(India), Indian Institute of Materials Management, Institution of electronics and telecommunication engineers(IETE),India, etc.

TUTORIAL 15
TOTAL : 60
TEXT BOOKS
1. Mike Martin and Roland Schinzinger, “Ethics in Engineering”, McGraw-Hill, New York 1996.
2. Govindarajan M, Natarajan S, Senthil Kumar V. S, “Engineering Ethics”, Prentice Hall of India, New Delhi, 2004.

REFERENCES
1. Charles D. Fleddermann, “Engineering Ethics”, Pearson Education / Prentice Hall, New Jersey, 2004 (Indian Reprint)
2. Charles E Harris, Michael S. Protchard and Michael J Rabins, “Engineering Ethics – Concepts and Cases”, Wadsworth Thompson Learning, United States, 2000 (Indian Reprint now available)
3. John R Boatright, “Ethics and the Conduct of Business”, Pearson Education, New Delhi, 2003.
4. Edmund G Seebauer and Robert L Barry, “Fundamentals of Ethics for Scientists and Engineers”, Oxford University Press, Oxford, 2001.
CS1402 OBJECT ORIENTED ANALYSIS AND DESIGN 3 1 0 100

AIM
To understand the concepts of object oriented analysis and design.

OBJECTIVES
· To understand the object oriented life cycle.
· To know how to identify objects, relationships, services and attributes through UML.
· To understand the use-case diagrams.
· To know the Object Oriented Design process.
· To know about software quality and usability.

UNIT I INTRODUCTION 8
An Overview of Object Oriented Systems Development - Object Basics – Object Oriented Systems Development Life Cycle.

UNIT II OBJECT ORIENTED METHODOLOGIES 12
Rumbaugh Methodology - Booch Methodology - Jacobson Methodology - Patterns – Frameworks – Unified Approach – Unified Modeling Language – Use case - class diagram - Interactive Diagram - Package Diagram - Collaboration Diagram - State Diagram - Activity Diagram.

UNIT III OBJECT ORIENTED ANALYSIS 9
Identifying use cases - Object Analysis - Classification – Identifying Object relationships - Attributes and Methods.

UNIT IV OBJECT ORIENTED DESIGN 8
Design axioms - Designing Classes – Access Layer - Object Storage - Object Interoperability.

UNIT V SOFTWARE QUALITY AND USABILITY 8
Designing Interface Objects – Software Quality Assurance – System Usability - Measuring User Satisfaction

TOTAL : 45+15 HRS
TEXT BOOKS
1. Ali Bahrami, “Object Oriented Systems Development”, Tata McGraw-Hill, 1999 (Unit I, III, IV, V).
2. Martin Fowler, “UML Distilled”, Second Edition, PHI/Pearson Education, 2002. (UNIT II)

REFERENCE BOOKS
1. Stephen R. Schach, “Introduction to Object Oriented Analysis and Design”, Tata McGraw-Hill, 2003.
2. James Rumbaugh, Ivar Jacobson, Grady Booch “The Unified Modeling Language Reference Manual”, Addison Wesley, 1999.
3. Hans-Erik Eriksson, Magnus Penker, Brain Lyons, David Fado, “UML Toolkit”, OMG Press Wiley Publishing Inc., 2004.

CS1252 OPERATING SYSTEMS 3 0 0 100

AIM
To have a thorough knowledge of processes, scheduling concepts, memory management, I/O and file systems in an operating system.

OBJECTIVES
· To have an overview of different types of operating systems
· To know the components of an operating system.
· To have a thorough knowledge of process management
· To have a thorough knowledge of storage management
· To know the concepts of I/O and file systems.

UNIT I 9
Introduction - Mainframe systems – Desktop Systems – Multiprocessor Systems – Distributed Systems – Clustered Systems – Real Time Systems – Handheld Systems - Hardware Protection - System Components – Operating System Services – System Calls – System Programs - Process Concept – Process Scheduling – Operations on Processes – Cooperating Processes – Inter-process Communication.

UNIT II 9
Threads – Overview – Threading issues - CPU Scheduling – Basic Concepts – Scheduling Criteria – Scheduling Algorithms – Multiple-Processor Scheduling – Real Time Scheduling - The Critical-Section Problem – Synchronization Hardware – Semaphores – Classic problems of Synchronization – Critical regions – Monitors.

UNIT III 9
System Model – Deadlock Characterization – Methods for handling Deadlocks -Deadlock Prevention – Deadlock avoidance – Deadlock detection – Recovery from Deadlocks - Storage Management – Swapping – Contiguous Memory allocation – Paging – Segmentation – Segmentation with Paging.

UNIT IV 9
Virtual Memory – Demand Paging – Process creation – Page Replacement – Allocation of frames – Thrashing - File Concept – Access Methods – Directory Structure – File System Mounting – File Sharing – Protection

UNIT V 9
File System Structure – File System Implementation – Directory Implementation – Allocation Methods – Free-space Management. Kernel I/O Subsystems - Disk Structure – Disk Scheduling – Disk Management – Swap-Space Management. Case Study: The Linux System, Windows

TOTAL : 45
TEXT BOOK
1. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, “Operating System Concepts”, Sixth Edition, John Wiley & Sons (ASIA) Pvt. Ltd, 2003.

REFERENCES
Harvey M. Deitel, “Operating Systems”, Second Edition, Pearson Education Pvt. Ltd, 2002.
Andrew S. Tanenbaum, “Modern Operating Systems”, Prentice Hall of India Pvt. Ltd, 2003.
William Stallings, “Operating System”, Prentice Hall of India, 4th Edition, 2003.
Pramod Chandra P. Bhatt – “An Introduction to Operating Systems, Concepts and Practice”, PHI, 2003.

CS1302 COMPUTER NETWORKS 3 0 0 100

AIM
To introduce the concepts, terminologies and technologies used in modern days data communication and computer networking.

OBJECTIVES
To understand the concepts of data communications.
To study the functions of different layers.
To introduce IEEE standards employed in computer networking.
To make the students to get familiarized with different protocols and network components.

UNIT I DATA COMMUNICATIONS 8
Components – Direction of Data flow – networks – Components and Categories – types of Connections – Topologies –Protocols and Standards – ISO / OSI model – Transmission Media – Coaxial Cable – Fiber Optics – Line Coding – Modems – RS232 Interfacing sequences.

UNIT II DATA LINK LAYER 10
Error – detection and correction – Parity – LRC – CRC – Hamming code – low Control and Error control - stop and wait – go back-N ARQ – selective repeat ARQ- sliding window – HDLC. - LAN - Ethernet IEEE 802.3 - IEEE 802.4 - IEEE 802.5 - IEEE 802.11 – FDDI - SONET – Bridges.

UNIT III NETWORK LAYER 10
Internetworks – Packet Switching and Datagram approach – IP addressing methods – Subnetting – Routing – Distance Vector Routing – Link State Routing – Routers.

UNIT IV TRANSPORT LAYER 9
Duties of transport layer – Multiplexing – Demultiplexing – Sockets – User Datagram Protocol (UDP) – Transmission Control Protocol (TCP) – Congestion Control – Quality of services (QOS) – Integrated Services.

UNIT V APPLICATION LAYER 8
Domain Name Space (DNS) – SMTP – FTP – HTTP - WWW – Security – Cryptography.

TOTAL: 45
TEXT BOOKS
1. Behrouz A. Forouzan, “Data communication and Networking”, Tata McGraw-Hill, 2004.

REFERENCES
James F. Kurose and Keith W. Ross, “Computer Networking: A Top-Down Approach Featuring the Internet”, Pearson Education, 2003.
Larry L.Peterson and Peter S. Davie, “Computer Networks”, Harcourt Asia Pvt. Ltd., Second Edition.
Andrew S. Tanenbaum, “Computer Networks”, PHI, Fourth Edition, 2003.
William Stallings, “Data and Computer Communication”, Sixth Edition, Pearson Education, 2000.

EC1391 TELECOMMUNICATION SYSTEMS 3 0 0 100

AIM
To gain knowledge about microwave, satellite, optical, telephone and cellular communication systems.

OBJECTIVES
To have knowledge about characteristics of Transmission and microwave devices.
To study about the fundamentals of satellite communication
To gain brief knowledge about optical communication
To gain knowledge about optical communication
To gain knowledge about advances in Telephone systems
To understand the essentials of cellular communication systems.

UNIT I METHODS OF COMMUNICATION 9
Transmission lines – Types and Characteristics, Antenna Fundamentals – Different types of antennas & their Characteristics, Radio Frequency wave propagation- Microwave –Principles, Devices (Reflex Klystron, Magnetron, TWT)-(Principles Only) Radar - Pulsed Radar - CW Radar (Principles and Block Diagram Only).

UNIT II INTRODUCTION TO SATELLITE COMMUNICATIONS 9
Satellite orbits- Satellite communication systems –Earth stations- Applications: Surveillance, Navigation, Mobile Communication, TV Broadcast, Satellite Radio, Satellite Telephone-The Internet.

UNIT III INTRODUCTION TO FIBER OPTIC COMMUNICATION 9
Light wave communication systems – Fiber structure and function types of Fiber – Optical Transmitter & Receiver –Fiber optic Data communication systems
UNIT IV TELEPHONE SYSTEM AND ITS APPLICATION 9
Telephones –Telephone system- Facsimile- Cellular telephone system-Paging system –Integrated services Digital Networks (ISDN)

UNIT V CELLULAR RADIO 9
Citizen’s band Radio, Cordless Telephone, Improved Mobile Telephone service (IMTS), Introduction to Advanced Mobile Phone Service (AMPS), GSM – RF channels and time slots – Voice transmission – Frequency Hopping - Subscriber ID module – GSM Privacy and Security – IS-95 CDMA PCS – Channels – Forward Channel – Reverse Channel – Voice Coding – Power Control – Hand-off and CDMA Security.

TOTAL : 45
TEXT BOOKS
1. Louis.E.Frenzel, Communication Electronics – Principles and Application”, 3rd Editions, Tata McGraw-Hill, 2002 (Units I to IV)
2. Roy Blake, “Wireless Communication Technology”, Thomson Delmar Learning, Second Reprint 2002. (UNIT V Chapters: 10, 11)

REFERENCES
1. Wayne Tomasi,”Electronic Communication systems” 4th Edition, Pearson Education, 2001.
Marin Cole, “Introduction to Telecommunications –Voice, Data and Internet”, Pearson Education, 2001.

CS1301 DATABASE MANAGEMENT SYSTEMS 3 1 0 100

AIM
To provide a strong foundation in database technology and an introduction to the current trends in this field.

OBJECTIVES
To learn the fundamentals of data models and to conceptualize and depict a database system using ER diagram.
To make a study of SQL and relational database design.
To understand the internal storage structures using different file and indexing techniques which will help in physical DB design.
To know the fundamental concepts of transaction processing- concurrency control techniques and recovery procedure.
To have an introductory knowledge about the emerging trends in the area of distributed DB- OO DB- Data mining and Data Warehousing and XML.

UNIT I INTRODUCTION AND CONCEPTUAL MODELING 9
Introduction to File and Database systems- Database system structure – Data Models – Introduction to Network and Hierarchical Models – ER model – Relational Model – Relational Algebra and Calculus.

UNIT II RELATIONAL MODEL 9
SQL – Data definition- Queries in SQL- Updates- Views – Integrity and Security – Relational Database design – Functional dependences and Normalization for Relational Databases (up to BCNF).

UNIT III DATA STORAGE AND QUERY PROCESSING 9
Record storage and Primary file organization- Secondary storage Devices- Operations on Files- Heap File- Sorted Files- Hashing Techniques – Index Structure for files –Different types of Indexes- B-Tree - B+Tree – Query Processing.

UNIT IV TRANSACTION MANAGEMENT 9
Transaction Processing – Introduction- Need for Concurrency control- Desirable properties of Transaction- Schedule and Recoverability- Serializability and Schedules – Concurrency Control – Types of Locks- Two Phases locking- Deadlock- Time stamp based concurrency control – Recovery Techniques – Concepts- Immediate Update- Deferred Update - Shadow Paging.

UNIT V CURRENT TRENDS 9
Object Oriented Databases – Need for Complex Data types - OO data Model- Nested relations - Complex Types- Inheritance Reference Types - Distributed databases- Homogenous and Heterogenous- Distributed data Storage – XML – Structure of XML- Data- XML Document- Schema- Querying and Transformation. – Data Mining and Data Warehousing.

TUTORIAL 15
TOTAL : 60
TEXT BOOKS
1. Abraham Silberschatz, Henry F. Korth and S. Sudarshan - “Database System Concepts”, Fourth Edition, McGraw-Hill, 2002.

REFERENCES
Ramez Elmasri and Shamkant B. Navathe, “Fundamental Database Systems”, Third Edition, Pearson Education, 2003.
Raghu Ramakrishnan, “Database Management System”, Tata McGraw-Hill Publishing Company, 2003.
Hector Garcia–Molina, Jeffrey D.Ullman and Jennifer Widom- “Database System Implementation”- Pearson Education- 2000.
Peter Rob and Corlos Coronel- “Database System, Design, Implementation and Management”, Thompson Learning Course Technology- Fifth edition, 2003.

CS1403 CASE TOOLS LAB 0 0 3 100

Prepare the following documents for two or three of the experiments listed below and develop the software engineering methodology.

1. Program Analysis and Project Planning.
Thorough study of the problem – Identify project scope, Objectives, Infrastructure.

2. Software requirement Analysis
Describe the individual Phases / Modules of the project, Identify deliverables.

3. Data Modeling
Use work products – Data dictionary, Use diagrams and activity diagrams, build and test lass diagrams, Sequence diagrams and add interface to class diagrams.

4. Software Development and Debugging

5. Software Testing
Prepare test plan, perform validation testing, Coverage analysis, memory leaks, develop test case hierarchy, Site check and Site monitor.

Suggested List of Applications:
1. Student Marks Analyzing System
2. Quiz System
3. Online Ticket Reservation System
4. Payroll System
5. Course Registration System
6. Expert Systems
7. ATM Systems
8. Stock Maintenance
9. Real-Time Scheduler
10. Remote Procedure Call Implementation

CS1254 OPERATING SYSTEM LAB (Linux based) 0 0 3 100
(Implement the following on LINUX platform. Use C for high level language implementation)

1. Shell programming
- command syntax
- write simple functions
- basic tests
2. Shell programming
- loops
- patterns
- expansions
- substitutions
3. Write programs using the following system calls of UNIX operating system:
fork, exec, getpid, exit, wait, close, stat, opendir, readdir
4. Write programs using the I/O system calls of UNIX operating system (open, read, write, etc)
5. Write C programs to simulate UNIX commands like ls, grep, etc.
6. Given the list of processes, their CPU burst times and arrival times, display/print the Gantt chart for FCFS and SJF. For each of the scheduling policies, compute and print the average waiting time and average turnaround time
7. Given the list of processes, their CPU burst times and arrival times, display/print the Gantt chart for Priority and Round robin. For each of the scheduling policies, compute and print the average waiting time and average turnaround time
8. Implement the Producer – Consumer problem using semaphores.
9. Implement some memory management schemes – I for eg
Free space is maintained as a linked list of nodes with each node having the starting byte address and the ending byte address of a free block. Each memory request consists of the process-id and the amount of storage space required in bytes. Allocated memory space is again maintained as a linked list of nodes with each node having the process-id, starting byte address and the ending byte address of the allocated space.
10. Implement some memory management schemes – II for eg
When a process finishes (taken as input) the appropriate node from the allocated list should be deleted and this free disk space should be added to the free space list. [Care should be taken to merge contiguous free blocks into one single block. This results in deleting more than one node from the free space list and changing the start and end address in the appropriate node]. For allocation use first fit, worst fit and best fit.

CS1307 DATABASE MANAGEMENT SYSTEMS LAB 0 0 3 100

LIST OF EXPERIMENTS
1. Data Definition Language (DDL) commands in RDBMS.
2. Data Manipulation Language (DML) and Data Control Language (DCL) commands in RDBMS.
3. High-level language extension with Cursors.
4. High level language extension with Triggers
5. Procedures and Functions.
6. Embedded SQL.
7. Database design using E-R model and Normalization.
8. Design and implementation of Payroll Processing System.
9. Design and implementation of Banking System.
10. Design and implementation of Library Information System.

MG1351 PRINCIPLES OF MANAGEMENT 3 0 0 100

Objective
Knowledge on the principles of management is essential for all kinds of people in all kinds of organizations. After studying this course, students will be able to have a clear understanding of the managerial functions like planning, organizing, staffing, leading and controlling. Students will also gain some basic knowledge on international aspect of management.

1. Historical Development 9
Definition of Management – Science or Art – Management and Administration – Development of Management Thought – Contribution of Taylor and Fayol – Functions of Management – Types of Business Organisation.

2. Planning 9
Nature & Purpose – Steps involved in Planning – Objectives – Setting Objectives – Process of Managing by Objectives – Strategies, Policies & Planning Premises- Forecasting – Decision-making.

3. Organising 9
Nature and Purpose – Formal and informal organization – Organization Chart – Structure and Process – Departmentation by difference strategies – Line and Staff authority – Benefits and Limitations – De-Centralization and Delegation of Authority – Staffing – Selection Process - Techniques – HRD – Managerial Effectiveness.

4. Directing 9
Scope – Human Factors – Creativity and Innovation – Harmonizing Objectives – Leadership – Types of Leadership Motivation – Hierarchy of needs – Motivation theories – Motivational Techniques – Job Enrichment – Communication – Process of Communication – Barriers and Breakdown – Effective Communication – Electronic media in Communication.

5. Controlling 9
System and process of Controlling – Requirements for effective control – The Budget as Control Technique – Information Technology in Controlling – Use of computers in handling the information – Productivity – Problems and Management – Control of Overall Performance – Direct and Preventive Control – Reporting – The Global Environment – Globalization and Liberalization – International Management and Global theory of Management.
TOTAL : 45
TEXT BOOKS
1. Harold Kooritz & Heinz Weihrich “Essentials of Management”, Tata McGraw-Hill, 1998.
2. Joseph L Massie “Essentials of Management”, Prentice Hall of India, (Pearson) Fourth Edition, 2003.

REFERENCES
1 Tripathy PC And Reddy PN, “ Principles of Management”, Tata McGraw-Hill, 1999.
2. Decenzo David, Robbin Stephen A, ”Personnel and Human Reasons Management”, Prentice Hall of India, 1996
3. JAF Stomer, Freeman R. E and Daniel R Gilbert Management, Pearson Education, Sixth Edition, 2004.
4. Fraidoon Mazda, “Engineering Management”, Addison Wesley,-2000.

IT1351 NETWORK PROGRAMMING AND MANAGEMENT 3 0 0 100

AIM
To enable the students to develop the necessary skills for developing robust & scalable network applications and to build necessary basic knowledge for managing networks.

OBJECTIVES
· To learn the basics of socket programming using TCP Sockets.
· To learn basics of UDP sockets.
· To develop knowledge of threads for developing high performance scalable applications.
· To learn about raw sockets.
· To understand simple network management protocols & practical issues.

UNIT I ELEMENTARY TCP SOCKETS 9
Introduction to Socket Programming – Overview of TCP/IP Protocols –Introduction to Sockets – Socket address Structures – Byte ordering functions – address conversion functions – Elementary TCP Sockets – socket, connect, bind, listen, accept, read, write, close functions – Iterative Server – Concurrent Server.

UNIT II APPLICATION DEVELOPMENT 9
TCP Echo Server – TCP Echo Client – Posix Signal handling – Server with multiple clients – boundary conditions: Server process Crashes, Server host Crashes, Server Crashes and reboots, Server Shutdown – I/O multiplexing – I/O Models – select function – shutdown function – TCP echo Server (with multiplexing) – poll function – TCP echo Client (with Multiplexing)
UNIT III SOCKET OPTIONS, ELEMENTRY UDP SOCKETS 9
Socket options – getsocket and setsocket functions – generic socket options – IP socket options – ICMP socket options – TCP socket options – Elementary UDP sockets – UDP echo Server – UDP echo Client – Multiplexing TCP and UDP sockets – Domain name system – gethostbyname function – Ipv6 support in DNS – gethostbyadr function – getservbyname and getservbyport functions.

UNIT IV ADVANCED SOCKETS 9
Ipv4 and Ipv6 interoperability – threaded servers – thread creation and termination – TCP echo server using threads – Mutexes – condition variables – raw sockets – raw socket creation – raw socket output – raw socket input – ping program – trace route program.

UNIT V SIMPLE NETWORK MANAGEMENT 9
SNMP network management concepts – SNMP management information – standard MIB’s – SNMPv1 protocol and Practical issues – introduction to RMON, SNMPv2 and SNMPv3.

TOTAL : 45 HRS
TEXT BOOKS
1. W. Richard Stevens, “UNIX NETWORK PROGRAMMING Vol-I” Second Edition, PHI / Pearson Education, 1998. (Units – I, II, III & IV.) (Chapter – 1-10, 23, 25)
2. William Stallings, “SNMP, SNMPv2, SNMPv3 and RMON 1 and 2”, Third Edition, Addison Wesley, 1999. (Unit - V) (Chapter – 4-7)

REFERENCE
1. D.E. Comer, “Intrenetworking with TCP/IP Vol- III”, (BSD Sockets Version), second Edition, PHI, 2003.
IT1352 CRYPTOGRAPHY AND NETWORK SECURITY 3 1 0 100

AIM
To understand the principles of encryption algorithms; conventional and public key cryptography. To have a detailed knowledge about authentication, hash functions and application level security mechanisms.

OBJECTIVES
To know the methods of conventional encryption.
To understand the concepts of public key encryption and number theory
To understand authentication and Hash functions.
To know the network security tools and applications.
To understand the system level security used.

UNIT I INTRODUCTION 10
OSI Security Architecture - Classical Encryption techniques – Cipher Principles – Data Encryption Standard – Block Cipher Design Principles and Modes of Operation - Evaluation criteria for AES – AES Cipher – Triple DES – Placement of Encryption Function – Traffic Confidentiality

UNIT II PUBLIC KEY CRYPTOGRAPHY 10
Key Management - Diffie-Hellman key Exchange – Elliptic Curve Architecture and Cryptography - Introduction to Number Theory – Confidentiality using Symmetric Encryption – Public Key Cryptography and RSA.

UNIT III AUTHENTICATION AND HASH FUNCTION 9
Authentication requirements – Authentication functions – Message Authentication Codes – Hash Functions – Security of Hash Functions and MACs – MD5 message Digest algorithm - Secure Hash Algorithm – RIPEMD – HMAC Digital Signatures – Authentication Protocols – Digital Signature Standard
UNIT IV NETWORK SECURITY 8
Authentication Applications: Kerberos – X.509 Authentication Service – Electronic Mail Security – PGP – S/MIME - IP Security – Web Security.

UNIT V SYSTEM LEVEL SECURITY 8
Intrusion detection – password management – Viruses and related Threats – Virus Counter measures – Firewall Design Principles – Trusted Systems.

TUTORIAL 15
TOTAL : 60
TEXT BOOK
1. William Stallings, “Cryptography And Network Security – Principles and Practices”, Prentice Hall of India, Third Edition, 2003.

REFERENCES
1. Atul Kahate, “Cryptography and Network Security”, Tata McGraw-Hill, 2003.
2. Bruce Schneier, “Applied Cryptography”, John Wiley & Sons Inc, 2001.
3. Charles B. Pfleeger, Shari Lawrence Pfleeger, “Security in Computing”, Third Edition, Pearson Education, 2003.

CS1253 VISUAL PROGRAMMING 3 0 0 100

AIM
To make the students to understand the windows programming concepts including Microsoft Foundation Classes.

OBJECTIVES
To introduce the concepts of windows programming
To introduce GUI programming using Microsoft Foundation Classes
To enable the students to develop programs and simple applications using Visual C++

UNIT I WINDOWS PROGRAMMING 9
Windows environment – a simple windows program – windows and messages – creating the window – displaying the window – message loop – the window procedure – message processing – text output – painting and repainting – introduction to GDI – device context – basic drawing – child window controls

UNIT II VISUAL C++ PROGRAMMING – INTRODUCTION 9
Application Framework – MFC library – Visual C++ Components – Event Handling – Mapping modes – colors – fonts – modal and modeless dialog – windows common controls – bitmaps

UNIT III THE DOCUMENT AND VIEW ARCHITECTURE 9
Menus – Keyboard accelerators – rich edit control – toolbars – status bars – reusable frame window base class – separating document from its view – reading and writing SDI and MDI documents – splitter window and multiple views – creating DLLs – dialog based applications

UNIT IV ACTIVEX AND OBJECT LINKING AND EMBEDDING (OLE) 9
ActiveX controls Vs. Ordinary Windows Controls – Installing ActiveX controls – Calendar Control – ActiveX control container programming – create ActiveX control at runtime – Component Object Model (COM) – containment and aggregation Vs. inheritance – OLE drag and drop – OLE embedded component and containers – sample applications

UNIT-V ADVANCED CONCEPTS 9
Database Management with Microsoft ODBC – Structured Query Language – MFC ODBC classes – sample database applications – filter and sort strings – DAO concepts – displaying database records in scrolling view – Threading – VC++ Networking issues – Winsock – WinInet – building a web client – Internet Information Server – ISAPI server extension – chat application – playing and multimedia (sound and video) files

TOTAL : 45
TEXT BOOKS
1.Charles Petzold, “Windows Programming”, Microsoft press, 1996 (Unit I – Chapter 1-9)
2. David J.Kruglinski, George Shepherd and Scot Wingo, “Programming Visual C++”, Microsoft press, 1999 (Unit II – V)

REFERENCES
1. Steve Holtzner, “Visual C++ 6 Programming”, Wiley Dreamtech India Pvt. Ltd., 2003.

IT1353 EMBEDDED SYSTEMS 3 0 0 100

AIM
To give sufficient background for undertaking embedded systems design.

OBJECTIVES
To introduce students to the embedded systems, its hardware and software.
To introduce devices and buses used for embedded networking.
To explain programming concepts and embedded programming in C and C++.
To explain real time operating systems, inter-task communication and an exemplary case of MUCOS – IIRTOS.

UNIT I INTRODUCTION TO EMBEDDED SYSTEMS 9
Definition and Classification – Overview of Processors and hardware units in an embedded system – Software embedded into the system – Exemplary Embedded Systems – Embedded Systems on a Chip (SoC) and the use of VLSI designed circuits

UNIT II DEVICES AND BUSES FOR DEVICES NETWORK 9
I/O Devices - Device I/O Types and Examples – Synchronous - Iso-synchronous and Asynchronous Communications from Serial Devices - Examples of Internal Serial-Communication Devices - UART and HDLC - Parallel Port Devices - Sophisticated interfacing features in Devices/Ports- Timer and Counting Devices - ‘12C’, ‘USB’, ‘CAN’ and advanced I/O Serial high speed buses- ISA, PCI, PCI-X, cPCI and advanced buses.

UNIT III PROGRAMMING CONCEPTS AND EMBEDDED PROGRAMMING IN C, C++ 9
Programming in assembly language (ALP) vs. High Level Language - C Program Elements, Macros and functions -Use of Pointers - NULL Pointers - Use of Function Calls – Multiple function calls in a Cyclic Order in the Main Function Pointers – Function Queues and Interrupt Service Routines Queues Pointers – Concepts of EMBEDDED PROGRAMMING in C++ - Objected Oriented Programming – Embedded Programming in C++, ‘C’ Program compilers – Cross compiler – Optimization of memory codes.

UNIT IV REAL TIME OPERATING SYSTEMS – PART - 1 9
Definitions of process, tasks and threads – Clear cut distinction between functions – ISRs and tasks by their characteristics – Operating System Services- Goals – Structures- Kernel - Process Management – Memory Management – Device Management – File System Organisation and Implementation – I/O Subsystems – Interrupt Routines Handling in RTOS, REAL TIME OPERATING SYSTEMS : RTOS Task scheduling models - Handling of task scheduling and latency and deadlines as performance metrics – Co-operative Round Robin Scheduling – Cyclic Scheduling with Time Slicing (Rate Monotonics Co-operative Scheduling) – Preemptive Scheduling Model strategy by a Scheduler – Critical Section Service by a Preemptive Scheduler – Fixed (Static) Real time scheduling of tasks - INTER PROCESS COMMUNICATION AND SYNCHRONISATION – Shared data problem – Use of Semaphore(s) – Priority Inversion Problem and Deadlock Situations – Inter Process Communications using Signals – Semaphore Flag or mutex as Resource key – Message Queues – Mailboxes – Pipes – Virtual (Logical) Sockets – Remote Procedure Calls (RPCs).

UNIT V REAL TIME OPERATING SYSTEMS – PART - 2 9
Study of Micro C/OS-II or Vx Works or Any other popular RTOS – RTOS System Level Functions – Task Service Functions – Time Delay Functions – Memory Allocation Related Functions – Semaphore Related Functions – Mailbox Related Functions – Queue Related Functions – Case Studies of Programming with RTOS – Understanding Case Definition – Multiple Tasks and their functions – Creating a list of tasks – Functions and IPCs – Exemplary Coding Steps.

TOTAL : 45
TEXTBOOKS
1. Rajkamal, Embedded Systems Architecture, Programming and Design, TATA McGraw-Hill, First reprint Oct. 2003

REFERENCES
1. Steve Heath, Embedded Systems Design, Second Edition-2003, Newnes,
2. David E.Simon, An Embedded Software Primer, Pearson Education Asia, First Indian Reprint 2000.
3. Wayne Wolf, Computers as Components; Principles of Embedded Computing System Design – Harcourt India, Morgan Kaufman Publishers, First Indian Reprint 2001
4. Frank Vahid and Tony Givargis, Embedded Systems Design – A unified Hardware /Software Introduction, John Wiley, 2002.

MA1251 NUMERICAL METHODS 3 1 0 100

AIM
With the present development of the computer technology, it is necessary to develop efficient algorithms for solving problems in science, engineering and technology. This course gives a complete procedure for solving different kinds of problems occur in engineering numerically.

OBJECTIVES
At the end of the course, the students would be acquainted with the basic concepts in numerical methods and their uses are summarized as follows:

· The roots of nonlinear (algebraic or transcendental) equations, solutions of large system of linear equations and eigenvalue problem of a matrix can be obtained numerically where analytical methods fail to give solution.
· When huge amounts of experimental data are involved, the methods discussed on interpolation will be useful in constructing approximate polynomial to represent the data and to find the intermediate values.
· The numerical differentiation and integration find application when the function in the analytical form is too complicated or the huge amounts of data are given such as series of measurements, observations or some other empirical information.
· Since many physical laws are couched in terms of rate of change of one/two or more independent variables, most of the engineering problems are characterized in the form of either nonlinear ordinary differential equations or partial differential equations. The methods introduced in the solution of ordinary differential equations and partial differential equations will be useful in attempting any engineering problem.

UNIT I SOLUTION OF EQUATIONS AND EIGENVALUE PROBLEMS 9+3

Linear interpolation methods (method of false position) – Newton’s method – Statement of Fixed Point Theorem – Fixed point iteration: x=g(x) method – Solution of linear system by Gaussian elimination and Gauss-Jordon methods- Iterative methods: Gauss Jacobi and Gauss-Seidel methods- Inverse of a matrix by Gauss Jordon method – Eigenvalue of a matrix by power method.

UNIT II INTERPOLATION AND APPROXIMATION 9+ 3
Lagrangian Polynomials – Divided differences – Interpolating with a cubic spline – Newton’s forward and backward difference formulas.

UNIT III NUMERICAL DIFFERENTIATION AND INTEGRATION 9+ 3
Derivatives from difference tables – Divided differences and finite differences –Numerical integration by trapezoidal and Simpson’s 1/3 and 3/8 rules – Romberg’s method – Two and Three point Gaussian quadrature formulas – Double integrals using trapezoidal and Simpson’s rules.


UNIT IV INITIAL VALUE PROBLEMS FOR ORDINARY DIFFERENTIAL EQUATIONS 9+ 3
Single step methods: Taylor series method – Euler and modified Euler methods – Fourth order Runge – Kutta method for solving first and second order equations – Multistep methods: Milne’s and Adam’s predictor and corrector methods.

UNIT V BOUNDARY VALUE PROBLEMS IN ordinary AND PARTIAL DIFFERENTIAL EQUATIONS 9+ 3
Finite difference solution of second order ordinary differential equation – Finite difference solution of one dimensional heat equation by explicit and implicit methods – One dimensional wave equation and two dimensional Laplace and Poisson equations.

TUTORIAL 15
TOTAL : 60
TEXT BOOKS
1. Gerald, C.F, and Wheatley, P.O, “Applied Numerical Analysis”, Sixth Edition, Pearson Education Asia, New Delhi, 2002.
2. Balagurusamy, E., “Numerical Methods”, Tata McGraw-Hill Pub. Co. Ltd., New Delhi, 1999.

REFERENCES

Kandasamy, P., Thilagavathy, K. and Gunavathy, K., “Numerical Methods”, S.Chand Co. Ltd., New Delhi, 2003.
Burden, R.L and Faires, T.D., “Numerical Analysis”, Seventh Edition, Thomson Asia Pvt. Ltd., Singapore, 2002.

CS1255 VISUAL PROGRAMMING LAB 0 0 3 100

LIST OF EXPERIMENTS
Windows SDK / Visual C++
Writing code for keyboard and mouse events.
Dialog Based applications
Creating MDI applications

Visual C++
Threads
Document view Architecture, Serialization
Dynamic controls
Menu, Accelerator, Tool tip, Tool bar
Creating DLLs and using them
Data access through ODBC
10. Creating ActiveX control and using it

CS1305 NETWORK LAB 0 0 3 100
(all the programs are to be written using C)

Simulation of ARP / RARP.
Write a program that takes a binary file as input and performs bit stuffing and CRC Computation.
Develop an application for transferring files over RS232.
Simulation of Sliding-Window protocol.
Simulation of BGP / OSPF routing protocol.
Develop a Client – Server application for chat.
Develop a Client that contacts a given DNS Server to resolve a given host name.
Write a Client to download a file from a HTTP Server.
Study of NS2.
Study of Glomosim / OPNET.

MG1401 TOTAL QUALITY MANAGEMENT 3 0 0 100

OBJECTIVE
· To understand the Total Quality Management concept and principles and the various tools available to achieve Total Quality Management.
· To understand the statistical approach for quality control.
· To create an awareness about the ISO and QS certification process and its need for the industries.

INTRODUCTION 9
Definition of Quality, Dimensions of Quality, Quality Planning, Quality costs - Analysis Techniques for Quality Costs, Basic concepts of Total Quality Management, Historical Review, Principles of TQM, Leadership – Concepts, Role of Senior Management, Quality Council, Quality Statements, Strategic Planning, Deming Philosophy, Barriers to TQM Implementation.

TQM PRINCIPLES 9
Customer satisfaction – Customer Perception of Quality, Customer Complaints, Service Quality, Customer Retention, Employee Involvement – Motivation, Empowerment, Teams, Recognition and Reward, Performance Appraisal, Benefits, Continuous Process Improvement – Juran Trilogy, PDSA Cycle, 5S, Kaizen, Supplier Partnership – Partnering, sourcing, Supplier Selection, Supplier Rating, Relationship Development, Performance Measures – Basic Concepts, Strategy, Performance Measure.

STATISTICAL PROCESS CONTROL (SPC) 9
The seven tools of quality, Statistical Fundamentals – Measures of central Tendency and Dispersion, Population and Sample, Normal Curve, Control Charts for variables and attributes, Process capability, Concept of six sigma, New seven Management tools.

TQM TOOLS 9
Benchmarking – Reasons to Benchmark, Benchmarking Process, Quality Function Deployment (QFD) – House of Quality, QFD Process, Benefits, Taguchi Quality Loss Function, Total Productive Maintenance (TPM) – Concept, Improvement Needs, FMEA – Stages of FMEA.

QUALITY SYSTEMS 9
Need for ISO 9000 and Other Quality Systems, ISO 9000:2000 Quality System – Elements, Implementation of Quality System, Documentation, Quality Auditing, TS 16949, ISO 14000 – Concept, Requirements and Benefits.
Total : 45
TEXT BOOK
1. Dale H.Besterfiled, et al., Total Quality Management, Pearson Education, Inc. 2003. (Indian reprint 2004). ISBN 81-297-0260-6.

REFERENCES
1. James R.Evans & William M.Lidsay, The Management and Control of Quality, (5th Edition), South-Western (Thomson Learning), 2002 (ISBN 0-324-06680-5).
2. Feigenbaum.A.V. “Total Quality Management, McGraw-Hill, 1991.
3. Oakland.J.S. “Total Quality Management Butterworth – Hcinemann Ltd., Oxford. 1989.
4. Narayana V. and Sreenivasan, N.S. Quality Management – Concepts and Tasks, New Age International 1996.
5. Zeiri. “Total Quality Management for Engineers Wood Head Publishers, 1991.

IT1401 COMPONENT BASED TECHNOLOGY 3 0 0 100

AIM
To introduce different software components and their application.

OBJECTIVE
· Introduces in depth JAVA, Corba and .Net Components
· Deals with Fundamental properties of components, technology and architecture and middleware.
· Component Frameworks and Development are covered indepth.

UNIT I INTRODUCTION 9
Software Components – objects – fundamental properties of Component technology – modules – interfaces – callbacks – directory services – component architecture – components and middleware

UNIT II JAVA BASED COMPONENT TECHNOLOGIES 9
Threads – Java Beans – Events and connections – properties – introspection – JAR files – reflection – object serialization – Enterprise Java Beans – Distributed Object models – RMI and RMI-IIOP

UNIT III CORBA COMPONENT TECHNOLOGIES 9
Java and CORBA – Interface Definition language – Object Request Broker – system object model – portable object adapter – CORBA services – CORBA component model – containers – application server – model driven architecture

UNIT IV . NET BASED COMPONENT TECHNOLOGIES 9
COM – Distributed COM – object reuse – interfaces and versioning – dispatch interfaces – connectable objects – OLE containers and servers – Active X controls – .NET components - assemblies – appdomains – contexts – reflection – remoting

UNIT V COMPONENT FRAMEWORKS AND DEVELOPMENT 9
Connectors – contexts – EJB containers – CLR contexts and channels – Black Box component framework – directory objects – cross-development environment – component-oriented programming – Component design and implementation tools – testing tools - assembly tools

TOTAL : 45
TEXT BOOK
1. Clemens Szyperski, “Component Software: Beyond Object-Oriented Programming”, Pearson Education publishers, 2003

REFERENCES
1. Ed Roman, “Mastering Enterprise Java Beans”, John Wiley & Sons Inc., 1999.
2. Mowbray, “Inside CORBA”, Pearson Education, 2003.
3. Freeze, “Visual Basic Development Guide for COM & COM+”, BPB Publication, 2001.
4. Hortsamann, Cornell, “CORE JAVA Vol-II” Sun Press, 2002.

IT1402 MOBILE COMPUTING 3 0 0 100

AIM
To provide basics for various techniques in Mobile Communications and Mobile Content services.

OBJECTIVES
· To learn the basics of Wireless voice and data communications technologies.
· To build working knowledge on various telephone and satellite networks.
· To study the working principles of wireless LAN and its standards.
· To build knowledge on various Mobile Computing algorithms.
· To build skills in working with Wireless application Protocols to develop mobile content applications.

UNIT I WIRELESS COMMUNICATION FUNDAMENTALS 9
Introduction – Wireless transmission – Frequencies for radio transmission – Signals – Antennas – Signal Propagation – Multiplexing – Modulations – Spread spectrum – MAC – SDMA – FDMA – TDMA – CDMA – Cellular Wireless Networks.

UNIT II TELECOMMUNICATION NETWORKS 11
Telecommunication systems – GSM – GPRS – DECT – UMTS – IMT-2000 – Satellite Networks - Basics – Parameters and Configurations – Capacity Allocation – FAMA and DAMA – Broadcast Systems – DAB - DVB.

UNIT III WIRLESS LAN 9
Wireless LAN – IEEE 802.11 - Architecture – services – MAC – Physical layer – IEEE 802.11a - 802.11b standards – HIPERLAN – Blue Tooth.

UNIT IV MOBILE NETWORK LAYER 9
Mobile IP – Dynamic Host Configuration Protocol - Routing – DSDV – DSR – Alternative Metrics.

UNIT V TRANSPORT AND APPLICATION LAYERS 7
Traditional TCP – Classical TCP improvements – WAP, WAP 2.0.

TOTAL : 45
TEXT BOOKS
1. Jochen Schiller, “Mobile Communications”, PHI/Pearson Education, Second Edition, 2003. (Unit I Chap 1,2 &3- Unit II chap 4,5 &6-Unit III Chap 7.Unit IV Chap 8- Unit V Chap 9&10.)
2. William Stallings, “Wireless Communications and Networks”, PHI/Pearson Education, 2002. (Unit I Chapter – 7&10-Unit II Chap 9)

REFERENCES
1. Kaveh Pahlavan, Prasanth Krishnamoorthy, “Principles of Wireless Networks”, PHI/Pearson Education, 2003.
2. Uwe Hansmann, Lothar Merk, Martin S. Nicklons and Thomas Stober, “Principles of Mobile Computing”, Springer, New York, 2003.
3. Hazysztof Wesolowshi, “Mobile Communication Systems”, John Wiley and Sons Ltd, 2002.

CS1354 GRAPHICS AND MULTIMEDIA 3 0 0 100

AIM
To impart the fundamental concepts of Computer Graphics and Multimedia.

OBJECTIVES
· To study the graphics techniques and algorithms.
· To study the multimedia concepts and various I/O technologies.
· To enable the students to develop their creativity

UNIT I OUTPUT PRIMITIVES 9
Introduction - Line - Curve and Ellipse Algorithms – Attributes – Two-Dimensional Geometric Transformations – Two-Dimensional Viewing.

UNIT II THREE-DIMENSIONAL CONCEPTS 9
Three-Dimensional Object Representations – Three-Dimensional Geometric and Modeling Transformations – Three-Dimensional Viewing – Color models – Animation

UNIT III MULTIMEDIA SYSTEMS DESIGN 9
An Introduction – Multimedia applications – Multimedia System Architecture – Evolving technologies for Multimedia – Defining objects for Multimedia systems – Multimedia Data interface standards – Multimedia Databases.

UNIT IV MULTIMEDIA FILE HANDLING 9
Compression & Decompression – Data & File Format standards – Multimedia I/O technologies - Digital voice and audio – video image and animation – Full motion video – Storage and retrieval Technologies.

UNIT V Hypermedia 9
Multimedia Authoring & User Interface – Hypermedia messaging - Mobile Messaging – Hypermedia message component – creating Hypermedia message – Integrated multimedia message standards – Integrated Document management – Distributed Multimedia Systems.

TOTAL: 45
TEXT BOOKS
1. Donald Hearn and M.Pauline Baker, “Computer Graphics C Version”, Pearson Education, 2003.
(UNIT I : Chapters 1 to 6; UNIT 2: Chapter 9 – 12, 15, 16)
2. Prabat K Andleigh and Kiran Thakrar, “Multimedia Systems and Design”, PHI, 2003. (UNIT 3 to 5)


REFERENCES
1. Judith Jeffcoate, “Multimedia in practice technology and Applications”, PHI,1998.
2. Foley, Vandam, Feiner, Huges, “Computer Graphics: Principles & Practice”, Pearson Education, second edition 2003.

IT1403 SOFTWARE COMPONENTS LABORATORY 0 0 3 100

LIST OF EXPERIMENTS
1. COM COMPONENT: Development of simple com components in VB and use them in applications. [2 example].
2. ENTERPRISE JAVA BEANS: Deploying EJB for simple arithmetic operator.
3. RMI: Deploying RMI for client server applications. [2 Experiments].
4. Creation Of DLL Using VB And Deploy it in Java [2 Experiments]
5. Naming Services In CORBA
6. DSI, DII IN CORBA.
7. INTER ORB IN COMMUNICATION [IIOP, IOR] Jac ORB & Visi broker ORB
8. STUDYING J2EE SERVER.
9. SIMPLE APPLICATION USING CORBA.

CS1355 GRAPHICS AND MULTIMEDIA LAB 0 0 3 100

1. To implement Bresenham’s algorithms for line, circle and ellipse drawing
2. To perform 2D Transformations such as translation, rotation, scaling, reflection and sharing.
3. To implement Cohen-Sutherland 2D clipping and window-viewport mapping
4. To perform 3D Transformations such as translation, rotation and scaling.
5. To visualize projections of 3D images.
6. To convert between color models.
7. To implement text compression algorithm
8. To implement image compression algorithm
9. To perform animation using any Animation software
10. To perform basic operations on image using any image editing software

IT1451 WEB TECHNOLOGY 3 1 0 100

AIM
To highlight the features of different technologies involved in Web Technology and various Scripting Languages.

OBJECTIVES
Students will get an introduction about various Scripting Languages.
Students will be provided with an up-to-date survey of developments in. Web Technologies.
Enable the students to know techniques involved to support real-time Software development.

UNIT I INTRODUCTION 8
History of the Internet and World Wide Web – HTML 4 protocols – HTTP, SMTP, POP3, MIME, IMAP. Introduction to JAVA Scripts – Object Based Scripting for the web. Structures – Functions – Arrays – Objects.

UNIT II DYNAMIC HTML 9
Introduction – Object refers, Collectors all and Children. Dynamic style, Dynamic position, frames, navigator, Event Model – On check – On load – Onenor – Mouse rel – Form process – Event Bubblers – Filters – Transport with the Filter – Creating Images – Adding shadows – Creating Gradients – Creating Motion with Blur – Data Binding – Simple Data Binding – Moving with a record set – Sorting table data – Binding of an Image and table.
UNIT III MULTIMEDIA 9
Audio and video speech synthesis and recognition - Electronic Commerce – E-Business Model – E- Marketing – Online Payments and Security – Web Servers – HTTP request types – System Architecture – Client Side Scripting and Server side Scripting – Accessing Web servers – IIS – Apache web server.

UNIT IV DATABASE- ASP – XML 10
Database, Relational Database model – Overview, SQL – ASP – Working of ASP – Objects – File System Objects – Session tracking and cookies – ADO – Access a Database from ASP – Server side Active-X Components – Web Resources – XML – Structure in Data – Name spaces – DTD – Vocabularies – DOM methods.

UNIT V SERVLETS AND JSP 9
Introduction – Servlet Overview Architecture – Handling HTTP Request – Get and post request – redirecting request – multi-tier applications – JSP – Overview – Objects – scripting – Standard Actions – Directives.

TUTORIAL 15
TOTAL : 60
TEXT BOOK
1. Deitel & Deitel, Goldberg, “Internet and world wide web – How to Program”, Pearson Education Asia, 2001.

REFERENCES
1. Eric Ladd, Jim O’ Donnel, “Using HTML 4, XML and JAVA”, Prentice Hall of India – QUE, 1999.
2. Aferganatel, “Web Programming: Desktop Management”, PHI, 2004.
3. Rajkamal, “Web Technology”, Tata McGraw-Hill, 2001.

VISUAL PROGRAMMING ,CS1253YEAR/SEM: III/VI

Author: zerlina // Category: ,
Visit blogadda.com to discover Indian blogs



DEPARTMENT OF IT/CSE
SUB CODE: CS1253
SUB NAME: VISUAL PROGRAMMING YEAR/SEM: III/VI


UNIT – I
WINDOWS PROGRAMMING

Part-A (2-MARKS)
1. Write a simple windows program to print “Hello world”.
2. Define and list down the GDI Primitives
3. What is a message?
4. What is a message loop?
5. Define device context?
6. Under what circumstances painting is needed?
7. What are GDI primitives?
8. What are the ways to trigger WM-PAINT message? What does the message do?
9. What is a window programming?
10. List out the main header files in Windows programming
11. What is Hungarian Notation?
12. What are the steps required to create a window?
13. How to register a window class?
14. What is a window class?
15. How to create a window?
16. What is the use of Get Message ( )?
17. What are the actions of windows procedure?
18. What is WM_DESTROY message?
19. Which function is used to terminate the program?
20. What are the fields in MSG structure?
21. What are queued Message and Non queued Message?
22. Give some messages used in Windows

Part-B (16-MARKS)

1. Discuss on Windows Messaging.
2. Explain the VC++ components in detail
3. Explain briefly how to create, display and process the window with necessary program.
4. Explain in detail about the windows message structure and windows procedure
5. Explain the various methods available to get the DC Handle
6. Explain windows GDI in detail
7. Explain GDI Functions and GDI Primitives

UNIT-II
VISUAL C++ PROGRAMMING – INTRODUCTION

Part-A (2-MARKS)

1. Give any four pen styles.
2. Give the default font, pen brush, bitmap.
3. What is appwizard?
4. What is class wizard?
5. What are accelerators?
6. What are the types of dialogs? Give application for each.
7. What is event driven programming?
8. Define Application Framework
9. What are the types of mapping modes?
10. What is the use of SetMapMode command?
11. List out the types of video cards used to display the colors
12. What is resole font?
13. What is the use of GetSystemMetrics function?
14. Differentiate CClientDC and CWindowDC
15. Differentiate Modal and Modeless dialogs
16. What is system modal dialog?
17. List some of the COMDLG32 classes?
18. What are dialog controls?
19. Mention some of the window common controls
20. What are keyboard accelerators? What are the messages generated?
21. What are the types of messages generated by mouse?

Part-B (16-MARKS)

1. Explain MFC Classes
2. Define keyboard Accelerators. Explain the purpose of keyboard Accelerators.
3. Explain Modal and Modeless Dialog with Example
4. Explain window common controls.
5. Explain in detail how you will load a bitmap into your application.
6. Explain the steps with an example for programming a model dialog.
7. Explain the different mapping modes. Compare and construct.
8. Write a program using VC++ to display the character pressed.
9. Write a program using VC++ to display mouse coordinates.

UNIT-III
THE DOCUMENT AND VIEW ARCHITECTURE
Part-A (2-MARKS)

1. What are toolbars?
2. What are the applications of multiple views?
3. Give two examples for MDI. How many child and parent windows are available in MDI program
4. What do DLL contain?
5. What is a serialize function?
6. What is a menu? What are its types?
7. Mention two text editing tools
8. What are the characteristics of SDI frame window?
9. What are the two CFrameWnd member functions?
10. How to make a class serialize?
11. Explain splitter window
12. Differentiate Dynamic and static splitter window
13. What are the functions that treat registry data as either CString objects or unsigned integers?
14. Define DLL
15. Explain document view architecture.
16. What is a view?
17. Differentiate SDI and MDI
18. What are the disadvantages of using DLL
19. What is Load Library ( ) function?
20. What is GetProcAddress ( ) function?

Part-B (16-MARKS)

1. Write a VC++ program to create a menu bar
2. Write a VC++ program to create a Toolbar
3. Write a VC++ program to create a status bar
4. Write a VC++ program to implement DLL
5. Explain SDI and MDI Applications in detail.
6. Differentiate Extension DLL and Regular DLL
7. What is meant by splitter window? How to create dynamic splitter window? Implement a dynamic splitter window in an MFC Application.
8. Explain the document view architecture
9. Develop a calculator using dialog based application.

UNIT –IV
ACTIVEX AND OBJECT LINKING AND EMBEDDING (OLE)
Part-A (2-MARKS)

1. Name two applications of OLE.
2. What is COM?
3. Define DCOM
4. Depict the hierarchy of CRichEdit class.
5. What is an ActiveX control?
6. How ActiveX controls are different from ordinary controls?
7. Write short notes on aggregation
8. What is the use of IUnKnown interface?
9. Mention the features of COM
10. What is class factory?
11. What is the use of CLSIDFromProgID?
12. What do INTERFACE-PART macros do?
13. What is the purpose of DECLARE-INTERFACE-MAP macro?
14. List out the four states that an embedded object can assume?
15. What are the special features of container?
16. How a COM client calls out of process components?
17. Define Object Model
18. Write short notes on versioning.
19. Mention some applications of OLE
20. What is marshaling?

Part-B (16-MARKS)

1. Write down the steps of MFC OLE drag and drop processing with a neat diagram.
2. Highlight the features of COM
3. Explain the steps involved in the creation of active-X control.
4. Explain how you will add an active X control during runtime with necessary program
5. Explain containment and inheritance
6. What is OLE? Explain it in detail.
7. What is an ActiveX control? How to build an application that uses a calendar control in a dialog?

UNIT-V
ADVANCED CONCEPTS

Part-A (2-MARKS)

1. What is meant by multithreading?
2. What is Winsock?
3. Which are the databases we can open with DAO?
4. What are the applications of multithreading?
5. Mention some advantages of DBMS
6. What is process and thread? What are the two kinds of threads in window?
7. Define ODBC?
8. What are the methods of Binary interface method?
9. What is RFX and where it is used?
10. What is the use of CRecordSet dynamic?
11. What are the steps to create sample database?
12. How to use Single Row Functions?
13. What are Data Transfer and its two structures?
14. List the MFC WinInet Classes
15. List the advantages of WinInet over Winsock
16. Define ISAPI Server Extensions
17. List MFC ISAPI Server Extension classes
18. List the components of OLEDB Architecture
19. Define IIS
20. Define WinInet

Part-B (16-MARKS)

1. Explain how database connectivity can be achieved using ODBC. Write necessary
coding and also write coding to query the database.
2. Explain how threading is achieved in VC++.
3. What is DBMS? What is SQL? Explain MFC ODBC Classes? Explain filter and sort
strings?
4. Explain with example the Winsock class in detail
5. Explain Chat Application
6. Write a VC++ program to build a web client using WinInet.
7. Explain IIS with suitable example

NETWORK PROGRAMMING AND MANAGEMENT, CS1351,YEAR/SEM: III/VI

Author: zerlina // Category: ,
DEPARTMENT OF INFORMATION TECHNOLOGY
SUB CODE: CS1351
SUB NAME: NETWORK PROGRAMMING AND MANAGEMENT YEAR/SEM: III/VI

UNIT – I
ELEMENTARY TCP SOCKETS

Part-A (2-MARKS)
1. Define TCP and UDP.
2. Explain IP.
3. Define the three states of TCP connection establishment and termination.
4. Define socket and List out its types.
5. Explain socket address structure.
6. Explain IPv4 address structure.
7. What are the four functions to pass socket address structure from kernel to the process?
8. What are the 2 ways to store 2 bytes in memory?
9. What is byte ordering function?
10. What are elementary socket functions?
11. What are concurrent servers?
12. What address conversion functions explain
13. What are the three types of socket function?
14. Explain iterative server.
15. Define server? What are the types of server?
Part-B (16-MARKS)
1. i) Compare the implementation details of concurrent and iterative server. (8)
ii) Discuss the syntactical issues of various address conversion function. (8)
2. i) Compare the IPV4,IPV6, Unix domain and data link socket address structures. State
your assumptions. (8)
ii) Write notes on byte ordering functions (8)
3. i) Explain in detail about TCP/IP protocols for internetworking and management(10)
ii) Explain about socket, connect, bind, listen and accept functions. (6)
4. Explain TCP/IP layering in detail with neat sketch.(16).
5. Explain in detail about address conversion functions (16).
UNIT-II
APPLICATION DEVELOPMET

Part-A (2-MARKS)
1. Explain TCP Echo server and client.
2. Define signal?
3. Explain signal function.
4. What is wait and Waitpid function?
5. What is the difference between wait and Waitpid function
6. Explain crashing of server host
7. Explain Shutdown of server host
8. Explain the syntax of signal function.
9. Explain I/O multiplexing.
10. What are the scenarios used in I/O multiplexing applications.
11. What are the 5 basic I/O models available in UNIX?
12. State where POSIX function is used.
13. Define the two terms used in POSIX.
14. What are the possibilities of select function?
15. What are the three select descriptor arguments?
16. Difference between close function and shutdown function.
17. Difference between select function and pselect function.
18. Define poll function.
19. Difference between poll function and select function.
20. What are the three conditions handled with the socket.
21. What are the three classes of data identified by poll?
Part-B (16-MARKS)
1. Write a TCP socket program to implement an Echo server/Echo client. (16)
2. Explain the following concept with suitable example (16)
i) Shutdown function
ii) Server host crashes
iii) Input output models
iv) Posix signal
3. Discuss the following scenario of server operations
i) Crashing of server host (6)
ii) Crashing and rebooting of server host (6)
iii) Shutdown of server host (4)
4. Explain in detail about the various I/O models in Unix operating system (16)
5. Explain in detail about
i) POSIX signal handling (8)
ii) Boundary conduction (8)
UNIT-III
SOCKET OPTIONS, ELEMENTRY UDP SOCKETS

Part-A (2-MARKS)
1. What are various ways to get and set the options that affect a socket?
2. Explain Elementary UDP sockets.
3. Explain UDP server and UDP client.
4. What are the two functions used in Elementary UDP
5. Difference between main function and dg_echo function.
6. What are the four steps used in client processing loop.
7. Difference between server function dg_echo and client function dg_cli.
8. Define DNS
9. Define Resource Records
10. What are the types which affect the RRS?
11. Define Resolvers and Name servers.
12. Explain Gethostbyname function
13. State the role of pointer queries in DNS.
14. What are the three ways to set RES_USE_INET6?
15. Explain gethostbyaddr function.
16. What are uname function
17. Explain gethostname function.
18. Explain getservbyname and getservbyport functions.
19. Explain IPv4 socket option.
20. Explain ICMPv4 socket option.
21. Explain IPv6 socket option.
Part-B (16-MARKS)
1. i) Assume both a client and server set the SO_KEEPALIVE socket option and the
connectivity is maintained between the peers but them is no exchange of data. When the
keepalive timer expires every 2 hours, how many TCP segments are exchanged across
the connection? justify your answer with an illustration. (6)
ii) Write a program that checks all the socket option of a socket and sets the value for
receiver buffer size to 520 bytes. (10)
2. i) Write notes on RES_USE_INET6 resolver option in gethostbyname and gethostbyname2
functions. (8)
ii) Discuss any four TCP socket option in detail. (8)
3. i) Discuss about IP socket option and ICMP socket options in detail with suitable
example (8)
ii) Write the similarities between UDP socket, TCP socket and raw socket. (8)
4. i) Explain the purpose and usage of UDP sockets and their different functions (10)
ii) Brief the way in which a TCP client server different from UDP client server (6)
5. Briefly discuss about DNS with an example (16)
6. Briefly discuss about TCP Echo server and client (16)
7. Briefly discuss about UDP Echo server and client (16)
UNIT –IV
ADVANCED SOCKETS

Part-A (2-MARKS)
1. Explain IPv4 and IPv6 server.
2. What are Address Testing macros
3. Explain the implementations of threads.
4. What are the advantages and disadvantages of threads?
5. What are the basic function of thread creation and termination?
6. Define thread?
7. List out the unique values maintained by a thread.
8. What are the common thread interfaces?
9. Explain thread function.
10. Define multithreading
11. Mention the purpose of ping program.
12. Explain traceroute program
13. Define mutexes
14. Explain basic thread functions.
15. Explain raw sockets.
16. Define proto structure.
17. Differentiate ping and traceroute program.
Part-B (16-MARKS)
1. i) compare i) Fork and Thread (4)
ii) Wait and Waitpid (4)
ii) Write a ‘C’ program that can generate an ICMPv4 echo request packet and process
the received ICMPv4 echo reply. (8)
2. Write notes on
i) raw socket creation (4)
ii) raw socket output (6)
iii) raw socket input (6)
3. i) Explain how a TCP echo server using thread created and also give their advantages. (10)
ii) Write short notes on mutexes and condition variables.
4. i) Compare IPv4 and IPv6 (8)
ii) Explain about thread creation and thread termination with suitable example. (8)
5. Explain the trace route program with sample code and example (16)
6. Explain in detail IPv4 and IPv6 interoperability (16)
UNIT-V
SIMPLE NETWORK MANAGEMENT

Part-A (2-MARKS)
1. Define SNMP.
2. What are the key elements of TCP/IP network management?
3. Define MIB
4. Define message agent
5. Define SMI
6. What are the four nodes under the internet node in SMI document
7. Explain private MIBs.
8. What are the limitations of MIBs?
9. What are the limitations of SNMP
10. Define RMON
11. What are the design goals of RMON
12. Explain RMON MIB
13. What are the advantages of SNMPv2
14. Explain SNMPv3
15. What are the disadvantages of SNMPv1/v2
16. Where does RMON used in network.
Part-B (16-MARKS)
1. i) Explain the data types in UNIVERSAL class of ASN.1 for SNMP MIB (8)
ii) Write notes on Network configuration control (8)
2. Explain the syntax of the various SNMPv1 message formats (16)
3. Explain the architecture of SNMP entity and traditional SNMP manager, as specified inRFC2271. (16)
4. Explain the architecture of SNMPV3 with neat diagram.
5. i) Compare SNMPV2 and SNMPV3 (6)
ii) Discuss about MIB (6)
iii) Write note on RMON (4)

PRINCIPLES OF MANAGEMENT,MG1351,YEAR/SEM: III/VI

Author: zerlina // Category: ,
DEPARTMENT OF INFORMATION TECHNOLOGY
SUB CODE: MG1351
SUB NAME: PRINCIPLES OF MANAGEMENT YEAR/SEM: III/VI
UNIT – I
HISTORICAL DEVELOPMENT

Part-A (2-MARKS)
1. Define Management.
2. Define Productivity.
3. What are the functions of Managers?
4. Write the different levels of Management with examples.
5. What is meant by Social audit?
6. What are the effective characteristics of Managers?
7. Write any two main differences between Management and Administration.
8. Define Effectiveness.
9. Define Efficiency. 10. Give the main importance of Management.
PART B (16-MARKS)
1. Explain briefly about the functions of Managers. (16)
2. What are the 14 principles of Henry Fayol? Explain. (16)
3. Explain briefly about the different factors affecting the Organisational environment.
(16)
4. Explain the Development of Management Thought. (16)
5. Management : Science or Art – Discuss. (16)
UNIT-II
PLANNING

PART A ( 2 Marks)
1. Define Planning.
2. Define Strategies.
3. Define Objectives and Goals.
4. What are the different types of Plans?
5. What is meant by Policies?
6. State the steps in Planning.
7. Define MBO.
8. Define Programs.
9. Define TOWS Matrix.
10. What do you understand by Decision Making?
PART B (16-MARKS)
1. Explain the Decision Making Process. (16)
2. Explain briefly about the various Forecasting Methods. (16)
3. Explain the Process of MBO. (16)
4. Explain in briefly about the TOWS Matrix. (16)
5. Define Policies. Give its types. Explain the Planning Premises.(16)
UNIT-III
ORGANISING

PART A ( 2 Marks)
1. Give the main difference between the Formal and Informal Organisation.
2. Define Span of Management.
3. What are all the steps in Organizing?
4. Discuss “Departmentation”.
5. What are the different types of Departmentation?
6. Define Decentralization.
7. What is the purpose of Organisation charts?
8. Define Staffing.
9. What is meant by Performance Appraisal? 10.What is Human Resource Planning?
PART B (16-MARKS)
1. Explain briefly about the various types of Departmentation. (16)
2. Explain briefly about the types of Organisational Structures. (16)
3. Discuss the Span of Management/Managerial Effectiveness. (16)
4. Explain briefly about the Selection Process. (16)
5. Discuss briefly the various steps involved in Organizing. (16)
UNIT –IV
DIRECTING

PART A ( 2 Marks)
1. Define Leading.
2. What are the difference between creativity and innovation?
3. Define Motivation.
4. What are the elements in the Maslow hierarchy of needs?
5. Define Leadership.
6. List out the various styles of Leadership with examples.
7. Define Communication.
8. What is meant by downward communication?
9. Define Operations Research.
10. What do you understand by JIT?
PART B (16-MARKS)
1. Explain briefly about any three theories of Motivation. (16)
2. Explain briefly about the various functions of Leader. (16)
3. Explain in detail about the Creativity and Innovation. (16)
4. Explain the leadership with its different styles. (16)
5. Discuss in detail about the process and types of Motivation. (16)
UNIT-V
CONTROLLING

PART A ( 2 Marks)
1. Define Controlling.
2. What are the steps involved in the control process?
3. Define Budgeting.
4. What is meant by MIS?
5. What is international business?
6. Define Globalisation.
7. What is MNC? Give an example.
8. Define Reporting.
9. What are benefits of IT in controlling?
10. What do you mean by PERT?
PART B (16-MARKS)
1. Explain the difference between Japanese and U.S. Management. (16)
2. Explain in detail about MNCs. (16)
3. Discuss in detail about the Tools and techniques used for improving Productivity. (16)
4. Explain the term ‘Reporting’. (16)
5. Explain the preventive control mechanism towards achieving a unified global
management theory. (16)

Embedded Systems,IT1353 Year/ Sem: III / VI

Author: zerlina // Category: ,
DEPARTMENT OF INFORMATION TECHNOLOGY
Subject Code: IT1353 Year/ Sem: III / VI
Subject Name: Embedded Systems
UNIT-I
Introduction to Embedded Systems

Part – A (2 MARKS)
1. Define a System.
2. What is an embedded system?
3. What are the main components of an embedded system?
4. Define embedded microcontroller.
5. What are the various classifications of embedded systems?
6. What are the two essential units of a processor on a embedded system?
7. What does the execution unit of a processor in a embedded system do?
8. Give examples for general purpose processor.
9. Define microprocessor.
10. When is Application Specific System processors (ASSPs) used in an embedded system?
11. What is the need for LCD and LED displays?
12. Define ROM image.
13. Define device driver.
14. Name some of the software’s used for the detailed designing of an embedded system.
15. What are the various models used in the design of a embedded system?
16. Give some examples for small scale embedded systems.
17. Give some examples for medium scale embedded systems
18. Give some examples for sophisticated embedded systems
Part – B (16 MARKS)
1. List the hardware units that must be present in the embedded systems.
2. i) Explain the Exemplary applications of each type of embedded system. (8)
ii) Explain the different program layers in the embedded software and also the process of
converting a “C” program into the file for ROM image with suitable block diagrams. (8)
3. Explain the Embedded System on Chip (SoC) & in VLSI circuit.
4. i) Explain the various form of memories present in a system (8)
ii)Explain the software tools in designing of an embedded system. (8)
Unit-II
Devices and Buses for Devices Network

Part – A (2 MARKS)
1. Differentiate synchronous communication and iso-synchronous communication.
2. What are the two characteristics of synchronous communication?
3. What are the three ways of communication for a device?
4. Expand a) SPI b) SCI
5. Explain any two forms of a counter
6. Define software timer.
7. What is I2C?
8. What are the bits in I2C corresponding to?
9. What is a CAN bus? Where is it used?
10. What is USB? Where is it used?
11. What are the features of the USB protocol?
12. Explain briefly about PCI and PCI/X buses.
13. Why are SPCI parallel buses important?
14. Define half-duplex communication.
15. Define full duplex communication.
16. Define Real Time Clock (RTC)?
17. Define Time-out or Time Overflow?
Part – B (16 MARKS)
1. i) Explain the parallel port devices. (8)
ii) Explain the sophisticated interfacing features in device ports. (8)
2. Explain the timer and counting devices
3. i) Explain the signal using a transfer of byte when using the I2C bus and also the format of bits at the
I2C bus with diagram. (8)
ii)Explain the internal serial communication devices. (8)
4. Explain the following parallel communication devices:
i) ISA bus (8)
ii) PCI and PCI/X (8)
Unit – III
Programming Concepts and Embedding Programming in C,C++

Part – A (2 MARKS)
1. What is Development Cycle?
2. Define In-line assembly
3. What is Object oriented programming?
4. Define Class.
5. Differentiate Scalar data type and Reference data type.
6. Define NULL function
7. What is a Runtime Library?
8. What is Multiple Inheritance?
9. Define Exception handling
10. What is IO stream?
11. What is a Foundation class?
12. What is a Class library?
13. Define Modularity and Robustness
14. What is Platform Independence?
15. What is a Preprocessor Directive?
16. What is a Data structure?
Part – B (16 MARKS)
1. i) Tabulate program elements: Macros and Functions and their uses. (8)
ii) Explain the use of pointers, NULL pointers (8)
2. i) Explain the multiple function calls in the cyclic order in the main. Also write the advantages of
building ISR queues. Explain (8)
ii) Explain the ‘C’ program compiler and cross compiler. (8)
3. i) Explain the optimization of memory codes. (8)
ii)Explain the Embedded programming in C++. (8)
4. Explain the function pointers, function queues and ISR queues. (16)
Unit – IV
Real time Operating Systems – Part -1

Part – A (2 MARKS)
1. Define process.
2. Define task and Task state.
3. Define Task Control Block (TCB)
4. What is a thread?
5. Define Synchronization.
6. Define Inter process communication.
7. What is shared data problem?
8. Define Semaphore.
9. Define Mutex.
10. Differentiate counting semaphore and binary semaphore.
11. What is Buffer?
12. What is Priority inversion?
13. What is Deadlock situation?
14. Define Message Queue.
15. Define Mailbox and Pipe.
16. Define Socket.
17. Define Remote Procedure Call.
Part – B (16 MARKS)
1. i) Explain the goals of operating system services. (8)
ii) Explain the three alternative systems in three RTOS for responding a hardware source call with the
diagram. (8)
2. i) Explain the scheduler in which RTOS insert into the list and the ready task for sequential execution
in a co-operative round robin model. (8)
ii) Explain the fifteen point strategy for synchronization between the processes, ISRs, OS functions
and tasks for resource management. (8)
3. i) Explain the critical section service by a preemptive scheduler. (8)
ii) Explain the Rate Monotonic Co-operative scheduling. (8)
Unit – V
Real time Operating Systems – Part -2

Part – A (2 MARKS)
1. Name any two important RTOS.
2. What is meant by well tested and debugged RTOS?
3. What is sophisticated multitasking embedded system?
4. Name any two mailbox related functions.
5. Name any two queue related functions for the inter task communications.
6. Name some application for the Vx Works RTOS.
7. How is Vx Works TCB helpful for tasks?
8. What are the various features of Vx Works?
9. What is an active task in the context of Vx Works?
10. What are the task service functions supported by Vx Works?
11. Name any four interrupt service functions supported by Vx Works?
12. Name some of the inter process communication function.
13. Name some of the inter process communication function used for messaging.
14. What are Vx Works pipes?
15. What is signal servicing function?
16. What are the different types of scheduling supported by Vx Works?
Part – B (16 MARKS)
1. Draw and explain basic system of an Automatic chocolate vending system
2. Discuss with the diagram task synchronization model for a specific application
3. i)Explain the case study of an embedded system for a smart card. (8)
ii) Explain the features of Vx Works. (8)
4. Explain the RTOS programming tool MicroC/OS-II.

Cryptography and Network Security Year / Sem: III / VI

Author: zerlina // Category: ,
DEPARTMENT OF INFORMATION TECHNOLOGY
Subject Code: IT1352
Subject Name: Cryptography and Network Security Year / Sem: III / VI

UNIT I - INTRODUCTION
PART-A
1. What are the essential ingredients of a symmetric cipher?
2. What are the two basic functions used in encryption algorithms?
3. How many keys are required for two people to communicate via a cipher?
4. What is the difference between a block cipher and a stream cipher?
5. What are the two approaches to attacking a cipher?
6. What is the difference between an unconditionally secure cipher and a computationally secure
cipher?
7. Briefly define the Caesar cipher.
8. Briefly define the monoalphabetic cipher?
9. Briefly define the playfair cipher.
10. What are the two problems with one-time pad?
11. What is a transposition cipher?
12. What is Steganography?
13. Why is it important to study feistel cipher?
14. Why is it not practical to use an arbitrary reversible substitution cipher?
15. What is the difference between diffusion and confusion?
16. Which parameters and design choices determine the actual algorithm of a feistel cipher?
17. What is the purpose of the S-boxes in DES?
18. Explain the avalanche effect.
19. What is the difference between a mono alphabetic cipher and a poly alphabetic cipher?
20. List the types of cryptanalytic attacks.
PART-B
1. Explain the OSI Architecture. (16)
2. Explain Classical Encryption Techniques. (16)
3. Describe about Traffic Confidentiality. (8)
4. Briefly explain about DES design criteria? (8)
5. Briefly describe about the Strength of DES? (8)
6. Briefly explain Block Cipher modes of Operation (16)
7. Briefly explain about AES design criteria? (16)
8. Explain Triple DES with neat diagram (8)
UNIT II – PUBLIC KEY ENCRYPTION
PART-A
1. What is the difference between differential and linear cryptanalysis?
2. Define product cipher.
3. What was the original set of criteria used by NIST to evaluate candidate AES cipher?
4. What was the final set of criteria used by NIST to evaluate candidate AES ciphers?
5. What is power analysis?
6. What is the purpose of the State array?
7. How is the S-box constructed?
8. Briefly describe Sub Bytes.
9. Briefly describe Shift Rows.
10. How many bytes in State are affected by Shift Rows?
11. Briefly describe Mix Columns.
12. Briefly describe Add Round Key.
13. Briefly describe the Key Expansion Algorithm.
14. What is the difference between Sub Bytes and Sub Word?
15. What is the difference between Shift Rows and Rot Word?
16. Why do some block cipher modes of operation only use encryption while others use both
encryption and decryption?
17. What is triple encryption?
18. What is a meet-in-the-middle attack?
19. How many keys are used in triple encryption?
20. What is the key size for Blowfish?
PART-B
1. Explain about the various Key management techniques. (16)
2. Describe Diffie-Hellman Key Exchange. (16)
3. Explain RSA algorithm. (8)
4. Describe Public Key Cryptography. (8)
5. Explain Elliptic Curve Architecture. (16)
UNIT III - AUTHENTICATION AND HASH FUNCTION
PART-A
1. What primitive operations are used in Blowfish?
2. What common mathematical constants are used in RC5?
3. What primitive operations are used in RC5?
4. List important design considerations for a stream cipher.
5. Why is it not desirable to reuse a stream cipher key?
6. What primitive operation is used in RC4?
7. For user workstation in a typical business environment, list potential locations for confidentiality
attacks.
8. What is the difference between link and end-to-end encryption?
9. What types of information might be derived from a traffic analysis attack?
10. What is traffic padding and what is its purpose?
11. List ways in which secret keys can be distributed to two communicating parties.
12. What is the difference between a session key and a master key?
13. What is nonce?
14. What is key distribution center?
15. What is the difference between statistical randomness and unpredictability?
16. What is the difference between Rijndael and AES?
17. Why is the middle portion of 3DES a decryption rather than an encryption?
18. What is the difference between the AES decryption algorithm and the equivalent inverse cipher?
PART-B
1. Explain Authentication Functions. (16)
2. Briefly Explain HMAC algorithm. (8)
3. Describe RIPEMD-160. (16)
4. Explain Hash Functions. (16)
5. Explain Digital Signature Standard. (8)
6. Briefly explain about MD5 algorithm? (8)
7. Briefly describe about the Secure Hash Algorithm? (8)
8. Explain authentication protocol (8)
UNIT IV NETWORK SECURITY
PART - A
1. Define Kerberos.
2. What are the requirements involved in Kerberos?
3. Define Kerberos Realm.
4. What are the technical deficiencies involved in the Kerberos Version 4?
5. What are the elements include in the Public-Key Certifications?
6. What are the two types of Certificates?
7. Define PGP.
8. Define Public Key Management.
9. Define S/MIME.
10. Define Multipart type.
11. What are the applications involved in IP Security?
12. What are the IP Security Mechanisms?
13. Define Authentication Header.
14. Define Authentication Data.
15. Define Padding.
16. What are the services provided by the SSL Record Protocol?
17. What are the key features of SET?
18. Define Certification Authority.
19. What are the Applications required by the Kerberos Servers?
PART – B
1. Define Kerberos Version 4.(16)
2. Define Kerberos Version 5.(16)
3. Explain briefly about X.509 Authentication Service.(16)
4. Discuss about the concept of Electronic Mail Security.(16)
5. Define S/MIME.(8)
6. Discuss briefly about IP Security.(16)
7. Explain with elaborate about the Web Security Considerations.(16)
8. Explain briefly about the Secure Electronic Transaction.(16)
9. Explain in detail about the IP Security Architecture(16)
10. Explain in detail about the Authentication Header.(16)
11. Discuss briefly about Pretty Good Privacy.(8)
UNIT V SYSTEM LEVEL SECURITY
PART – A
1. Define Masquerader.
2. Define Misfeasor.
3. Define Clandestine User.
4. What are the Techniques involved in intrusion?
5. What are the approaches involved in the Intrusion Detection?
6. Define Rule-Based Anomaly detection.
7. What re the Major issues derived by Porras about the design of a distributed intrusion
detection system?
8. What are the three main components involved in the distributed intrusion Detection
System?
9. Define Honeypots.
10. What are the three purposes defined by salt?
11. Define Computer generated passwords.
12. Define reactive password checking.
13. Define Trojan Horses.
14. Define Logic Bomb.
15. Define Virus.
16. What are the four phases involved in the Virus?
17. List out the types of Viruses?
18. What are the Characteristics of Firewall?
PART – B
1. List and briefly define three classes of Intruders.(8)
2. List and briefly define four techniques used to avoid guessable passwords.(8)
3. What is the role of compression in the operation of a virus?(16)
4. What is the role of encryption in the operation of a virus?(16)
5. What is DDoS?(8)
6. Explain briefly about the trusted systems.(16)

Followers