DEPARTMENT OF INFORMATION TECHNOLOGY



DEPARTMENT OF INFORMATION TECHNOLOGY

IT WORKSHOP

Week1–Task1: Identify the peripherals of a computer, components in CPU and its functions. Draw the block diagram of the CPU along with the configuration of each peripherals and submit to your instructor.

Week1–Task 2: Every student should disassemble back to the working condition. Lab Instructor should verify the work and follow it up with a viva also students need to go through the video which shows the process of assembling a PC.A video should be given as part of the course content.

Week3- Task3: Every student should individually install on personal computer. The Lab instructor should verify the installation and follow it up with a viva.

Week4- Task4: Every student should install Linux on the computer. This computer should have windows installed. The system should be configured as duel boot with Windows and Linux. Lab instructor should verify the installation and follow it up with a viva.

Week5- Task5: Several mini tasks would be that covers basic commands in Linux and Basic system administration in Linux which includes: Basic Linux commands

in bash create hard and symbolic link text processing using wildcards.

Week6- Task6: Hardware troubleshooting: students have to be given a PC which does not boot due to improper assembling or defective peripherals. They should identify the problems and fix it to get the computer back to working condition. The work done should be verified by the instructor and followed up with a viva.

Week7- Task7: Software Troubleshooting: students have to be given a malfunctioning CPU to system software problems. They should identify the problem and fix to get the computer back to work condition. The work done should be verified bi the instructor and followed up with a viva.

Week8- Task8: The test consists of varies system with hardware /software related troubles. Formatted disks without operating systems.

Internet & World Wide Web

Week9- Task1: Orientation & connectivity boot camp: students should get connected to their Local Area network and access the internet. In the process they configure the TCP/IP setting. Finally students should be demonstrate to the instructor, how to access the web sites and email. If there is no internet connectivity preparations need to be made by the instructor to simulate the WWW on the LAN.

Week10-task 2: Web Browsers, Surfing the web: students customize their web browsers with the LAN proxy settings, bookmarks, search toolbars and pop up blockers. Also, plug-ins like Macromedia Flash and JRE for applets should be configured.

Week11-task 3: Search engines & Netiquette: students should know what search engines are and how to use search engines. A few topics would be given to the students for which they need to search on Google. This should be demonstrated to the instructors.

Week12-task 4: Cyber Hygiene: students would be exposed to the various threats

On the internet and would be asked to configure their computer to be safe on the internet .They need to first install an anti virus software, configure their personal

Firewall and windows update on their computer. Then they need to customize their browsers to block pop ups, block active x downloads to avoid viruses and/or worms.

Week 13: module test which simulates all of the above tasks would be crafted

and given to the students.

LaTeX and Microsoft word

Week 14:- Word Orientation: the mentor needs to give an overview of LaTeX and Microsoft word; importance of LaTeX and word as word processors. Details of the four tasks and features that would be covered in each, using LaTeX and word Accessing overview of toolbars saving files using help resources, rules format painter in word.

Task1: using LaTeX and word to create a project certificates. features to be covered –Formatting fonts in word , drop cap in word ,Applying text affects, using

Character spacing, borders and colours, inserting header and footer ,using date and Time option in both LaTeX and word.

Week 15-task2:Creating project abstract features to be covered :-formatting styles inserting tables bullets and numbering changing text direction cell alignment footnote hyperlink symbols spell check track changes.

Week 16-task3:Creating a new letter features to be covered table of content news paper columns images from files and clipart drawing toolbar and word art formatting images textbox and paragraphs.

Week 16-task3: Creating Feedback form features to be covered –Forms text fields inserting objects Mail Merges in Word.

Week 18: LaTeX and word module Test- replicate the given document includes of all features.

MICROSOFT EXCEL

Week 19-Excel Orientation: the mentor needs to tell the importance of MS Excel as Spread sheet tool, give the details of the four tasks and features that would be covered in each ,Using Excel Accessing overview of toolbars saving excel files, using help and resources .

Task 1 creating a scheduler –features to be covered:- Grid lines, format cells ,

Summation, auto fill formatting text.

Week 20-task 2: Calculating GPA-features to be covered:-Cell referencing, formulae in Excel –average, Std .derivation charts, Renaming and Inserting worksheets, Hyper linking, Count function, HLOOKUP/VLOOKUP.

Week 21-task 3: Performance Analysis –Best Features to be covered:-split cells,

Freeze panes, Group and out line, sorting, Boolean and logical operators, conditional formatting.

Week 22-task 4: Cricket Score card –Features to be covered:-pivot tables, inter active buttons, importing data, data protection, data validation.

Week 23-Excel module test- Replicate the given document inclusive of all features.

LaTeX and Microsoft power point

Week 24-task 1: students will be working on basic power point utilities and tools which help them create basic power point presentation.

Topic covered during this week includes:-PPT Orientation, Slide Layouts, and Inserting text word art, Formatting text, bullets and numbering, Auto Shapes, lines and arrows in both LaTeX power point.

Week 25-task 2:- Second week helps students in making their presentations interactive.

Topic covered during this week includes: Hyper links, inserting images, clip art, audio, video objects, Tables and charts.

Week 26-task 3:- Concentrating on the in and out of MS power point and presentations in LaTeX, helps them learn best practices in designing and preparing power point presentation .

Topic covered during this week includes: Master Layouts (Slide, template and notes),

Types of views (basic, presentation, slide spotter, notes etc), inserting- background, textures, Design templates, hidden slides.

Week 27-task 4: Entire week concentrates on presentation part of LaTeX and Microsoft power point,

Topic covered during this week includes: Using auto Content Wizard, slide transition, Custom Animation, Auto Rehearsing.

Week 28-Task5: power point test would be conducted. Students will be given model power point presentation which needs to be replicated (exactly how it’s asked).

Microsoft Publisher

Week 29: Help students in preparing their personal website Microsoft publisher,

Topic covered during this week includes –publisher Orientation, using Templates,

Layouts, inserting Text objects, editing Text objects, inserting tables, working with

Menu objects, inserting pages, hyperlinking, Renaming, deleting, modifying pages, hosting Websites.

DEPARTMENT OF INFORMATION TECHNOLOGY

LANGUAGE PROCESSORS

1. Develop a Lexical analyzer to recognize a few patterns in PASCAL, C and FORTRAN

(EX: Identifiers, Contents, Comments, Operators, etc….).

2. Write a program to parse using brute force technique of Top Down parsing.

3. Develop on LL(1)parser(construct parse table also).

4. Develop an operator precedence parser (construct parse table also).

5. Develop a Recursive Decent Parser.

6. Write a program for generating for various intermediate code forms.

1) Three address code 2) polish Nation.

7. Write a program to simulate Heap Storage Allocation strategy.

8. Generate Lexical Analyzer using LEX.

9. Generate YACC specification for a few syntactic Categories.

10. Given any Intermediate code form implement code optimization techniques.

DEPARMENT OF INFORMATION TECHNOLOGY

COMPUITER PROGRAMMING LAB

1. Write program to evaluate the following expressions after reading necessary values from the user

a. ax+b/ax-b

b. 2.5 log X + COS 32˚+│X²-Y²│+ 2XY

c. 1/α√2∏ ℮ - (x-m/√2σ)²

2 Write a C program for the following

d. Printing three given integers in ascending order

e. Sum of 1+2+3……+n

f. 1+x²/3! + x²/4! +……….. up to ten terms

g. x + x³/3!+x5/5!+…………… up to 7th digit accuracy

h. Read X and compute Y=1 for x>0

Y=0 for x=0

Y=-1 for x2. Write a C program using Do-While to calculate and print first m Fibonacci numbers.

11. Write C program to print the following outputs using for loop.

a. 1

i. 2

ii. 3 3

iii. 4 4 4

iv. 5 5 5

b.

1

2. 2

3 3 3

4 4 4 4

5 5 5 5 5

12. Write a C program to execute a portion of a character string and print the extracted string. Assume that m characters are extracted starting with the nth character.

13. A Maruthi Car dealer maintains a record of sales various vehicles in the following form:

|Vehicle Type |Month of sales |Price(Rs) |

|Maruti-800 |02/87 |75,000 |

|Maruthi-Dx |07/87 |95,000 |

|Gypsy |04/88 |1,10,000 |

|Maruthi Van |08/88 |85,000 |

Write a C program to read this data into a table of strings and out put the details of a particular vehicle sold during a specified period. The program should request the user to input the vehicle type and the period (Starting month & ending month).

14. Write a function that will scan a character string pressed as an argument and convert all lower case characteristics into upper case equivalents.

15. Implement the following Data data structures using Arrays.

a. Stacks b. Linear Queues c. Circular Queues

16. Implement the Binary search Tree using Linked list and perform the

Following operations:

a. Insertion b. Deletion c. In order Traversal d. pre order Traversal

e. Post order Traversal

17. Singly Linked List and Double Linked List:

a. Insertion b. Deletion c. Look up

18. a) Implement Stack using Singly Linked List.

b) Implement Queue using Singly Linked list.

19. Implement following sorting techniques:

a. Bubble Sort b. Insertion Sort c. Quick Sort d. Heap Sort

20. Implement following searching Techniques:

a) Sequential Search b) Binary Search

21. a) Conversion of Infix Expression to Postfix notation

b) Simple expression evaluator, that can handle (+,-,/&*)

22. Implement the Algorithms for the following Iterative methods using C to find one root of the equation:

9X1+2X2+4X3=0

X1+10X2+4X3=6

2X1-4X2+10X3=-15

23. Write computer programs to implement the LaGrang Interpolation and Newton – Gregory forward Interpolation.

24. Implements in C the Linear Regression and Polynomial Regression algorithms.

25. Implement Trapezoidal and Simpson methods.

DEPARMENT OF INFORMATION TECHNOLOGY

COMPUTER NETWORKING LAB

1. Implement the data link layer framing methods such as character, character stuffing and bit stuffing.

2. Implement the data set of characters the three CRC polynomials CRC 12, CRC 16, CRC ccitt.

3. Implement dijkstra’s algorithm to compute the shortest path through a graph.

4. Take an example subnet graph with weights indicating delay between nodes. Now obtain routing table art each node using Distance Vector Routing algorithm.

5. Take an example subnet of hosts. Obtain broad cast tree for it.

6. Take a 64 bit plain text and encrypt the same using DES algorithm.

7. write a program to break the above DES coding.

8. Using RSA algorithm Encrypt a text data and decrypt the same.

DEPARMENT OF INFORMATION TECHNOLOGY

DATABASE MANAGEMENT SYSTEMS LAB

1 Crating tables for various Relations in SQL.

2 Implementing the Queries SQL.

a) Insertion

b) Retrieval (Implement all the operations like union, Intersect, Minus, In, Exist, Aggregate Functions (min,max,…)etc….)

c) Updation

d) Deletion

3 Creating views

4 Writing Assertions

5 Writing Triggers

6 Implementing operations on Relations (Tables) using PL/SQL.

7 Creating FOEMS.

8 Generating REPORTS.

DEPARMENT OF INFORMATION TECHNOLOGY

UML LAB

The student is expected to take up about 4 mini projects and model them and produce use cases, analysis documents – both static and dynamic aspects, sequence diagram and state charts, data base design. A simple collection of ideas is given. Numerous other ideas can be found in the pages from the list of references given below.

Mini-Project-1: A point - of – scale (POS) system

A POS system is a computerized application used to record sales and handle payments; it is typically used in a retail store. It includes hardware components such as computer and bar code scanner, and software to run the system. It interfaces to various service applications, such as third party tax calculator and inventory control. These system must be relatively fault tolerant; that is, even if remote services of temporarily unavailable they must still be of capturing sales and handling at least cash payments. A POS system must support multiple and varied client side terminals and interfaces such as browser, PDA’s, touch screens.

Mini – Project – II: Online book shop example

Following the model of or , design and implement an online book store.

Mini – Project – III: A simulated company

Simulate a small manufacturing company. The resulting application will enable the user to take out a loan, purchase a machine, and over a series of monthly production runs, follow the performance of their company.

Mini – Project – IV: A multi threaded airport simulation

Simulate the operations in an airport. Your application should support multiple air crafts using several runways and gates avoiding collision / bar conflicts.

Landing: an air craft uses the run way, lands, and taxies over to the terminal.

Take-off: an air craft taxies to the run way and then takes off.

Mini – Project –V: An automated community portal

Business in the 21st century is above all BUSY, distractions are every where.

The current crop of “ enterprise intranet portals “ ate often high noise

and low value, Despite the large capital expenditures it takes to stand them up.

Email takes up to 30-70% of an employee’s time. Chat and instance messaging

Are either in the enterprise are just around the comer. Mean while, management

is tasked with unforeseen and unfounded leadership and change-agent rolls, as

well as leadership development and succession management. What is needed is

a simplified, repeatable process that enhances communications with an

enterprise, while allowing management and peers to self-select future leaders

and easily recognize high performance team members in a dynamic way.

Additionally, the system should function as a general-purpose content

Management, business intelligence and peer-review application.

Glass code’s goal is to build that system. The software is released under a

proprietary license and will have the following features:

Remote and attended moderation of discussions.

However, it will have powerful discovery and business intelligence features,

and be infinitely extendable, owing to a powerful API and adherence to JAVA

platform standards.

Encourages peer review and indicates for management potential leaders strong

Team players and reinforces enterprise and team goals seamlessly and with zero

Administration.

Mini – Project – VI: A content management system.

The goal is to enamel non-technical users to easily publish, access, and share

