Showing posts with label Old Question Paper. Show all posts
Showing posts with label Old Question Paper. Show all posts
JNTU-HYD : M.Tech Previous Papers - Regular/Supple 2010 (March/April/September/October)
Just Click on the links which are provided below to get the papers. Total of 943 question papers are uploaded of all Specializations available in JNTU-HYD.After downloading extract the files by using WINRAR software & search for the file required by using the subject name
M.Tech I Semester Regular Examinations (March/April-2010)
M. Tech II Semester Supplementary Examinations (March/April-2010)
M.Tech I - Semester Supplementary Examinations (September/October-2010)
M.Tech II - Semester Regular Examinations (September/October-2010)
web technology
Code No: R05410502 Set No. 1
IV B.Tech I Semester Regular Examinations, November 2008
WEB TECHNOLOGIES
(Computer Science & Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆ ⋆ ⋆ ⋆ ⋆
1. (a) Explain how would you create an Ordered list.(b) Create a HTML table with columns for a country-name, national sport, na-
tional flower, national animal and national tree. There must be at least five
states as rows in the table. [6+10]
2. (a) Create a javascript which has event handlers for the buttons “red”, “blue”,
“green”, “yellow” and “orange” which must produce messages stating the
chosen favorite color.The event handler must be implemented as a function,
whose name must be assigned to the onclick attribute of the radio button
elements. The chosen color must be sent to the event handler as a parameter.
(b) Insert an image into a web page. Write a script which displays a message
when the mouse is over the image. The co-ordinates of the mouse should be
displayed if click is attempted on the image. [8+8]
3. (a) Explain the use of XML schema in the web designing application.
(b) Write about the importance of namespaces in XML. [8+8]
4. Take the TickTock Bean available in BDK, build an application which controls the
Colors Bean. Develop the necessary code to exhibit the bound properties of java
beans with the above mentioned beans. [16]
5. What is a servlet? Explain lifecycle of a servlet. Illustrate with an example pro-
gram. [16]
6. (a) Write about the JSP processing.
(b) Explain the components of JSP. [8+8]
7. (a) Which is the biggest scope provided by JSP? Explain it.
(b) Develop a JSP which uses two Beans in different scopes. [8+8]
8. (a) Discuss about prepared statements.
(b) Write a note on java.sql.Driver class. [8+8]
⋆ ⋆ ⋆ ⋆ ⋆
1 of 1
Code No: R05410502 Set No. 2
IV B.Tech I Semester Regular Examinations, November 2008
WEB TECHNOLOGIES
(Computer Science & Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆ ⋆ ⋆ ⋆ ⋆
1. Explain the following terms related to HTML table:(a) Cell padding and spacing
(b) Borders
(c) Formatting content in Table cells
(d) Nested tables. [4+4+4+4]
2. (a) Compare and contrast HTML and DHTML.
(b) Write a javascript to validate a form consisting of a username. Also navigate
to another web page after validation. [8+8]
3. (a) With a suitable example explain the creation of namespaces in XML.
(b) Explain the various types of XML schema data types used. [8+8]
4. (a) Explain the following given interfaces and their usage:
i. AppletInitializer
ii. BeanInfo
iii. Customizer
iv. DesignMode.
(b) Explain the significance of Enterprise Java Beans in the present day ‘backend
business code’. [8+8]
5. (a) Create a HTML form with three input fields first name, last name and e-mail.
Pass these values to a servlet. In the servlet, verify all input fields are not null
and display them back to client.
(b) Give the signature of a method which in used to read bytes from the stream
for a servlet. Explain its usage. [10+6]
6. Explain JSP application design with suitable example? [16]
7. (a) Develop a JSP to keep track number of users and display a message “You are nth visitor” where n is number of user.
(b) Write a detail note on JSP escape sequences. [10+6]
8. Explain the process of getting/accessing metadata for a resultset. [16]
⋆ ⋆ ⋆ ⋆ ⋆
1 of 1
Code No: R05410502 Set No. 3
IV B.Tech I Semester Regular Examinations, November 2008
WEB TECHNOLOGIES
(Computer Science & Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆ ⋆ ⋆ ⋆ ⋆
1. (a) Create a simple HTML page which demonstrates the use of the various types
of lists. Try adding a definition list which uses an unordered list to define1. (a) Create a simple HTML page which demonstrates the use of the various types
terms.
(b) Write a program to construct a binary tree and to traverse the same in post-
order. [8+8]
2. (a) Create a javascript which has event handlers for the buttons “red”, “blue”,
“green”, “yellow” and “orange” which must produce messages stating the
chosen favorite color.The event handler must be implemented as a function,
whose name must be assigned to the onclick attribute of the radio button
elements. The chosen color must be sent to the event handler as a parameter.
(b) Insert an image into a web page. Write a script which displays a message
when the mouse is over the image. The co-ordinates of the mouse should be
displayed if click is attempted on the image. [8+8]
3. (a) Give the syntax of an XML document and explain how a basic XML document
is created with an example.
(b) Explain the following terms related to Document Type Definition:
i. elements
ii. attributes & entities
iii. internal & external entities. [8+8]
4. Write about the following:
(a) Bean methods
(b) Bean properties
(c) Bean events. [4+8+4]
5. (a) Create a Servlet that displays the current date and time.
(b) Make a Comparison of JSDK and Apache Tomcat. [10+6]
6. (a) Develop a JSP to accept users first name and then welcome the user by name.
(b) Discuss about javax.servlet.jsp.tagext package. [10+6]
7. (a) Develop a JSP with a Bean in the application scope.
(b) What is a scriplet? Write about scriplet elements. [8+8]
8. Write short notes on:(a) Connection Interface
(b) Statement Object
(c) Inner join
(d) Execute Query Method. [4×4]
⋆ ⋆ ⋆ ⋆ ⋆
2 of 2
Code No: R05410502 Set No. 4
IV B.Tech I Semester Regular Examinations, November 2008
WEB TECHNOLOGIES
(Computer Science & Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆ ⋆ ⋆ ⋆ ⋆
1. (a) What are the different types of lists in HTML? Explain how these lists are
created in HTML with suitable examples.(b) Explain how a basic table is created using HTML. [8+8]
2. (a) Describe the primitive data types that Javascript uses.
(b) Write a script that reads an integer and determines and displays whether it is
an odd or even number. [16]
3. (a) Create a DTD for a catalog of four-stroke motorbikes, where each motorbike
has the following child elements-make, model, year, color, engine, chasis
number and accessories. The engine element has the child elements engine
number, number of cylinders, type of fuel. The accessories element has
the attributes like disc brake, auto − start & radio, each of which is required
and has the possible values yes and no. Entities must be declared for the
names of the popular motorbike makes.
(b) Give the advantages and disadvantages of XML schemas. [8+8]
4. Take the TickTock Bean available in BDK, build an application which controls the
Colors Bean. Develop the necessary code to exhibit the bound properties of java
beans with the above mentioned beans. [16]
5. (a) What is a Cookie? Give the information that is saved for each cookie on the
user’s machine.
(b) Explain HttpSession Interface. [8+8]
6. (a) What are the limitations of Servlets? How JSP over comes these Problems.
(b) Discuss about Tomcat Server. [8+8]
7. Discuss about of session scope- manually and automatically with suitable examples.
[16]
8. Write short notes on following:
(a) Pure Java driver
(b) Driver Manager
(c) SQL query
(d) Order by clause. [4×4]
⋆ ⋆ ⋆ ⋆ ⋆
1 of 1
Data Mining Question Papers
Code No: R05410503 Set No. 1
IV B.Tech I Semester Regular Examinations, November 2008
DATA WAREHOUSING AND DATA MINING
(Computer Science & Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆ ⋆ ⋆ ⋆ ⋆
1. (a) Explain data mining as a step in the process of knowledge discovery.(b) Differentiate operational database systems and data warehousing. [8+8]
2. (a) Discuss in detail about data transformation.
(b) Explain about concept hierarchy generation for categorical data. [8+8]
3. Discuss the importance of establishing a standardized data mining query language.
What are some of the potential benefits and challenges involved in such a task?
List and explain a few of the recent proposals in this area. [16]
4. Write short notes for the following in detail:
(a) Attribute-oriented induction.
(b) Efficient implementation of Attribute-oriented induction. [8+8]
5. (a) What is an iceberg query? Give an example.
(b) Explain about mining distance based association rules.
(c) How are meta rules useful? Explain with example. [5+6+5]
6. (a) Why naive Bayesian classification called “naive”? Briefly outline the major
ideas of naive Bayesian classification.
(b) Define regression. Briefly explain about linear, non-linear and multiple regres-
sions. [8+8]
7. (a) What is Cluster Analysis? What are some typical applications of clustering?
What are some typical requirements of clustering in data mining?
(b) Discuss about model-based clustering methods. [2+2+5+7]
8. Explain the following:
(a) Mining time-series and sequence data
(b) Mining text databases. [8+8]
⋆ ⋆ ⋆ ⋆ ⋆
1 of 1
Code No: R05410503 Set No. 2
IV B.Tech I Semester Regular Examinations, November 2008
DATA WAREHOUSING AND DATA MINING
(Computer Science & Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆ ⋆ ⋆ ⋆ ⋆
1. (a) Explain data mining as a step in the process of knowledge discovery.(b) Differentiate operational database systems and data warehousing. [8+8]
2. (a) Briefly discuss about data integration.
(b) Briefly discuss about data transformation. [8+8]
3. Write the syntax for the following data mining primitives:
(a) The kind of knowledge to be mined.
(b) Measures of pattern interestingness. [16]
4. (a) Write the algorithm for attribute-oriented induction. Explain the steps in-
volved in it.
(b) How can concept description mining be performed incrementally and in a
distributed manner? [8+8]
5. (a) Explain about iceberg queries with example.
(b) Can we design a method that mines the complete set of frequent item sets
without candidate generation? If yes, explain with example. [8+8]
6. (a) Why is tree pruning useful in decision tree induction? What is a draw back
of using a separate set of samples to evaluate pruning?
(b) How rough set approach and fuzzy set approaches are useful for classification?
Explain. [8+8]
7. (a) Give an example of how specific clustering methods may be integrated, for
example, where one clustering algorithm is used as a preprocessing step for
another.
(b) Write CURE algorithm and explain. [10+6]
8. (a) Explain about multidimensional analysis and descriptive mining of complex
data objects.
(b) Describe similarity search in time-series analysis.
(c) What are cases and parameters for sequential pattern mining? [8+4+4]
⋆ ⋆ ⋆ ⋆ ⋆
1 of 1
Code No: R05410503 Set No. 3
IV B.Tech I Semester Regular Examinations, November 2008
DATA WAREHOUSING AND DATA MINING
(Computer Science & Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆ ⋆ ⋆ ⋆ ⋆
1. (a) Explain data mining as a step in the process of knowledge discovery.(b) Differentiate operational database systems and data warehousing. [8+8]
2. (a) Briefly discuss about data integration.
(b) Briefly discuss about data transformation. [8+8]
3. Explain the syntax for the following data mining primitives:
(a) Task-relevant data
(b) The kind of knowledge to be mined
(c) Interestingness measures
(d) Presentation and visualization of discovered patterns. [16]
4. (a) Attribute-oriented induction generates one or a set of generalized descriptions.
How can these descriptions be visualized?
(b) Discuss about the methods of attribute relevance analysis? [8+8]
5. (a) How can we mine multilevel Association rules efficiently using concept hierar-
chies? Explain.
(b) Can we design a method that mines the complete set of frequent item sets
without candidate generation. If yes, explain with example. [8+8]
6. (a) Explain about basic decision tree induction algorithm.
(b) Discuss about Bayesian classification. [8+8]
7. (a) Use a diagram to illustrate how, for a constant MinPts value, density-based
clusters with respect to a higher density (i.e., a lower value for ε , the neigh-
borhood radius) are completely contained in density- connected sets obtained
with respect to a lower density.
(b) Give an example of how specific clustering methods may be integrated, for
example, where one clustering algorithm is used as a preprocessing step for
another. [8+8]
8. (a) Explain multidimensional analysis of multimedia data.
(b) Define Information retrieval. What are basic measures for text retrieval?
(c) What is keyword-based association analysis?
(d) Briefly discuss about mining the World Wide Web. [5+4+3+4]
⋆ ⋆ ⋆ ⋆ ⋆
1 of 1
Code No: R05410503 Set No. 4
IV B.Tech I Semester Regular Examinations, November 2008
DATA WAREHOUSING AND DATA MINING
(Computer Science & Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆ ⋆ ⋆ ⋆ ⋆
1. (a) Discuss about Concept hierarchy.(b) Briefly explain about - classification of database systems. [8+8]
2. Explain various data reduction techniques. [16]
3. The four major types of concept hierarchies are: schema hierarchies, set-grouping
hierarchies, operation-derived hierarchies, and rule-based hierarchies.
(a) Briefly define each type of hierarchy.
(b) For each hierarchy type, provide an example. [16]
4. (a) What is Concept description? Explain.
(b) What are the differences between concept description in large data bases and
OLAP? [8+8]
5. (a) Which algorithm is an influential algorithm for mining frequent item sets for
Boolean association rules. Explain.
(b) Discuss about association mining using correlation rules. [8+8]
6. (a) How scalable is decision tree induction? Explain.
(b) Explain about prediction. [8+8]
7. (a) How does the k-means algorithm work? Explain with example.
(b) Explain about grid-based methods in clustering. [8+8]
8. (a) Describe latent semantic indexing technique with an example.
(b) Discuss about mining time-series and sequence data. [4+12]
⋆ ⋆ ⋆ ⋆ ⋆
Subscribe to:
Posts (Atom)