You are on page 1of 13

# B.TECH. (IT) 6th SEMESTER Computer Networks (IT-302) L 3 T 1 P Cr 3.

## 5 External Marks: 60 Internal Marks: 40

B.TECH. (IT) 6th SEMESTER Unix /Linux OS & Shell Programming (IT-304) L 3 T 1 P Cr 3.5 External Marks: 60 Internal Marks: 40 Total Marks: 100

## Time Duration: 3 Hrs.

B.TECH. (IT) 6th SEMESTER Theory of Computation (IT-306) L 3 T 1 P Cr 3.5 External Marks: 60 Internal Marks: 40 Total Marks: 100

## Time Duration: 3 Hrs.

NOTE: Eight questions are to be set in all by the examiners taking at least two questions from each unit. Students will be required to attempt five questions in all selecting at least one question from each unit UNIT - 1 Finite Automata and Regular Expression: Finite State System, Basic Definition Non-Deterministic finite Automata (NDFA), Deterministic finite Automata (DFA), Equivalence of DFA and NDFA Finite Automata with E-moves, Regular expression, Equivalence of finite Automata and expression, Regular expression conversion and vice-versa. UNIT - 2 Introduction to Machines: Concept of basic machines, Properties and limitations of FSM, Moore and Mealy Machines, Equivalence of Moore and Mealy Machines. Properties of Regular sets: The Pumping Lemma for regular sets, Application of the pumping Lemma, Closure Properties of regular sets, Myhill-Nerode Theorem and minimization of Finite Automata, Minimization Algorithm. UNIT - 3 Grammars: Definition, Context free and Context sensitive Grammar, Ambiguity regular grammar, Reduced forms, Removal of useless symbols and unit production, Chomsky Normal Form (CNF), Griebach Normal Form (GNF). Pushdown Automata: Introduction to push-down machines. UNIT - 4 Turing Machines, Deterministic and Non-Deterministic Turing Machines, Design of T.M, Halting Problem of T.M., PCP problem Chomsky Hierarchy: Chomsky hierarchies of grammars, unrestricted grammar, Context sensitive Language, Relation between languages of classes. Computability: Basic Concepts, Primitive Recursive functions. TEXT BOOKS Elements of the Theory of Computation, Lewis & Papadimitriou: PHI, New Delhi. Introduction to Languages and the Theory of Computation, John C. Martin: MGH, New Delhi. REFERENCE BOOKS Introduction to Computer Theory: Daniel I.A. Cohen: John Wiley, New Delhi. Introduction to Automata Theory Languages and Computation, J.E. Hopcroft and J.D. Ullman: Narosa Publications, New Delhi. Theory of Automata and Formal Languages by R. B. Patel, & Prem Nath, Umesh Publication, New Delhi. Introduction to Automata Theory, Languages & Computations, Hopcroaft & O.D.Ullman, R.Motwani. Theory of Computer Sc. (Automata, Language & Computation): K.L.P.Mishra & N.Chandershekaran. Introduction to Formal Language & Automata Peter Linz.

B.TECH. (IT) 6th SEMESTER Web & .Net Technologies (IT-308) L 3 T 1 P Cr 3.5 External Marks: 60 Internal Marks: 40 Total Marks: 100

## Time Duration: 3 Hrs.

Data Binding with Controls like Text Boxes, List Boxes, Checkboxes, Comboboxes, checked list boxes, Data grid. Navigating in datasets, Data validation Classes for handling database in code: OleDbConnection, Sqlconnection, OracleConnection, OleDbCommand, SqlCommand, OracleCommand, OleDbDataAdapter, SqlDataAdapter, DataSet, OleDbDataReader, SqlDataReader, Data Table, Data Row, Data Column, Data Relation

B.TECH. (IT) 6th SEMESTER Computer Graphics (IT-310) L 3 T 1 P Cr 3.5 External Marks: 60 Internal Marks: 40 Total Marks: 100

## Time Duration: 3 Hrs.

NOTE: Eight questions are to be set in all by the examiners taking at least two questions from each unit. Students will be required to attempt five questions in all selecting at least one question from each unit UNIT-1 Introduction: What is Computer Graphics, Computer Graphics Applications, Computer Graphics hardware and Software , Two dimensional Graphics primitives: Points and Lines, Point plotting Techniques: Coordinate system , Increment method , Line drawing algorithm : DDA, Bresenhams circle drawing algorithm: Using polar coordinates, Mid point circle drawing algorithms, filled area algorithm: Scan line, Polygon filling algorithms, Boundary filled algorithms. Point & Positioning devices: light pen, mouse, Tablet, Input technique, positioning technique, and character recognition. UNIT-2 Two Dimensional Viewing: Viewing pipeline, Window to view port transformation, Window to view port mapping Clipping: point & line clipping algorithm, 4 bit code algorithm. 4 bit code algorithm Cohen Sutherland line clipping algorithms, Liang Barsky line clipping algorithms Polygon clipping: Sutherland Hodge land Polygon clipping algorithm. Curve clipping, Text clipping. UNIT-3 Three Dimensional Viewing: Viewing pipeline, viewing coordinates, Projection: Parallel, perspective Two Dimensional Geometric transformations: Two Dimensional Transformations: Transformations, Translation, Scaling, Rotation, Other Transformations Reflection, shear, Homogenous Coordinate System Raster Graphics: Raster Graphics fundamental, Solid Area, Scan Conversion, Interactive Raster Graphics and Raster Graphics System. UNIT-4 Representation of 3-D curves and surfaces: Curved lines and surfaces, spline representations, interpolation and approximation splines, parametric continuity conditions. Bezier curves and surfaces: Bezier curves, properties of Bezier curves, Bezier surfaces B- spline curves and surfaces. Hidden Surfaces removal: Hidden surface elimination, depth buffer algorithm, scan line coherence algorithm, priority algorithm. TEXT BOOKS Computer Graphics, 2nd Ed., Hern & Baker PHI, New Delhi. Computer Graphics Principles and Practice, 2nd Edition by Foley, Van Dam, Feiner and Hughes.-Addison-Wesley Pub Company. Computer Graphics, Schaums Outline Series, MGH Publications. REFERENCE BOOKS Principles of Computer Graphics Theory & Practice Using Open GL and Maya University Press,Hyderabad.

## Computer Graphics - A Programming Approach, Harrington.

6th Semester B. Tech. (Information Technology) Computer Networks Lab (IT-312) L TP -3 Cr 1.5 Internal Marks: External Marks: List of Experiments To study the physical media of connectivity 60 40

1. Study the functioning of Switch, Hub and Router. 2. To study the pin structure of crossover cable. 3. Establish LAN (star topology) for your lab using hubs (8 or 16 port).
4. Install and configure the LAN card. 5. To study different servers and their roles. 6. Write a program to generate 2-D parity Generator. 7. Write a program to generate Hamming Code Generator. 8. Write a program to generate CRC Generator. 9. Write a program to generate Checksum. 10. Study and install the media converting using optical fiber 11. Study and implement the virtual network

6th SEMESTER B. Tech. (INFORMATION TECHNOLOGY) Visual Basic & .NET LAB (IT-314) L TP -4 Cr 2 Internal Marks: External Marks: List of Experiments Program for concatenation of two strings Write a program for making a calculator. 60 40

1. Write a program for displaying date and time in a form. 2. Write a program for linear search using console applications. 3. Write a program for binary search using console applications.
4. Write a program for encryption and decryption of string. 5. Write a program for displaying flags of particular country. 6. Write a program for generating the random numbers. 7. Write a program for fully functional word processor. 8. Write a program for file handling. 9. Write a program for database handling. 10. Write a program for file watcher.

6th Semester B. Tech. (Information Technology) Computer Graphics Lab (IT-316) L TP -3 Cr 1.5 Internal Marks: External Marks: List of Experiments 1. 2. 3. 4. 5. 6. 7. Write a program to make different geometric shapes. Write a program to implement DDA line drawing algorithm. Write a program to implement Bresenhams line drawing algorithm. Write a program to implement Bresenhams Circle drawing algorithm. Write a program to draw a decagon whose all vertices are connected with every other vertex using lines. Write a program to implement Flood Fill Algorithm. Write a program to show a ball moving on the screen according to the given requirements Write a Program to implement the midpoint circle drawing algorithm. Write a program to implement Bezier curve. Write a program to implement Line Clipping Algorithm. Write a program to implement Boundary Fill Algorithm. Write a program to implement Polygon Clipping Algorithm. Write a program to Depth Buffer Algorithm. 60 40

8.
9. 10. 11. 12. 13.

6th Semester B.Tech (Information Technology) UNIX / Linux Programming Lab (IT-318) L TP -3 Cr 1.5 Internal Marks: External Marks: 60 40

1. Install Linux on the system dual boot with the windows operating System. 2. Do the following tasks:A. Create, remove, and resize various types of partitions through GUI as well as command line. B. Configure printers in Linux. 3. Creating ,Removing of Swap space as well as swap file. 4. Implementing Disk Quotas- enabling, creating, mounting, configuring, assigning, Disabling. 5. Managing Users and Groups in Linux- Adding, Modifying, Password aging. 6. Write a shell script to find the factorial value of any number entered through the keyboard. 7. Write a script to create a DMC of a student. 8. To study various file-directories handling commands. 9. To study the various shell commands in Linux. 10. Write a script to Implement Menu driven calculator. 11. Implement Mount,Unmount and Make file systems