EC2352-computer networks - nov/dec 2012 annauniv question

-


Comments

Post a Comment

Popular posts from this blog

2 MARKS FOR DS & OOPS

-
1. What is an Algorithm? An algorithm is clearly specified set of simple instructions to be followed to solve a problem. The algorithm forms a base for program. 2. What are the properties of an Algorithm? _ Takes zero or more inputs _ Results in one or more outputs _ All operations are carried out in a finite time _ Efficient and flexible _ Should be concise and compact to facilitate verification of their correctness. 3. Define Program? It is an instruction and it is written according to the instructions, which is given in the algorithm. 4. What is Complexity analysis? It is the analysis of the amount of memory and time an algorithm requires to completion. There are two types of Complexity 1. Space Complexity 2. Time Complexity 5. Explain the performance analysis of the algorithm? The analysis of the performance of an algorithm based on specification is called performance analysis. It is loosely divided into a. Priori estimates b. Posterior Testing 6. Expl...
Read more

DS &OOPS LAB MANUAL

-
   DATA STRUCTURES AND OBJECT ORIENTED PROGRAMMING LAB LAB MANUAL LIST OF EXPERIMENTS 1.     Basic Programs for C++ Concepts 1.     Area of a Circle Using Class 2.     Find even or odd number Using Class 3.     Print Fibonacci series using Constructors 4.     Implementation of unary operator overloading 5.     Implementation of Multiple inheritance 6.     Find the mean value of a given number using friend function. 7.     Implementation of  Virtual function 8.     To implement String Operations 2.  Array implementation of List Abstract Data Type (ADT) 3.  Linked list implementation of List ADT 4.  Cursor implementation of List ADT 5.  Stack ADT - Array and linked list implementations The next two exercises are to be done by implementing the following source files (a) ...
Read more

PROGRAMMING AND DATA STRUCTURES - 2 MARKS

-
Image
UNIT-I LINEAR STRUCTURE            1.Write down the definition of data structures? A data structure is a mathematical or logical way of organizing data in the memory that consider not only the items stored but also the relationship to each other and also it is characterized by accessing functions. 2    2.   What is meant by problem solving? Problem solving is a creative process, which needs systemization and mechanization. 3.  Give few examples for data structures? Stacks, Queue, Linked list, Trees, graphs 4. What is problem definition phase? The first step in solving a problem is to understand problem clearly. Hence, the first phase is the problem definition phase. That is, to extract the task from the problem statement. If the problem is not understood, then the solution will not be correct and it may result in wastage of time and effort. 5. Define Algorithm? Algorithm is a solution to a problem independent of p...
Read more