Sunday, January 8, 2012

CS2357 Object Oriented Analysis and Design Lab Anna university lab manual for all exercises

CS2357 Object Oriented Analysis and Design Lab Anna university lab manual for all exercises


OBJECTIVE: To develop a mini-project following the 12 exercises listed below.
1. To develop a problem statement.
2. Develop an IEEE standard SRS document. Also develop risk management and
project plan (Gantt chart).
3. Identify Use Cases and develop the Use Case model.
4. Identify the business activities and develop an UML Activity diagram.
5. Identity the conceptual classes and develop a domain model with UML Class
diagram.
6. Using the identified scenarios find the interaction between objects and represent
them using UML Interaction diagrams.
7. Draw the State Chart diagram.
8. Identify the User Interface, Domain objects, and Technical services. Draw the
partial layered, logical architecture diagram with UML package diagram notation.
9. Implement the Technical services layer.
10. Implement the Domain objects layer.
11. Implement the User Interface layer.
12. Draw Component and Deployment diagrams.
18
Suggested domains for Mini-project.
1. Passport automation system.
2. Book bank
3. Exam Registration
4. Stock maintenance system.
5. Online course reservation system
6. E-ticketing
7. Software personnel management system
8. Credit card processing
9. e-book management system
10. Recruitment system
11. Foreign trading system
12. Conference Management System
13. BPO Management System

QUESTION BANK- CS2351 ARTIFICIAL INTELLIGENCE


QUESTION BANK
CS2351 ARTIFICIAL INTELLIGENCE

