Showing posts with label technical interview. Show all posts
Showing posts with label technical interview. Show all posts

Define types of Network?



What are the types of Computer Network?


A computer network is the interconnection of various computers located at different places. There are different types of network based on their size(Number of devices), data transfer speed and their reach. There are three main category of networks given below:-

  • LAN
  • MAN
  • WAN



LAN:-


LAN stands for Local Area Network. It connects network devices on a short distance. It is group of computers which all belong to same organisation or building. It links the devices in a single office, campus and building. 
In LAN the data transfer speed can reach up to 10 Mbps for an Ethernet network and 1 Gbps for Gigabit network. It can be reach as many as 100 or even 1000 users. 


MAN:-


MAN stands for Metropolitan Area Network.It is a network that interconnects users with resources in an area larger than that of LAN area but smaller than a WAN area. A MAN is made from switches or routes connected to one another with high speed links. It spread over an entire city.  


WAN:-


It is a geographically-dispersed collection of LANs. It is more larger than LAN and MAN network. The speed varies on WAN depending on the cost of the connection. Computer connected to a WAN network are often connected through public network like telephone system. They can also be connected through leased line and satellites. WAN provides a long distance transmission of data, video,voice and image information over large geographical area like a country, continent or even the whole world. Internet is the most well known WAN network





Define Simplex, Half Duplex and Full Duplex?



What are Data Transmission Modes?


There are following three modes to transmit data from one device to another:-

  • Simplex
  • Half Duplex
  • Full Duplex



Simplex Mode:-


In simplex mode, It is mode of communication between two devices.   The flow of data is unidirectional between devices i.e the communication take place in one direction. In it one can receive and other can transmit. In simplex mode the flow of data is unidirectional then it is rarely used for data communication. 


Example:-

  • Monitor
  • Keyboard




Half Duplex Mode:-

In Half duplex mode, It is mode of communication between two devices. The flow of data is bidirectional between devices but not at same the time i.e each can receive and transmit data but not at the same time. Thus in half duplex mode we can send and receive data in a line but not at same time.

Example:-
  • Walkie-Talkie


Full Duplex Mode:-

In Full duplex mode, It is mode of communication between two devices. The flow of data is bidirectional between devices and at the same time i.e each can receive and transmit data at the same time. Use of full duplex mode increase the efficiency of communication. 

Example:-
  • Telephone




Define Data Communication?



What is Data Communication ?


We know communication is the process of sharing information from one to another. For example the conversation between two people. Data Communication is the exchange of  data between between two devices via some form of transmission media such as wire. It is the transmission of digital data and has the objective to send data at highest speed but lowest cost. Electronic communications like emails and instant messages as well as telephone calls are examples of data communications. The effectiveness of a data communication system depends on the following charcteristics:-



  • Delivery
  • Accuracy
  • Timeliness.



Basic Terms Used In Data Communication:-


  • Data:- Collection of facts(Raw Forms)
  • Signals:- Encoding of data.
  • Signaling:- Propagation of signals via communication medium.
  • Transmission:- Communication of data by processing of signals.




What do you mean By CN?


What do you mean By CN?

CN stands for Computer Network. It is a collection of computers and devices that shares the information across wired or wireless technology. Computer networking needs at least two computers, hardware to connect them and a protocol. Computer networks allow people and machines to communicate, using a number of services. Computer network provide us facility of communication. We can easily communicate to people via emails, chat, telephone and voice and video conferencing. We can share data, files and and other important information easily. We can also use resources provided by devices on the network such as printer. 

Give the difference between Array and Stack?




What is the difference between An Array And Stack?

  • An array is the collection of ordered elements and Stack is also ordered collection of elements. 
  • An array is a static object while Stack is dynamic size object. 
  • Array contains the same data types while Stack may contain different data type. 
  • In array the elements are removed in any order while in case of Stack, It follows the LIFO i.e the last element added to the stack will be the first one to be removed.
  • Array stored in random order while Stack stored in LIFO order. 
  • Both are Linear data structures but the array may be multi-dimensional or one dimensional while the Stack is strictly one dimensional. 

