UGC NET Computer Science & Application Preparation Tips

-

UGC NET Computer Science & Application Preparation Tips 


  1. Check the Updated Syllabus
  2. Perfect Planning
  3. Time Management
  4. Practice with Previous Year Papers & Model Test Papers
  5. Proper Revision.

Comments

Post a Comment

Popular posts from this blog

CS2302 Computer Networks _16 Important Questions

-
UNIT  I Explain in detail the error detection and error corrections.(UQ) Discuss in detail about the layers of OSI model. (UQ) Discuss in detail about HDLC. Discuss in detail about SONET. Explain the different approaches of framing in detail. Write the Sliding Window Algorithm and explain it in detail. Compare Stop and Wait ARQ scheme with sliding window ARQ scheme. Write in detail about the flow control mechanisms. UNIT II Name the four basic network topologies and explain them giving all the relevant features.(UQ) Explain the functioning of wireless LAN in detail.(UQ) Explain Ethernet in detail. Discuss the frame format of token ring in detail. Differentiate FDDI from token ring Write in detail about Resilient Packet Ring. Write short notes on WI-Fi,Wi-Max. Write short notes on Cellphone technologies. UNIT III Write notes on the following(UQ) (i) Internet...
Read more

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