UNIT I
PROBLEM SOLVING
2 MARK QUESTIONS
1) What are the approaches followed to have AI?
2) Define AI.
3) Define Agent with a diagram.
4) What is a Ideal rational agent?
5) What are the elements of an agent?
6) State the factors that make up rationality.
7) Distinguish omniscience and rationality.
8) What is a task environment?
9) What is a PEAS description?
10)Write a PEAS description for an automated taxi?
11)Write a PEAS description for a vacuum cleaner?
12)What is agent program and agent architecture?
13)What is a software agent?
14) State the difference between utility function and performance measure?
15) State the difference between agent function and agent program?
16)Give the steps adopted by a problem solving agent.
17)What is a fringe?
18)How is problem solving algorithm performance measured?
19)What are the components that a node represents in a search tree?
20)What are the different approaches in defining artificial intelligence?
21)Define an agent.
22)What is bounded rationality?
23)What is an autonomous agent?
24)Describe the salient features of an agent.
25)Define the terms: agent, agent function
8 MARK QUESTION
1) How is a task environment specified?
2) What are the task environment natures?
3) Describe the various properties of the task environment.
4) Write PEAS description for at least four agent types. (UNIVERSITY QUESTION)
1
5) Write the environment characteristics of any four agent type.
6) Explain in detail Simple reflex agent.
7) Explain in detail any of the four agent structure.
8) Explain in detail Model based reflex agent.
9) Explain in detail Goal based reflex agent.
10) Explain in detail Utility based reflex agent.
11) Explain in detail learning agent.
12)Distinguish an agent of AI and non AI program.
13) Explain tree search algorithm in detail.
14) Write short notes on Iterative deepening depth first search. (UNIVERSITY QUESTION)
15) Write short notes on Depth limited search. (UNIVERSITY QUESTION)
16) State how repeated states are avoided and give an algorithm.
17) Explain Depth-First search (UNIVERSITY QUESTION)
18) Explain Iterative deepening depth first search (UNIVERSITY QUESTION)
19) Explain Bidirectional search (UNIVERSITY QUESTION)
20) Explain the PEAS specification of the task environment of an agent (UNIVERSITY
QUESTION)
Date of Issue: 23ed December
Date of Submission: 30th Jan 2011
UNIT II
LOGICAL REASONING
PART A
1. What are the two commitments of logic and define them?
2. What are the components of a first order logic?
3. What is the difference between the two quantifiers in the logics?
4. What is synchronic and diachronic?
5. What are casual rules?
6. What are diagnostic rules?
7. What is a model based reasoning systems?
8. What are the various steps in knowledge engineering process of a first order logic?
9. What are the various resolution strategies?
10. What is ontological engineering?
11. What is upper ontology?
12. What distinguish general purpose ontology and special purpose ontology?
13. What are categories and objects?
14. Describe default logic
15. What do you understand by logical reasoning
16. State the reasons when the hill climbing often gets stuck
17. Define unification
18. Define resolution
19. What is reification?
20. List the canonical forms of resolution
2
PART B (8 MARK QUESTION)
1. Give the Syntax and Semantics of a first order logic in detail with an eg.
2. Give Syntax and Semantics of a first order logic for a family domain.
3. Give the Syntax and Semantics of a first order logic for Numbers, Sets, Lists domain.
4. Elaborate upon the process of knowledge engineering with electronic circuit’s domain.
5. Explain about unification with an algorithm in a first order logic.
6. Explain in detail the concept of theorem proverbs.
7. Explain forward chaining and backward chaining in detail for a first order definite
clauses. (UNI QUES)
8. Explain how categories and objects are presented in any four sets.
9. Elaborate upon the ontology for situation calculus.
10. Elaborate upon the ontology for event calculus.
11. Explain predicate logic (UNI QUES)
12. Write notes on proposition logic (UNI QUES)
13. Explain the resolution procedure with an example (UNI QUES)
14. Illustrate the use of predicate logic to represent the knowledge with suitable example
(UNI QUES)
15. With an example explain the logics for non monotonic reasoning (UNI QUES)
16. How facts are represented using prepositional logic? give an example (UNI QUES)
Date of Issue: 18th December
Date of Submision: 30th Jan 2011
UNIT III
PLANNING
PART A
1. Define partial order planner (June 07)
2. Define planning with state space search
3. What is a planning graph
4. What is planning and acting in real world
5. Define forward state space search
6. Define backward state space search
7. Heuristics for state space search
8. Describe the differences and similarities between problem solving and planning
9. What is a planning graph
10. What is sub goal independence assumption
11. What is empty – delete – list heuristic
12. What is least commitment strategy
13. What is regression planning
14. What is the main advantage of backward search
15. what is progression planning
3
16. What is closed world assumption
17. What is least commitment
18. What is GraphPlan algorithm
19. What is Critical Path Method (CPM)
20. What is a slack
PART B (8 Mark)
1. Explain Planning with state space search with an example
2. Explain partial order planning with example
3. Explain Graph Plan algorithm with the example
4. What is STRIPS explain in detail with the example
5. How we plan and act in non deterministic domains
6. What is conditional planning
7. How we schedule with resource constraints
8. How we plan with propositional logic
9. Explain partial order planning with unbound variables
10. Give an example for partial order planning
11. what is Backward state space search
12. Explain Heuristics for state space search
13. Explain Forward state space search
14. For Air cargo transport explain STRIPS
15. For Blocks World explain STRIPS
16. Compare STRIPS and ADL language
Date of Issue: 23ed December
Date of Submission: 30th Jan 2011
UNIT IV
UNCERTAIN KNOWLEDGE AND REASONING
PART A
1. Define uncertainty (june 07)
2. Define Baye’s rule (june 06)
3. How is uncertainty knowledge represented ? Give an example (Dec 05)
4. Define Decision Theory
5. Define probabilistic inference
6. what is Markov blanket
7. What is noisy logical relationship
8. what is a Temporal Model
9. Define HMM
10. What is smoothing
11. What is hindsight
12. Define EM algorithm
4
13. define simplified matrix algorithm
14. how to handle uncertain knowledge
15. what are the basic probability notation
16. what is prior probability
17. Distinguish between full joint probability distribution and joint probability distribution
18. write an algorithm for decision theoretic agent
19. what are the axioms of probability
20. what is inference.
PART B (8 Mark)
1. How to deal with uncertainty (dec 05)
2. What is Baye’s rule ? explain how Baye’s rule can be applied to tackle uncertain
knowledge (june 07)
3. Explain probabilistic reasoning ( june 07)
4. Explain HMM
5. What is a Bayesian network
6. How to get the exact inference form Bayesian network
7. How to get the approximate inference form Bayesian network
8. What are all the temporal model
9. How to determine uncertain acting under uncertainty
10. In temporal model explain filtering and prediction
11. Explain Smoothing with needed algorithm
12. How to handle uncertainty
13. How to construct Bayesian network
14. What are all the exact inference in Dynamic Bayesian Network
15. What are all the approximate inference in DBN
16. How to represent knowledge in an uncertain domain
Date of Issue: 23ed December
Date of Submission: 30th Jan 2011
UNIT V -- LEARNING
PART A
1. What are the types of learning?
2. What is ensemble learning?
3. Give a simple mathematical model for a neuron.
4. What are the two choices for activation function?
5. What are the categories of neural network structures?
6. What is memorization?
7. State the factors involved in analysis of efficiency gains from EBL.
8. State the design issues that affect the learning element.
9. State the factors that play a role in the design of learning systems.
5
10. State the decision tree as a performance element.
11. What is explanation based learning ( May 2010, june 06)
12. State the advantages of inductive logic programming (May 2010)
13. How to represent experience using learning techniques (Dec 05)
14. What is meant by decision network (June 06)
15. List the issues that affect the design of an learning element (June 09)
16. What is Q learning (June 09)
17. What is meant by proof by refutation (June 2007)
18. Define reinforcement learning
19. What are the statistical learning method
20. Define inductive learning
PART B (8 Marks)
1. Explain the various forms of learning.
2. How is the learning process in a decision tree?
3. Explain the various methods of logical formulation in logical learning?
4. How are explanation based learning done?
5. Elaborate upon inductive logic programming.
6. Write in detail the EM algorithm.
7. Give an overview of a neural network.
8. Explain multilayer feed forward neural networks with an algorithm
9. Explain the nonparametric learning methods.
10. How learning is done on a complete data using statistical methods?
11. Explain the relevance based learning (May 10)
12. Describe the decision tree learning algorithm (May 2010)
13. Discuss active reinforcement leaning (May 10)
14. Discuss passive reinforcement learning (May 10)
15. How to further proceed to decision making (Dec 05)
16. Describe multilayer feed forward network (June 09)
6

