Front end interview question bank
· Logging · 0 comment · 2,950 Views

Front end interview question bank

· Logging · 0 comment · 2,950 Views

Interview question bank

 Trident kernel: ie, Maxthon, TT, the world, 360, Sogou browser, etc. [also known as mshtml] 
 gecko kernel: Netscape 6 and above, FF, Mozilla Suite / Seamonkey, etc. 
 Presto kernel: Opera 7 and above. [opera kernel: Presto, now: blink] 
 WebKit kernel: Safari, chrome, etc. [Chrome's: blink (a branch of WebKit)]
 1. Map + area or SVG 
 2, border radius 
 3, pure JS implementation needs a simple algorithm to find a point on the circle, obtain mouse coordinates and so on
 -According to the principle of priority proximity, the closest style definition shall prevail in the case of the same weight; 
 - the loading style shall be subject to the last loaded location; 
 the priority is: 
 the same weight: inline style sheet (inside label) > embedded style sheet (in current file) > external style sheet (in external file). ! Important > ID > class > tag
important has higher priority than inline
 Each object will initialize a property in its internal, that is, prototype. When we access the properties of an object, if no object does not have this property, then it will go to the prototype to find the property, and the prototype will have its own prototype, so we will keep searching, which is the concept of prototype chain. relationship: instance. Constructor. Prototype = instance. Proto

Do a few questions

 //1. Simple implementation of throttle 1. Simple implementation of throttle 1. Simple implementation of function throttle (func, duration) {/ / / / write the specific implementation here 
} 
 window.addeventlistener ('scroll ', throttle (func, 50, 50, false);; 
 / / 2. Implement a depth first search algorithm (non recursive) 
 functiondfs (tree, name, name) {/ / / / / / / / / / please implement 
} 
 
 
 
 / / please implement 
} 
 
 
, write the specific implementation here 
} 
 windows.addeventlistener ('scroll', throttle (function, 50, 50, 50, false);;;;;;;;; (2. Implement a depth first search algorithm (non recursive) 
 children: [{Name: 'Beijing',, Children: [{
 Name:'chaoyang people '
}, 
 {Name:' Haidian District '
} 
; 
 {Name:' Zhejiang Province ', 
 children: [{Name:' Hangzhou city '
}, 
 {Name:' Name: 'Hangzhou city' 
, 
 {name: 'Name:' Hangzhou city '
, 
 {Name:' Name: 'Jiaxing City' 
}} 
 
 {
 Name: 'Name:' Haidian District '
} 
 
 
 
 
 
 10; 
 
 
 
 
 
 
 
console.log (result);;
Comments are closed.