2023 2024 Student Forum

2023 2024 Student Forum (https://management.ind.in/forum/)
-   Main Forum (https://management.ind.in/forum/main-forum/)
-   -   JNTU Hyderabad online bits (https://management.ind.in/forum/jntu-hyderabad-online-bits-15331.html)

amit_rri145 4th December 2012 11:44 AM

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?

Deven45 6th December 2012 05:03 PM

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?

Shaleen 7th December 2012 09:07 AM

Re: JNTU Hyderabad online bits
 
1 Attachment(s)
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 ___________. [ ]

Unregistered 21st March 2015 02:10 PM

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?

Raman Vij 21st March 2015 02:29 PM

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

[MAP]JNTU Hyderabad [/MAP]


All times are GMT +5. The time now is 08:55 AM.

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


1 2 3 4