Implementation of Bresenhams algorithm - Ellipse


Implementation of Bresenhams algorithm - Ellipse

Enginer's Portal   1.c.) Implementation of Bresenhams algorithm - Ellipse  

Program : 

#include "stdio.h"
#include "conio.h"
#include "math.h"
#include "graphics.h"
main()
{
                    int gd=DETECT,gm;
                    int xcenter,ycenter,rx,ry;
                    int p,x,y,px,py,rx1,ry1,rx2,ry2;
                    initgraph(&gd,&gm,"h:\\tc\\bgi");
                    printf("Enter The Radius Value:\n");
                    scanf("%d%d",&rx,&ry);
                    printf("Enter The xcenter and ycenter Values:\n");
                    scanf("%d%d",&xcenter,&ycenter);
                    ry1=ry*ry;
                    rx1=rx*rx;
                    ry2=2*ry1;
                    rx2=2*rx1;

/* REGION 1 */

x=0;
                    y=ry;
                    plotpoints(xcenter,ycenter,x,y);
                    p=(ry1-rx1*ry+(0.25*rx1));
                    px=0;
                    py=rx2*y;
                    while(px<py)
                    {
                              x=x+1;
                             px=px+ry2;
                             if(p>=0)
                                       y=y-1;
                                       py=py-rx2;


                               if(p<0)
                                       p=p+ry1+px;
                              else
                                        p=p+ry1+px-py;
                    plotpoints(xcenter,ycenter,x,y);

/* REGION 2*/
                  
p=(ry1*(x+0.5)*(x+0.5)+rx1*(y-1)*(y-1)-rx1*ry1);
                   while(y>0)
                   {
                             y=y-1;
                             py=py-rx2;
                              if(p<=0)
                             {
                                       x=x+1;
                                       px=px+ry2;
                              }
                              if(p>0)
                                       p=p+rx1-py;
                             else
                                      p=p+rx1-py+px;
                     plotpoints(xcenter,ycenter,x,y);
                   }
               }
                    getch();
                    return(0);
            }

int plotpoints(int xcenter,int ycenter,int x,int y)
{
                    putpixel(xcenter+x,ycenter+y,6);
                    putpixel(xcenter-x,ycenter+y,6);
                    putpixel(xcenter+x,ycenter-y,6);
                    putpixel(xcenter-x,ycenter-y,6);
                    return;
}

Output :

Enter The Radius Value(Rx,Ry)           :     10      30
                   
Enter The xcenter and ycenter Values  :     300    150    
Enginer's Portal 

Implementation of Bresenhams algorithm - Circle


Implementation of Bresenhams algorithm - Circle

Enginer's Portal   1.b.) Implementation of Bresenhams algorithm - Circle  

Program : 

#include "stdio.h"

