Go Back   2018 2019 Student Forum > Management Forum > Main Forum



 
Thread Tools
  #2  
Old 6th December 2012, 05:33 PM
Deven45
Guest
 
Posts: n/a
Default JNTU Hyderabad online bits

I want the online bits for the JNTU Hyderabad B.Tech . Can you provide me the page from where I can get it?
Reply With Quote Quick reply to this message
  #3  
Old 7th December 2012, 09:37 AM
Super Moderator
 
Join Date: May 2012
Posts: 58,013
Default Re: JNTU Hyderabad online bits

As you are looking for online bits for the JNTU Hyderabad.

Here is an attachment that contain the 1st year B.tech mid of English.

Here are some examples of 3rd mid paper of may 2011

JNTUWORLD

According to Satyajit Ray, “With the backing of money, men and materials, it is easy for Hollywood
make a __________. [ ]
(a) War and Peace (b) Pather Panchali (c) Spartacus (d) Aparajito

Satyajit Ray says, “______ is a luxury which we cannot yet afford in our country”. [ ]
(a) film making (b) blockbusters (c) backer (d) Avant-gardism


In the essay ‘odds Against Us’ Satyajit Ray expresses, ‘ There are roles that can only be brought to life
by ___________. [ ]
Attached Files
File Type: pdf JNTU Hyderabad last year mid paper.pdf (105.6 KB, 29 views)
Reply With Quote Quick reply to this message
  #4  
Old 21st March 2015, 02:40 PM
Unregistered
Guest
 
Posts: n/a
Default Re: JNTU Hyderabad online bits

Can you provide me the question paper of Advanced Data Structures of Computer Science of JNTU Online Bits as I need it for preparation?
Reply With Quote Quick reply to this message
  #5  
Old 21st March 2015, 02:59 PM
Super Moderator
 
Join Date: Apr 2013
Posts: 21,055
Default Re: JNTU Hyderabad online bits

Below I am providing you some questions of from question paper of JNTU Hyderabad online bits and attaching a PDF attachment which has detail information regarding this that you can down load for free:

1. Explain about different hashing methods.
2. What is meant by height balanced tree? Write a program to do the insertion of an
element into the AVL tree?
3. (a) Explain about binomial amortized analysis.
(b) Explain about the procedure for delete min from Binary Heap.
4. Explain about different graph traversal techniques with examples.
5. (a)Explain the procedure for finding minimum cost of the graph using Prim’s algorithm
(b) Write an algorithm Dijkstra’s algorithm
6. (a) Write a program to sort n numbers using radix sort.
(b) Sort the following numbers using mergesort
5, 23, 7, 18, 2, 1, 9, 15, 6, 4, 8, 3, 13
7. (a) Explain about multi-way trie?
(b) Write a program for pattern matching using Boyer Moore algorithm
8. Explain about the following functions
(a) Write
(b) getline
(c) Flag option’s in open function

Reply With Quote Quick reply to this message
Reply


Quick Reply
Your Username: Click here to log in

Message:
Options

Thread Tools Search this Thread



All times are GMT +5.5. The time now is 02:24 PM.


Powered by vBulletin® Version 3.8.8
Copyright ©2000 - 2019, vBulletin Solutions, Inc.
SEO by vBSEO 3.6.0 PL2

1 2 3