E-Books..Question Bank...Previous Year Question Papers...E-Articles..Videos..Tech Posts..Placement Material..
ClipNabber allows you to download videos from YouTube, Metacafe, etc by simply copying and pasting the URL. You’ll then get a link whereby you can download the file to your computer, iPod, iPhone, or any other media player. You’ll need to have an FLV player for the YouTube videos. Quick and very easy to use!
Zamzar is a free online file conversion web application that can not only convert videos off the Internet to AVI, MPEG, 3GP, MP4, MOV, etc, but also converts between audio, image, and document formats. Paste the URL into Step 1 and then convert the file to your favorite format.
VideoDownloader is a FireFox extension, but also allows you to paste in any URL from many sites such as Blip.TV, iFilm, and even social networking sites like MySpace. You can also download a free FLV player from their site to play the videos.
Vixy.net is another site that not only downloads online videos, but will also convert them AVI, MOV, MP4, 3GP, or MP3 (if you want to extract the audio from the file). Using this site, you don’t have to worry about downloading a FLV player as you can convert it to Windows format. (Same as Zamzar)
KeepVid also supports just about any video sharing site out there and the only difference about this site is that it also has a Top Videos section, so you can quickly download the most watched videos around the web.
Media Converter is similar to ZamZar and vixy.net, but requires you to create an account and log in. Also, it seems like it only supports downloading and converting videos from YouTube. You can also download their video download program, but it only supports 5 sites.
Hey! Watch is an online video encoding web service that encodes video into different formats including HD very quickly. The graphical interface is very nice and there are lots of features and options, such as the ability to transfer any video from the web directly to an FTP server or to online storage.
YoutubeX, as the name suggests, allows you to download videos from YouTube. Obviously, it only supports YouTube, but it has a couple of other features, such as the ability to play your video on the site and find popular videos quickly.
VideoRonk searches across multiple video-sharing sites such as Google Video, YouTube, MetaCafe and DailyMotion to find the most popular videos on each of them. You can either watch them on VideoRonk or download them to your computer in FLV format.
CHECK OUT THE FOLLOWING WEBSITES TO GAIN MORE IDEAS ABOUT THE CONCEPTS
http://www.site.uottawa.ca/~stan/csi2514/applets/avl/BT.html
http://www.cs.jhu.edu/~goodrich/dsa/trees/avltree.html
http://www.cs.auckland.ac.nz/software/AlgAnim/heaps.html
http://webpages.ull.es/users/jriera/Docencia/AVL/AVL%20tree%20applet.htm
Dijkstra’s Shortest Path Algorithm
http://www.dgp.toronto.edu/people/JamesStewart/270/9798s/Laffra/DijkstraApplet.html
http://www-b2.is.tokushima-u.ac.jp/~ikeda/suuri/dijkstra/Dijkstra.shtml
http://www-b2.is.tokushima-u.ac.jp/~ikeda/suuri/dijkstra/PrimApp.shtml?demo6
http://www.cs.duke.edu/csed/jawaa/DFSanim.html
http://students.ceid.upatras.gr/~papagel/project/contents.htm
http://cgm.cs.mcgill.ca/~godfried/teaching/algorithms-web.html
http://students.ceid.upatras.gr/~papagel/project/kef5_7_1.htm
http://www.unf.edu/~wkloster/foundations/DijkstraApplet/DijkstraApplet.htm
http://www.cs.umd.edu/~egolub/Java/AVLTree.html
http://www.cs.jhu.edu/~goodrich/dsa/trees/avltree.html
http://people.ksp.sk/~kuko/bak/
http://www.ibiblio.org/kuphaldt/socratic/doc/pyramid.png
http://www.cosc.canterbury.ac.nz/mukundan/dsal/appldsal.html
http://users.encs.concordia.ca/~twang/WangApr01/RootWang.html
http://www.cs.usask.ca/content/resources/tutorials/csconcepts/2001_3/tutorials/traversal.html
Unit -I
2 marks
1. Define ADT.
2. Give the structure of Queue model.
3. What are the basic operations of Queue ADT?
4. What is Enqueue and Dequeue?
5. Give the applications of Queue.
6. What is the use of stack pointer?
7. What is an array?
8. Define ADT (Abstract Data Type).
9. Swap two adjacent elements by adjusting only the pointers (and not the data) using singly
linked list.
10. Define a queue model.
11. What are the advantages of doubly linked list over singly linked list?
12. Define a graph
13. What is a Queue?
14. What is a circularly linked list?
15. What is linear list?
16. How will you delete a node from a linked list?
17. What is linear pattern search?
18. What is recursive data structure?
19. What is doubly linked list?
Unit 1
part B
1. Explain the implementation of stack using Linked List.
2. Explain Prefix, Infix and postfix expressions with example.
3. Explain the operations and the implementation of list ADT.
4. Give a procedure to convert an infix expression a+b*c+(d*e+f)*g to postfix notation
5. Design and implement an algorithm to search a linear ordered linked list for a given
alphabetic key or name.
6. (a) What is a stack? Write down the procedure for implementing various stack
operations(8)
(b) Explain the various application of stack? (8)
7. (a) Given two sorted lists L1 and L2 write a procedure to compute L1_L2 using only the
basic operations (8)
(b) Write a routine to insert an element in a linked list (8)
8. What is a queue? Write an algorithm to implement queue with example.
Unit 2 and 3
part a
1.Explain Tree concept?
2. What is meant by traversal?
3. What is meant by depth first order?
4. What is In order traversal?
5. What is Pre order traversal?
6. What is Post order traversal?
7. Define Binary tree.
8. What is meant by BST?
9. Define AVL trees.
10. Give example for single rotation and double rotation.
11. Define Hashing.
12. Define Double Hashing.
13. What is meant by Binary Heap?
14. Mention some applications of Priority Queues.
15. Define complete binary tree.
16. How a binary tree is represented using an array? Give an example
17. A full node is a node with two children. Prove that the number of full nodes plus one is
equal to the number of leaves in a non empty binary tree.
18. Define (i) inorder (ii) preorder (iii) postorder traversal of a binary tree.
19. Suppose that we replace the deletion function, which finds, return, and removes the
minimum element in the priority queue, with find min, can both insert and find min be
implemented in constant time?
20. What is an expression tree?
1. Explain the representation of priority queue
2. Compare the various hashing Techniques.
3. List out the steps involved in deleting a node from a binary search tree.
4. What is binary heap?
5. Define Binary search tree.
6. List out the various techniques of hashing
7. Define hash function.
8. Show that maximum number of nodes in a binary tree of height H is 2H+1 – 1.
9. Define hashing.
10. Define AVL tree.
Unit 2and 3
part B
1. Explain the operation and implementation of Binary Heap.
2. Explain the implementation of different Hashing techniques.
3. Give the prefix, infix and postfix expressions corresponding to the tree given in figure.
4. (a) How do you insert an element in a binary search tree? (8)
(b) Show that for the perfect binary tree of height h containing2h+1-1 nodes, the sum of
the heights of the nodes 2h+1 -1-1(h+1). (8)
5. Given input {4371,1323,6173,4199,4344,9679,1989} and a hash function
h(X)=X(mod10), show the resulting:
(a) Separate chaining table (4)
(b) Open addressing hash table using linear probing (4)
(c) Open addressing hash table using quadratic probing (4)
(d) Open addressing hash table with second hash function h2(X) =7-(X mod 7). (4)
6. Explain in detail (i) Single rotation (ii) double rotation of an AVL tree.
7. Explain the efficient implementation of the priority queue ADT
8. Explain how to find a maximum element and minimum element in BST? Explain detail
about Deletion in Binary Search Tree?
1. (a) Construct an expression tree for the expression A+(B-C)*D+(E*F) (8)
(b) Write a function to delete the minimum element from a binary heap (8)
2. Write a program in C to create an empty binary search tree & search for an element X in
it. (16)
3. Explain in detail about Open Addressing (16)
4. Explain in detail insertion into AVL Trees (16)
5. Write a recursive algorithm for binary tree traversal with an example. (16)
6. Write an algorithm for initializing the hash table and insertion in a separate chaining (16)
Unit 4
part A
Define Graph.
2. What is meant by directed graph?
3. Give a diagrammatic representation of an adjacency list representation of a graph.
4. What is meant by topological sort?
5. What is meant by acyclic graph?
6. What is meant by Shortest Path Algorithm?
7. What is meant by Single-Source Shortest path problem?
8. What is meant by Dijkstra’s Algorithm?
9. What is minimum spanning tree?
10. Mention the types of algorithm.
11. Define NP- complete problems
12. What is space requirement of an adjacency list representation of a graph
13. What is topological sort?
14. What is breadth-first search?
15. Define minimum spanning tree
16. Define undirected graph
17. What is depth-first spanning tree
18. What is Bio connectivity?
19. What is Euler Circuit?
20. What is a directed graph?
21. What is meant by ‘Hamiltonian Cycle’?
22. Define (i)indegree (ii)outdegree
1. Explain the topological sort.
2. Define NP hard & NP complete problem.
3. Prove that the number of odd degree vertices in a connected graph should be even.
4. What is an adjacency list? When it is used?
5. What is an activity node of a graph?
6. Define Breadth First Search.
7. Define Depth First Search.
8. Define Minimum Spanning Tree.
9. Define Shortest Path of a graph.
10. Define Biconnectivity.
1. Define Graph.
2. What is meant by directed graph?
3. Give a diagrammatic representation of an adjacency list representation of a graph.
4. What is meant by topological sort?
5. What is meant by acyclic graph?
6. What is meant by Shortest Path Algorithm?
7. What is meant by Single-Source Shortest path problem?
8. What is meant by Dijkstra’s Algorithm?
9. What is minimum spanning tree?
10. Mention the types of algorithm.
11. Define NP- complete problems
12. What is space requirement of an adjacency list representation of a graph
13. What is topological sort?
14. What is breadth-first search?
15. Define minimum spanning tree
16. Define undirected graph
17. What is depth-first spanning tree
18. What is Bi connectivity?
19. What is Euler Circuit?
20. What is a directed graph?
21. What is meant by ‘Hamiltonian Cycle’?
22. Define (i)indegree (ii)outdegree
Unit 4
part B
1. Explain Prim’s & Kruskal‘s Algorithm with am example.
2. Describe Dijkstra’s algorithm with an example.
3. Explain how to find shortest path using Dijkstra’s algorithm with an example.
4. Explain the application of DFS.
5.Find a minimum spanning tree for the graph
using both Prim’s and Kruskal’s algorithms.
6. Explain in detail the simple topological sort pseudo code
7. Write notes on NP-complete problems
1. Formulate an algorithm to find the shortest path using Dijkstra’s algorithm and explain
with example. (16)
2. Explain the minimum spanning tree algorithms with an example. (16)
3. (a) Write short notes on Biconnectivity. (8)
(b) Write an algorithm for Topological Sort of a graph. (8)
4. Write and explain weighted and unweighted shortest path algorithm (16)
5. Explain the various applications of Depth First Search. (16)
1. Explain Prim’s & Kruskal‘s Algorithm with am example.
2. Describe Dijkstra’s algorithm with an example.
3. Explain how to find shortest path using Dijkstra’s algorithm with an example.
4. Explain the application of DFS.
5. Find a minimum spanning tree for the graph
using both Prim’s and Kruskal’s algorithms.
6. Explain in detail the simple topological sort pseudo code
7. Write notes on NP-complete problems
Unit V
part A
1. Define Program
2. Define Algorithm
3. Define Problem Definition Phase
4. What are the problem solving strategies?
5. Define Top Down Design.
6. What is the basic idea behind Divide & Conquer Strategy?
7. Define Program Verification.
8. Define Input & Output Assertion.
9. Define Symbolic Execution
10. Define Verification Condition
11. Define the qualities of good algorithm.
12. Define Computational Complexity.
13. What is O – notation?
14. What is Recursion? Explain with an example.
15. List out the performance measures of an algorithm.
1. Define Algorithm & Notion of algorithm.
2. What is analysis framework?
3. What are the algorithm design techniques?
4. How is an algorithm’s time efficiency measured?
5. Mention any four classes of algorithm efficiency.
6. Define Order of Growth.
7. State the following Terms.
(i) Time Complexity
(ii) Space Complexity
8. What are the various asymptotic Notations?
9. What are the important problem types?
10. Define algorithmic Strategy (or) Algorithmic Technique.
11. What are the various algorithm strategies (or) algorithm Techniques?
12. What are the ways to specify an algorithm?
13. Define Best case Time Complexity .
14. Define Worst case Time Complexity.
15. Define Average case time complexity.
16. What are the Basic Efficiency Classes.
17. Define Asymptotic Notation.
18. How to calculate the GCD value?
1. What is meant by algorithm? What are its measures?
2. Give any four algorithmic techniques.
3. Write an algorithm to find the factorial of a given number?
4. Define the worst case & average case complexities of an algorithm
5. What is divide & conquer strategy?
6. What is dynamic programming?
7. Write at least five qualities & capabilities of a good algorithm
8. Write an algorithm to exchange the values of two variables
9 Write an algorithm to find N factorial (written as n!) where n>=0.
Unit V
part B
1. (a) Explain in detail the types on analysis that can be performed on an algorithm (8)
(b) Write an algorithm to perform matrix multiplication algorithm and analyze the
same (8)
2. Design an algorithm to evaluate the function sin(x) as defined by the infinite series
expansion sin(x) = x/1!-x3/3! +x5/5!-x7/7! +……
3. Write an algorithm to generate and print the first n terms of the Fibonacci series where
n>=1 the first few terms are 0, 1, 1, 2, 3, 5, 8, 13.
4. Design an algorithm that accepts a positive integer and reverse the order of its digits.
5. Explain the Base conversion algorithm to convert a decimal integer to its
corresponding octal representation.
6. Explain in detail about Greedy algorithm with an example(16).
7. Explain in detail about Divide and conquer algorithm with an example also mark the difference between Greedy and divide and conquer algorithm.(16).
8. Describe the backtracking problem using knapsack problem .(16).
Your's friendly,
[MOHANRAM.G],
ADMIN...
10. Remember employers these days are paying even more attention to the resumes. Due to the recession period they want to hire the best but after enough checking. Any silly mistake in your resume may spell doom to your chances to get the job.
To determine whether an e-mail address is professional, ambiguous, or unprofessional, both parts of the address, i.e. the local element before the ‘@’ sign and the domain name that follows have to be considered. Furthermore both elements have to be judged singularly and jointly to determine whose interests the e-mail address best represents.
To clarify further it is worth looking at examples and classifying them accordingly. For the purpose of examination the examples are based on the premise that the owner is using the e-mail address in a professional context.
Examples and classification
john.doe@companyABC.com
Context: John Doe has a professional relationship with the domain name owner.
In this example the local element before the ‘@’ sign adopts a conventional, informative and factual format, and the domain name represents and promotes the interests of an entity that John Doe has a professional relationship with (namely companyABC).
Class: Professional.
sales@companyABC.com
Context: ‘sales’ has a professional relationship with the domain name owner.
In this example the local element before the ‘@’ sign adopts a conventional, informative and factual format, and the domain name represents and promotes the interests of an entity that ‘sales’ has a professional relationship with (i.e. companyABC).
Class: Professional.
jane.doe@mortgagebrokers-sonline.com
Context: The domain owner has a professional relationship with Jane Doe and others who operate in the mortgage broker industry.
From Jane Doe’s perspective the domain name represents three separate entities: Jane herself, others that use mortgagebrokers-online to market their services, and the entity that operates mortgagebrokers-online itself. In this case separate parties are operating in consensus to share a domain name for mutual advantage The domain name identifies and communicates the industry that Jane is operating in, and the local element before the ‘@’ sign, (i.e. her name), is conventional, informative, and factual.
Class: Professional.
john.doe@it-consultant.com
Context: john.doe is an IT consultant but has no professional relationship with the domain owner.
In this example the local element before the ‘@’ sign is conventional, informative, and factual, and the domain name acts to identify and therefore market John Doe’s skills or services.
Class: Professional.
teddy.bears@myunusual-domain.com
Context: the term ‘teddy.bears’ has a professional relationship with myunusual-domain.com and is relevant to a service, product, or other element associated with the owners’ professional interests.
This e-mail address can initially appear to be unprofessional however the owner may be providing a niche service. From the owner’s perspective the entire e-mail address may accurately reflect their business interests in a meaningful and professional sense.
Class: Professional.
companyABC@yahoo.com
Context: companyABC and yahoo.com have no professional relationship.
In this example the elements before and after the ‘@’ sign adopt a conventional, informative and factual format. Use of this e-mail address virally markets the name of companyABC, however it also endorses the services of the webmail service / domain owner. CompanyABC is using an address that in its’ entirety, does not represent or promote its professional interests. Given the relative ease of acquiring a professional domain name, and the fact that companyABC is claiming an Internet presence, use of this email address is not considered professional.
Class: Ambiguous / unprofessional.
jane.doe@gmail.com
Context: jane.doe and gmail.com have no professional relationship.
As with the previous example this address acts to serve the interests of the domain owner / service provider. Whilst jane.doe has elected to use a standard format for the local element before the ‘@’ sign, the overall e-mail address does not actively market or promote her professional interests.
Class: Unprofessional.
johndoe.superguy06@hotmail.com
Context: johndoe.superguy06 and hotmail.com have no professional relationship. Assuming Johndoe has no professional interest associated with the term ‘superguy06’ this e-mail address does not actively promote or market johndoe in a professional context. Furthermore, the format used before the ‘@’ sign is, for argument purposes, neither factual nor informative and will not be respected professionally. The address does however actively promote the e-mail service provider. Johndoe has endorsed their service and is performing viral marketing on their behalf. From the service providers perspective their professional interests have been represented in a positive manner by the fact that Johndoe is using their product.
Class: Unprofessional.
Conclusion
In order for an e-mail address to be classified as professional, ambiguous, or unprofessional, it needs to be considered in context, format, and in terms of factual and informative content. The local and domain name elements of the address need to be considered in their relationship to each other, and the intended audience of the e-mail address needs to be understood.
| |||||||||||||||
| |||||||||||||||
| Screen captures can be used for many reasons. Use captured images from Gadwin PrintScreen to show off your product on the web. Enhance technical or sales documents and embed captures into presentations. Gadwin PrintScreen can help you capture and print or save computer screen data. | |||||||||||||||
| On most Windows computers a full screen of data can be put on the clipboard by pressing the PrintScreen key. This sends whatever you see on screen to the clipboard, which you must then edit in a different graphics program to cut to the right size and image format. Here are some other reasons not to use the prefabricated PrintScreen function of Windows:
Use Gadwin PrintScreen to save time and enhance your screen shots! Download Gadwin PrintScreen now and try it out! This is the best way to learn what it can do. | |||||||||||||||
| Gadwin PrintScreen requires Microsoft ® Windows 98/Me/2000/2003/XP/Vista, or Windows NT 4.0SP6. If you are running any of these operating systems and have a Windows-compatible mouse or pointing device, your system has already met all the requirements necessary to run Gadwin PrintScreen. A full installation of Gadwin PrintScreen requires 5 megabyte of hard drive space. http://www.gadwin.com/printscreen/ | |||||||||||||||