#include "conio.h"
#include "math.h"
#include "graphics.h"
          main()
          {
                    int gd=DETECT,gm;
                    int xcenter,ycenter,radius;
                    int p,x,y;
                    initgraph(&gd,&gm,"h:\\tc\\bgi");
                    x=0;
                    printf("\n Enter The Radius Value: ");
                    scanf("%d",&radius);
                    y=radius;
                    printf("\n Enter The xcenter and ycenter Values: ");
                    scanf("%d%d",&xcenter,&ycenter);
                    plotpoints(xcenter,ycenter,x,y);
                    p=1-radius;
                    while(x<y)
                    {
                             if(p<0)
                                       x=x+1;
                             else
                              {
                                       x=x+1;
                                       y=y-1;
                             }
                             if(p<0)
                                       p=p+2*x+1;
                             else
                                       p=p+2*(x-y)+1;
                     plotpoints(xcenter,ycenter,x,y);
                   }
            getch();
            return(0);
          }


          int plotpoints(int xcenter,int ycenter,int x,int y)  
           {
                    putpixel(xcenter+x,ycenter+y,1);
                    putpixel(xcenter-x,ycenter+y,1);
                    putpixel(xcenter+x,ycenter-y,1);
                    putpixel(xcenter-x,ycenter-y,1);
                    putpixel(xcenter+y,ycenter+x,1);
                    putpixel(xcenter-y,ycenter+x,1);
                    putpixel(xcenter+y,ycenter-x,1);
                    putpixel(xcenter-y,ycenter-x,1);
                    return;
          }

Output :

Enter The Radius Value                       :     80
                   

Enter The xcenter and ycenter Values :      230    260
                                               Enginer's Portal    

Implementation of Bresenhams algorithm


Implementation of Bresenhams algorithm 

Enginer's Portal 

 1.a.) Implementation of Bresenhams algorithm - 


Program :


// This program will work for all input ....  0<m<1 and m>1 
// where 'm' is slope


#include "stdio.h"
#include "conio.h"
#include "math.h"
#include "graphics.h"
main()
{
int gd=DETECT,gm;
int xa,xb,ya,yb;
int dx,dy,x,y,xend,p,dxt,dyt,slope_pos,yend;
initgraph(&gd,&gm,"H:\\TC\\BGI");
printf("Enter the First End points(xa,ya):\n");
scanf("%d%d",&xa,&ya);
printf("Enter the Second End points(xb,yb):\n");
scanf("%d%d",&xb,&yb);


dxt=xb-xa;
dyt=yb-ya;
dx=abs(xb-xa);
dy=abs(yb-ya);


slope_pos=(dxt>0);
if(dyt<0)
slope_pos=!slope_pos;


if(dx>dy)   // slope => 0<m<1
{
p=2*dy-dx;
if(xa>xb)
{
x=xb;
y=yb;
xend=xa;
}
else
{
x=xa;
y=ya;
xend=xb;
}


    while(x<xend)
      {
      x=x+1;
      if(p<0)
      {
      p=p+2*dy;
      }
      else
      {
      if(slope_pos)
      y=y+1;
      else
      y=y-1;
      p=p+2*(dy-dx);
      }
      putpixel(x,y,6);
      }
      }
      else   // slope => m>1
      {
p=2*dx-dy;
if(ya>yb)
{
x=xb;
y=yb;
yend=ya;
}
else
{
x=xa;
y=ya;
yend=yb;
}
    while(y<yend)
      {
      y=y+1;
      if(p<0)
      {
      p=p+2*dx;
      }
      else
      {
      if(slope_pos)
      x=x+1;
      else
      x=x-1;
      p=p+2*(dx-dy);
      }
      putpixel(x,y,6);
      }
      }
    putpixel(xa,ya,4);
    putpixel(xb,yb,4);
   getch();
   return(0);
}


Output :


Enter The Two Left Endpoints(xa,ya):       50    60

Enter The Two Right Endpoints(xb,yb):    150 360

                                                                                             Enginer's Portal          

CS2353 - OBJECT ORIENTED ANALYSIS AND DESIGN - UNIT - 2



CS2353 - OBJECT ORIENTED ANALYSIS AND DESIGN - UNIT - 2

CS2353 - OBJECT ORIENTED ANALYSIS AND DESIGN  :


Unit - II :

Part –A (2 Marks)


1. What is an Elaboration?
It Build the core architecture, resolve the high-risk elements, define most requirements, and estimate the overall schedule and resources


2. What is a domain model?
A domain model is a visual representation of conceptual classes or real-world objects in a domain of interest. They have also been called conceptual models, domain object models, and analysis object models


