data science questions

Robotics

  1. Which of the following is not data type of python
a. Dictionary        b. Boolean
c. Tuple                d. Integer

2. what is full form of AGV
Automated Grouped Vehicles      b.Alternative Guided Vehicles
c.Automatic Guided Vehicles          d.All Time Guided Vehicles


3. Which part of the Robot provides motion to the manipulator and end-effectors ?
A. Controller                       B. Sensor
C. Actuator                           D. None of the above


manipulator:it is a  manipulator is a device used to manipulate materials without direct contact.
end-effector: it means last link(or end) of robot generally in serial manipulating robots 
Actuator: an actuator is an electromechanical device which converts energy into mechanical work. There are several types of actuators used in robots.
eg. hydraulic actuator,Pneumatic actuator
         

Statistics

1. The mean of a sample is
a. always equal to the mean of the population
b. always smaller than the mean of the population
c. computed by summing the data values and dividing the sum by (n - 1)
d. computed by summing all the data values and dividing the sum by the number of items
Mean= Total of sample values/ sample size

2. Since the population size is always larger than the sample size, then the sample statistic
a. can never be larger than the population parameter
b. can never be equal to the population parameter
c. can never be zero
d. can never be smaller than the population parameter
e. None of the above answers is correct.
ANSWER: e
Sample statistic will depend upon the sample chosen. It can be less than, greater than, equal to population parameter. It can assume the value of zero.


By taking a level of significance of 5% it is the same as saying

If an analyst states that the results are significant at the 5% level then what they are saying is that there is a 5% probability that the sample data values collected have occurred by chance. An alternative view is to use the concept of a confidence interval. In this case we can observe that we are 95% confident that the results have not occurred by chance.

Databases

1. Which of following keys present in DBMS?
A. candidate key    B. primary key     C.Both

2.which of following query is used to clear the content of table
A. CLEAR FROM table_name
B. TRUNCATE FROM table_name
C. DESTROY FROM table_name

3.Consider the schema R(S,T,U,V) and the dependencies S→T, T→U, U→V, V→S. Let R= {R1,R2} such that R1∩R2=Φ. Then the decomposition is :
A not in 2NF
B in 2NF but not in 3NF
C in 3NF but not in 2NF
D in both 2NF and 3NF

A database is in second normal form if it satisfies the following conditions:
  • It is in first normal form
  • All non-key attributes are fully functional dependent on the primary key

Algorithms

1. what is worst case time complexity of binary search tree
A. O(1)
B.O(logn)
C.O(nlogn)

2. The Runnig time quick sort depends heavily on the selection of
A. Size of element
B. no. of element
C. Pivot element
  • Best of 3. Left, middle and right. This gives substantially better performance than simply choosing an end in the worst case.
  • Random. Choosing a random pivot is fairly easy to implement and guarantees n log n performance so it is a very good choice.

3.Which Sorting algorithm is Fast
A.O(n^2)
B.O(nlogn)
O(k+n)

4. if algorithm A has running time 7n^2+2n+3 and algorithm B has running time 2n^2 then
A. Both have same asymptotic time complexity
B. A  has greater asymptotic time complexity
C. B has greater asymptotic time complexity

The limiting behavior of the execution time of an algorithm when the size of the problem goes to infinity

About heap section

  • data present in heap section is in unordered  
  • Fast insertion:: as the data inserted after last page so it do not performing any action it is directly added into heap
  • slow searching :: slow because it perform linear search on data
  • slow delete operation::whichever first element searched is deleted first also deleting records creates hole in page 

Pile file method

  • in this data is inserted in the form of one after another
  • that means not in sorted manner

sorted file method

  • in this data is inserted in sorted manner either in ascending or descending manner
  • sorting records based on any primary key or another key






Comments

Post a Comment

Popular posts from this blog

Basic Electronics

Image
This is a band pass filter In band stop filter C2 is connected in between R1 and C1 (Requires inverting input) Low pass filter High Pass filter (LPF and HPF requires differential input) differentiation and integrator ADDER Subtractor (for integrator, differentiator,adder,subtractor requires inverting input) Diode logic Resistor transistor logic: dissipates more power 1}DCTL(direct coupled transistor logic):it is used for to save space 2}Resistor capacitor transistor logic:input resistor are parallel with capacitors Emitter coupled Logic: it uses NPN transistor in differential amplifier range of input voltages are used so BJT will not goes into saturation region it is due to very high switching speed  also called common mode logic or current switch emmiter follower  CMOS: it utilize power during transition in logic so it uses very less power Power Scale::P=@cv^2.....@ is activity factor CMOS have speed limitation due to in...
Read more

DATA STRUCTURES IN C.

Image
Data structures through C lang. Data structure is a way to store and organize the data in computer so that it can used efficientaly data structure have two type 1) abstract data type(ADT)(mathematical and logical data type)   2) implementation  data type  list abstract data type is not memory efficient in terms of inserting and removing the data from an array  here time require is (T dirc.n) where n is the number element in an array that is if we are using just array for storing the data then at the time of inserting the new data into an array then array will shift a whole bytes from array in Linked list node are available node=int value + add. of next node  Θ ---------------------------------------------------------------------------- # Algorithms & Data Structures: Q. What is data structure? - it is a way to store data into the memory(main memory) in an oraganized manner so that we can perform operations on it efficiently. ...
Read more

RTOS(Real Time Operating System) notes

RTOS NOTES Hard realtime OS has less jitter and Soft real time jitter has High jitter  jitter : it is the time between two interrupt Event driven systems switch between tasks based on their priorities while time sharing systems switch the task based on clock interrupts. Most RTOS’s use a pre-emptive scheduling algorithm. The most common designs are Event-driven –  switches tasks  only when an event of higher priority needs servicing; called  preemptive priority , or priority scheduling. Time-sharing – switches tasks on a regular clocked interrupt, and on events; called  round robin . A task has three stages 1. Runing 2.Ready 3.Blocked(Waiting for an event,I/O for example) On simpler non-preemptive but still multitasking systems, a task has to give up its time on the CPU to other tasks, which can cause the ready queue to have a greater number of overall tasks in the ready to be executed state ( resource starvation ). laxity = Absolute deadline...
Read more