information over the web, while giving administrators and managers complete

control over the presentation, style, security, and permissions.

FEATURES:

v robust permission system.

v templates for easy custom sight designs.

v total control over the content.

v search engine friendly URL’s

v roll base publishing system.

v versioning control.

v visitor profiling.

Mini – Project – VII: An auction application

Several commerce model exist and are the basis for a number of companies like

, etc. Design and implement auction application that

provides auctioning services. It should clearly model the various factionaries,

the bidding process, auctioning etc.

Mini – Project – VIII: A notes and file management system

In the course of one’s student years and professional carrier one produces a

Lot of personal notes and documents. All these documents are usually kept on

Papers or individual files on computer. Either way the bulk of the information

Is often erased, corrupted and eventually lost. The gal of this project is it builds

A distributed software application that addresses this problem. The system will

Provide an interface to create, organize and manage personal notes through the

Internet for multiple users. The system will also allow users to collaborate by

Assigning permissions for multiple users to view and edit notes.

Mini – Project – IX: A customizable program editor

A programmer’s editor which be focused on an individual programmer’s

Particular needs and style. The editor will act according to the specific language

the current source file is in, and will perform numerous features such as auto

completion or file summarization, on the file. This features will be able to be

turned on or of by the programmer and the programming style of the user will

be used to create as efficient an editing environment as possible.

Mini – Project – X: A graphics editor

Design and implement a JAVA class collection that supports the construction

Editing application, i.e., applications that include the ability to draw the

Structured and unstructured diagrams.

E.g.

The goal of the GEF project is to build a graph editing library that can be used to

Construct many, high-quality graph editing application. Some of the GEF’s

Features are:

A Simple, concrete design that makes the frame work easy to understand and

Extend. Node-prot-edge graph model that is powerful enough for the vast

Majority of connected graph application.

Model-view-controller design based on the swing JAVA UI library makes GEF

Able to act as a UI to existing data structures, and also minimizing learning time

For developers familiar with swing.

High-quality user interactions for moving resizing, reshaping, etc...GEF also supports several novel interactions such as the broom alignment tool and section –action-buttons.

Generic properties sheet based on JAVA beans introspection.

XML-Based file formats based on the PGML standards.

Text Book(s):

“Applying UML and patterns: introductions to object oriented analysis and design the unified process”,

Craig Larman, person Education Asia, 2002, 2nd edition, ISBN: 81-7808-549-6.

REFERENCE’S:

“Object oriented Systems Analysis and Design using UML”,

Simon Bennet , Stave MC Robb,and Ray Farmer , MC Grawhill,2002,

2nd Edition, ISBN :0-07-709864-1.

“Object oriented Analysis and Design”

ANDREW HAIGH,TATA Mc GrawHill,2001,ISBN:0-07-047277-7.

Various net resources and projects:

http:// user-mode-linux.source case-studies.html

http:// programming/ case-studies.html

http:// servelets/projrctis? Type=project

http://

http:// /

http:// projects/

http:// gpp/gponline.html

http:// research/government/gov.html

http:// rge/egovstrategy.pdf

http://

http://

http:// .in

DEPARTMENT OF INFORMATION TECHNOLOGY

ADVANCED DATA STRACTURES AND ALGORITHMS (C++)Lab

1. Write C++ program to implement the following using an array.

a. stack ADT b. Queue ADT

2. Write C++ program to implement the following using a linked list

a. stack ADT b. Queue ADT

3 Write C++ program to implement the deque(Double ended queue)ADT using a double linked list.

4. Write C++ program to perform the following operations

a) Insert an element to binary search tree

b) Delete an element from a binary search tree.

c) Search for a key element in a binary search tree.

5. Write C++ program to implement Circular queue ADT using an array

6 Write C++ program that use non recursive functions to traverse the given binary tree in

a) Preorder b) Inorder c)Postorder

7 Write C++ program for the implementation of bfs and dfs for a given graph.

8 Write C++ program for the implementing the following sorting methods.

a) Quick Sort b) Merge sort c) Heap sort

9 Write C++ program to perform the following operations

a) Insert into B- tree

b) Delete from B- tree.

10. rite C++ program to perform the following operations

a) Insert into an AVL tree

b) Delete from an AVL tree.

11. Write C++ program to implement Kruskal’s Algorithm to generate a minimum Spanning tree.

12. Write C++ program to implement prim’s Algorithm to generate a minimum Spanning tree.

13. Write C++ program to implement all the functions of a dictionary(ADT)using hashing.

................
................

In order to avoid copyright disputes, this page is only a partial summary.

Google Online Preview   Download