3. Define Conceptual Classes?
The domain model illustrates conceptual classes or vocabulary in the domain. Informally, a conceptual class is an idea, thing, or object. More formally, a conceptual class may be considered in terms of its symbol, intension, and extension.


4. Define Description Class?
A description class contains information that describes something else. For example, a ProductDescription that records the price, picture, and text description of an Item.
5. What are Three Strategies to Find Conceptual Classes?
1. Reuse or modify existing models.
2. Use a category list.
3. Identify noun phrases


6. What is an association?
An association is a relationship between classes (more precisely, instances of those classes) that indicates some meaningful and interesting connection.


7. What is an Attributes?
An attribute is a logical data value of an object. It is useful to identify those attributes of conceptual classes that are needed to satisfy the information requirements of the current scenarios under development.


8. What About Attributes in Code?
The recommendation that attributes in the domain model be mainly data types does not imply that C# or Java attributes must only be of simple, primitive data types. The domain model is a conceptual perspective, not a software one. In the Design Model, attributes may be of any type.


9. What is a Derived Attributes?
The total attribute in the Sale can be calculated or derived from the information in the SalesLineItems. When we want to communicate that 1) this is a noteworthy attribute, but 2) it is derivable, we use the UML convention: a / symbol before the attribute name.
10. When to Define New Data Type Classes?
In the NextGen POS system an itemID attribute is needed; it is probably an attribute of an Item or ProductDescription. Casually, it seems like just a number or perhaps a string. For example, itemID : Integer or itemID : String.




11. Defining Conceptual Super classes and Subclasses?
It is valuable to identify conceptual super- and subclasses, it is useful to clearly and precisely understand generalization, super classes, and subclasses in terms of class definition and class sets.


12. What is Generalization?
Generalization is the activity of identifying commonality among concepts and defining superclass (general concept) and subclass (specialized concept) relationships.


13. What is Aggregation?
Aggregation is a vague kind of association in the UML that loosely suggests whole-part relationships (as do many ordinary associations). It has no meaningful distinct semantics in the UML versus a plain association, but the term is defined in the UML.
14. What is Composition?
Composition, also known as composite aggregation, is a strong kind of whole-part aggregation and is useful to show in some models. A composition relationship implies that 1) an instance of the part belongs to only one composite instance at a time, 2) the part must always belong to a composite and 3) the composite is responsible for the creation and deletion of its parts either by itself creating/deleting the parts, or by collaborating with other objects.


15. What is UML Activity Diagrams?
A UML activity diagram shows sequential and parallel activities in a process. They are useful for modeling business processes, workflows, data flows, and complex algorithms.


16. How to Apply Activity Diagrams?
A UML activity diagram offers rich notation to show a sequence of activities, including parallel activities. It may be applied to any perspective or purpose, but is popular for visualizing business workflows and processes, and use cases.




Part –B (16 Marks)

1. Explain Domain Models with an example?
2. Explain Conceptual Classes with an example and what are Three Strategies to Find Conceptual Classes?
3. Explain Descriptions with the Airline Domain example?
4. Explain Associations with Applying UML?
5. Explain Attribute with Applying UML?
6. What are Suitable Attribute Types? Explain Focus on Data Type Attributes in the Domain Model.
7. Explain Conceptual Superclasses and Subclasses with an example?
8. Explain Aggregation and Composition?
9. Explain UML Activity Diagrams and Modeling?

Enginer's Portal

Slider

Image Slider By engineerportal.blogspot.in The slide is a linking image  Welcome to Engineer Portal... #htmlcaption

Tamil Short Film Laptaap

Tamil Short Film Laptaap
Laptapp

Labels

