Subscribe

RSS Feed (xml)

Powered By

Skin Design:
Free Blogger Skins

Powered by Blogger

Friday, September 4, 2009

Round :Basic Computer Science

Hi friends,

Its been sometime since we shared some information regarding the concepts(For those who missed out, We had been doing Few Java Quizzes! Check It out Here 
http://helptotheneeded.blogspot.com/search/label/Java%20Quiz)


Today I would like to present few concepts in basic Computer Science which would be helpful for the readers

Without wasting further time, Here We Go!

1.Give names of two sorting algorithms
  Bubble sort,Insertion sort,Shell sort,Merge sort,Heap sort,Quick sort,Radix sort,Bucket sort,Distribution sort,Shuffle sort.

2.What is the name of the style of programming where the function calls itself?
  Recursion

3.Name any two searching algorithms
  Breadth-First search,Depth limited search,Kruskal's algorithms,Prim's algorithms,Grover's algorithms,Dijikistra's algorithms.

4.What is Pointer?
  A pointer is a variable which contains the address in memory of another variable.

5.Give two names of typical data structure:
  Stack,Queue,Linked list,Doubly Linked List.

6.What is priority queue?
  An element's priority is the time that element was inserted.

7.What is a binary tree?
  A binary tree is a in which each node has at most two .
  -The left of a node contains only nodes with keys less than the node's key. -The right subtree of a node contains only nodes with keys greater than node's key.Both the left and right subtrees must also be binary search trees. 

8.What is a self Referential structure?
  It is a important characteristic of the data structures used to implement lists , is that they contain, as a member, a reference variable of the same type as the class itself. For this reason, these data structures are frequently called self-referential or recursive data structures .

9.What is/are difference(s) between tree and graph?
  -Tree has no loop but graph has loops. 
  -Tree always has direction but graph do not have direction.

10.What is the complexity of the Big O notation in the following pseudo code:
 n=100;
 for(i=O;i  do something;
 }
  The complexity of the Big O notation is o(n)..

No comments: