Posts

DATA STRUCTURE (IMP QUESTIONS )FOR (BE STUDENTS ,DIPLOMA STUNDENTS,UNIVERSITY) (CHEPTAR WISE )

Image
DATA STRUCTURE IMPORTANT QUESTIONS :  πŸ‘‡πŸ‘‡πŸ‘‡πŸ‘‡πŸ‘‡πŸ‘‡πŸ‘‡ QUESTIONS : 1 . WHAT IS DATA STRUCTURE AND TYPES OF DATA STRUCTURE ? 2.DIFFERENCE BETWEEN LINIEAR DATA AND NON LINEAR DATA STRUCTURE. 3 DIFFERNECE BETWEEN PRIMITIVE AND NON-PRIMITIVE DATA STRUCTURE . 4. WRITE ALGORITHM FOR PUSH AND POP STACK OPERATION 5.APPLICATION OF STACK AND QUEUE . 6. WRITE A C FUNCATION FOR INSERATION AND DELETION OPERATION IS SIMPLE QUEUE. 7.WRITE AN ALGORITHM TO DELETE AN ELEMENT FROM CIRCULAR QUEUE SHOWS THE STEPS OF INSERATION AND DELETION OPERATION IS SAMPLE CIRCULAR QUEUE. 8.DESCRIBE THE ADVANTAGE OF LINKED LIST OVER ARRY. 9.WRITE AN ALGORITHM TO INSERT A NODE ATLAST POSTION IN DOUBLY LINKED LIST. 10.EXPLAIN ARRAY IN DATA STRUCTURE .  11.WORKING OF PRIORITY QUEUE WITH SDING ORDER BY APPLYING QUUITABLE EXAMPLE . 12.WIRTE RECURSIVE ALGORITHMS TO COMPLETE FACTORIAL OF A GIVEN NUMVBERS WHICH DATA STRUCTURE CAN BE USED TO IMPLEMENT THIS ALGORITHMS. 13. SORT THE FOLLOWING NUMBER IN ASCENDING ORDER BY APPLYING QU

ANALYSIS OF ALGORITHM

Image
ANALYSIS OF ALGORITHM :   In theoretical analysis of algorithms, it is common to estimate their complexity in the asymptotic sense, i.e., to estimate the complexity function for arbitrarily large input. The term   "analysis of algorithms"   was coined by Donald Knuth. Algorithm analysis is an important part of computational complexity theory, which provides theoretical estimation for the required resources of an algorithm to solve a specific computational problem. Most algorithms are designed to work with inputs of arbitrary length. Analysis of algorithms is the determination of the amount of time and space resources required to execute it. Usually, the efficiency or running time of an algorithm is stated as a function relating the input length to the number of steps, known as  time complexity , or volume of memory, known as  space complexity . The Need for Analysis In this chapter, we will discuss the need for analysis of algorithms and how to choose a better algorithm for a

ANALYSIS TO DESIGN ALGORITHM (DETAILDED EXPLNATION) WHAT IS ALGORITHM

Image
πŸ‘‰WHAT IS ALGORITHM :  πŸ‘‡ YOU CAN ALSO WATCH VIDEO FOR MORE UNDERSTANDING WHAT IS ALGORITHM :  An algorithm is a set of steps of operations to solve a problem performing calculation, data processing, and automated reasoning tasks. An algorithm is an efficient method that can be expressed within finite amount of time and space. An algorithm is the best way to represent the solution of a particular problem in a very simple and efficient way. If we have an algorithm for a specific problem, then we can implement it in any programming language, meaning that the  algorithm is independent from any programming languages . Algorithm Design The important aspects of algorithm design include creating an efficient algorithm to solve a problem in an efficient way using minimum time and space. To solve a problem, different approaches can be followed. Some of them can be efficient with respect to time consumption, whereas other approaches may be memory efficient. However, one has to keep in mind that

HOW TO MAKE BEAUTIFUAL DESIGN USING TURTLE (SOUCRE CODE IS AVAILABLE )

Image
   BEAUTIFUL  DESIGN USING TURTLE IN PYTHON 🐒      πŸ‘‰  how to create Many Beautiful Designs using Python  Turtle  in the same code. The code for the turtle program is given below. Accordingly, this article will explain to you how you can code in turtles that will allow you to create some cool designs. We will first see the code and then, we will understand it line-by-line. Now let’s see the code for design.     πŸ‘‡πŸ‘‡πŸ‘‡πŸ‘‡   CODE : import turtle wn=turtle.Screen() turtle.bgcolor('black') turtle.shape('turtle') tr=turtle.Turtle() ts=turtle.Turtle() tt=turtle.Turtle() t2=turtle.Turtle() t3=turtle.Turtle() t4=turtle.Turtle() t5=turtle.Turtle() move=1 ############################### t5.speed("fastest") for i in range(10):     for i in range(4):           t5.pu()           t5.goto(500,200)           t5.pd()           t5.color('cyan')           t5.pensize(3)           t5.circle(50,steps=4)           t5.right(100) t5.speed("fastest") for i in range(6

SESSION LAYER IN COMPUTER NETWORK

Image
  SESSION LAYER IN OSI MODEL : The session layer (layer 5) is responsible for establishing, managing, synchronizing and terminating sessions between end-user application processes. The main functions of the session layer are as follows − It works as a dialog controller. It allows the systems to communicate in either half-duplex or full-duplex mode of communication. It is responsible for token management. Through this, it prevents the two users to simultaneously attempt the same critical operation. It synchronizes communication. It adds synchronization points or checkpoints in data streams for long communications. This ensures that data streams up to the checkpoints are successfully received and acknowledged. In case of any failures, only the streams after the checkpoints have to be re-transmitted.

PRESENTATION LAYER IN OSI MODEL

Image
  PRESENTATION LAYER IN OSI  MODEL   The primary goal of this layer is to take care of the  syntax   and   semantics   of the information exchanged between two communicating systems. Presentation layer takes care that the data is sent in such a way that the receiver will understand the information(data) and will be able to use the data. Languages(syntax) can be different of the two communicating systems. Under this condition presentation layer plays a role translator. In order to make it possible for computers with different data representations to communicate, the data structures to be exchanged can be defined in an  abstract  way. The presentation layer manages these  abstract data structures  and allows higher-level data structures(eg: banking records), to be defined and exchanged. Functions of Presentation Layer Translation:  Before being transmitted, information in the form of characters and numbers should be changed to bit streams. The presentation layer is responsible for intero

HANDWRITTEN NOTES (COMPUTER NETWORK ) USEFULL IN EXAMS (IMP TOPICS)

Image
COMPUTER NETWORK  HANDWRITTEN NOTES:                              πŸ‘‰  (IMP TOPICS )πŸ‘ˆ WHAT IS COMPUTER NETWORK ? CHARACTICS OF COMPUTER NETWORK ? WHAT IS USE OF COMPUTER NETWORK? COMPUTER NETWORK ARCHITECTURE  PEER-PEER NETWORK CLIENT NETWORKS OSI MODEL(ALL LAYER) APPLICATION LAYER TCP/IP PROTOCOL DOWNLOAD HANDWRITTEN NOTES : πŸ‘‡πŸ‘‡πŸ‘‡πŸ‘‡πŸ‘‡ SHARE THIS BLOG 😊