Define Non-Linear Data Structure and it's examples?




What is Non-Linear Data Structure. Define it?

The term Data means Values and Structure means the way it is organized and arranged into mathematical and logical way. So the mathematical and logical model of a particular organisation of data is known as Data Structures. 

Non-Linear Data Structure:-

The Data structure is said to be Non-Linear Data Structures if it's elements do not form a sequence or a linear series but form a hierarchical format.
For Example:- Graph, Tree, Binary Search Tree etc.

What is Graph?

Graph is a data structures which consists of a finite set of ordered pairs called edges . It is set of elements connected by edges. Each elements are called a vertex and node. 

What is Tree?

Tree is a widely used data structure in which elements are attached to one or more elements in a hierarchical order beneath it. The connection between the elements are called Branches.   

What is Binary Tree?

A Binary Tree is a special type of inverted tree in which each element has two branches below it. We can say that each node has at most two child nodes except the root node.

What is B-Tree?

A B-Tree is a tree data structure. It is a generalization of binary search tree in which a node can have more than two children. A B-Tree is designed to minimize the number of disk accesses. 

Define Linear Data Structure and it's examples?




What is Linear Data Structure. Define it?

The mathematical and logical model of a particular organisation of data is known as Data Structures. 

Linear Data Structure:-

The Data structure is said to be Linear Data Structures if it's elements are in a sequence and form a linear series.
For Example:- Array, Queue, linked list and Stacks.

What is Array?

Array is the collection of same data type elements under the same variable identifier referenced by index number. It is widely used in programming for the purpose of searching and sorting etc. 

What is Queue?

A queue is a linear data structure in which elements are removed in the same order they were entered. So the queue is the FIFO data structures. FIFO means first in first out i.e the first element added to the queue will be the first one to be removed. 

What is Stack?

Stack is the ordered collection of elements. It is a dynamic object whose size is continuously changing as elements are pushed or popped. In Stack elements are removed in the reverse order from which they were entered. This is referred as LIFO[Last In First Out]. It may contain different data type.

What is Linked List?

Linked list is the linear data structure which are used to organize data in a specific desired logical orders independent of the memory address each record assigned to it. 
It is a linear collection of data elements and the linear order is given by pointers. Each element [node] has two parts:- First part contain the information of the element and Second part contains the address of the next element [node] in the list.

Define Abstract Data Type?




What is Abstract Data Type. Define it?

Firstly I want to explain what is data type. Data type is a collection of values and set of operation on these values. When we store computer program's data in variables then each variables must be assigned a specific data type. Some data type are Strings, Array and float etc.
Abstract data type is a mathematical model for a certain class of data structures. It refers to the mathematical concept that define the data type. It can be regarded as a approach of a number of algebraic structures such as rings.  

Parts Of Abstract Data Type:-

There are two parts of Abstract Data Type as given below:-
  • Value Definition
  • Operation Definition

Define Data Structure and it's types?



What is Data Structure. Define it?

The term Data means Values and Structure means the way it is organized and arranged into mathematical and logical way. So the mathematical and logical model of a particular organisation of data is known as Data Structures. 
It is specialized format for organizing and storing data. It is also a particular way to store and organize data in a computer so that we can efficiently use it. We use data structures almost every program and software system. It provides us data efficiency such as large databases. 
A data structure may be designed to store data for working on it with various algorithms. 
Some common data structures are:-

  • Array
  • Linked List
  • Stack
  • Queue
  • Heap
  • Hash-Table
  • Tree:- Binary Tree
  • Red-Black Tree
  • B Tree

Types Of Data Structure:-

There are two types of Data Structures as given below:-
  • Linear Data Structures
  • Non Linear Data Structures

Linear Data Structure:-

The Data structure is said to be Linear Data Structures if it's elements are in a sequence and form a linear series.
For Example:- Array, Queue, linked list and Stacks.

Non-Linear Data Structure:-

The Data structure is said to be Non-Linear Data Structures if it's elements do not form a sequence or a linear series but form a hierarchical format.
For Example:- Graph, Tree, Binary Search Tree etc.