About Blogging (1) Advance Data Structure (2) ADVANCED COMPUTER ARCHITECTURE (4) Advanced Database (4) ADVANCED DATABASE TECHNOLOGY (4) ADVANCED JAVA PROGRAMMING (1) ADVANCED OPERATING SYSTEMS (3) ADVANCED OPERATING SYSTEMS LAB (2) Agriculture and Technology (1) Analag and Digital Communication (1) Android (1) Applet (1) ARTIFICIAL INTELLIGENCE (3) aspiration 2020 (3) assignment cse (12) AT (1) AT - key (1) Attacker World (6) Basic Electrical Engineering (1) C (1) C Aptitude (20) C Program (88) C# AND .NET FRAMEWORK (11) C++ (1) Calculator (1) Chemistry (1) Cloud Computing Lab (1) Compiler Design (8) Computer Graphics Lab (31) COMPUTER GRAPHICS LABORATORY (1) COMPUTER GRAPHICS Theory (1) COMPUTER NETWORKS (3) computer organisation and architecture (1) Course Plan (2) Cricket (1) cryptography and network security (3) CS 810 (2) cse syllabus (29) Cyberoam (1) Data Mining Techniques (5) Data structures (3) DATA WAREHOUSING AND DATA MINING (4) DATABASE MANAGEMENT SYSTEMS (8) DBMS Lab (11) Design and Analysis Algorithm CS 41 (1) Design and Management of Computer Networks (2) Development in Transportation (1) Digital Principles and System Design (1) Digital Signal Processing (15) DISCRETE MATHEMATICS (1) dos box (1) Download (1) ebooks (12) electronic circuits and electron devices (1) Embedded Software Development (4) Embedded systems lab (4) Embedded systems theory (1) Engineer Portal (1) ENGINEERING ECONOMICS AND FINANCIAL ACCOUNTING (5) ENGINEERING PHYSICS (1) english lab (7) Entertainment (1) Facebook (2) fact (31) FUNDAMENTALS OF COMPUTING AND PROGRAMMING (3) Gate (3) General (3) Global warming (1) GRAPH THEORY (1) Grid Computing (11) hacking (4) HIGH SPEED NETWORKS (1) Horizon (1) III year (1) INFORMATION SECURITY (1) Installation (1) INTELLECTUAL PROPERTY RIGHTS (IPR) (1) Internal Test (13) internet programming lab (20) IPL (1) Java (38) java lab (1) Java Programs (28) jdbc (1) jsp (1) KNOWLEDGE MANAGEMENT (1) lab syllabus (4) MATHEMATICS (3) Mechanical Engineering (1) Microprocessor and Microcontroller (1) Microprocessor and Microcontroller lab (11) Mini Projects (1) MOBILE AND PERVASIVE COMPUTING (15) MOBILE COMPUTING (1) Multicore Architecute (1) MULTICORE PROGRAMMING (2) Multiprocessor Programming (2) NANOTECHNOLOGY (1) NATURAL LANGUAGE PROCESSING (1) NETWORK PROGRAMMING AND MANAGEMENT (1) NETWORKPROGNMGMNT (1) networks lab (16) News (14) Nova (1) NUMERICAL METHODS (2) Object Oriented Programming (1) ooad lab (6) ooad theory (9) OPEN SOURCE LAB (22) openGL (10) Openstack (1) Operating System CS45 (2) operating systems lab (20) other (4) parallel computing (1) parallel processing (1) PARALLEL PROGRAMMING (1) Parallel Programming Paradigms (4) pdf (1) Perl (1) Placement (3) Placement - Interview Questions (64) PRINCIPLES OF COMMUNICATION (1) PROBABILITY AND QUEUING THEORY (3) PROGRAMMING PARADIGMS (1) Python (3) Question Bank (1) question of the day (8) Question Paper (13) Question Paper and Answer Key (3) Railway Airport and Harbor (1) REAL TIME SYSTEMS (1) RESOURCE MANAGEMENT TECHNIQUES (1) results (3) semester 4 (5) semester 5 (1) Semester 6 (5) SERVICE ORIENTED ARCHITECTURE (1) Skill Test (1) software (1) Software Engineering (4) SOFTWARE TESTING (1) Structural Analysis (1) syllabus (34) SYSTEM SOFTWARE (1) system software lab (2) SYSTEMS MODELING AND SIMULATION (1) Tansat (2) Tansat 2011 (1) Tansat 2013 (1) TCP/IP DESIGN AND IMPLEMENTATION (1) TECHNICAL ENGLISH (7) Technology and National Security (1) Theory of Computation (3) Thought for the Day (1) Timetable (4) tips (4) Topic Notes (7) tot (1) TOTAL QUALITY MANAGEMENT (4) tutorial (8) Ubuntu LTS 12.04 (1) Unit Wise Notes (1) University Question Paper (1) UNIX INTERNALS (1) UNIX Lab (21) USER INTERFACE DESIGN (3) VIDEO TUTORIALS (1) Virtual Instrumentation Lab (1) Visual Programming (2) Web Technology (11) WIRELESS NETWORKS (1)

LinkWithin