`); let searchUrl = `/search/`; history.forEach((elem) => { prevsearch.find('#prevsearch-options').append(`
${elem} `); }); } $('#search-pretype-options').empty(); $('#search-pretype-options').append(prevsearch); let prevbooks = $(false); [ {title:"Recently Opened Textbooks", books:previous_books}, {title:"Recommended Textbooks", books:recommended_books} ].forEach((book_segment) => { if (Array.isArray(book_segment.books) && book_segment.books.length>0 && nsegments<2) { nsegments+=1; prevbooks = $(`
${book_segment.title} `); let searchUrl = "/books/xxx/"; book_segment.books.forEach((elem) => { prevbooks.find('#prevbooks-options'+nsegments.toString()).append(`
${elem.title} ${ordinal(elem.edition)} ${elem.author} `); }); } $('#search-pretype-options').append(prevbooks); }); } function anon_pretype() { let prebooks = null; try { prebooks = JSON.parse(localStorage.getItem('PRETYPE_BOOKS_ANON')); }catch(e) {} if ('previous_books' in prebooks && 'recommended_books' in prebooks) { previous_books = prebooks.previous_books; recommended_books = prebooks.recommended_books; if (typeof PREVBOOKS !== 'undefined' && Array.isArray(PREVBOOKS)) { new_prevbooks = PREVBOOKS; previous_books.forEach(elem => { for (let i = 0; i < new_prevbooks.length; i++) { if (elem.id == new_prevbooks[i].id) { return; } } new_prevbooks.push(elem); }); new_prevbooks = new_prevbooks.slice(0,3); previous_books = new_prevbooks; } if (typeof RECBOOKS !== 'undefined' && Array.isArray(RECBOOKS)) { new_recbooks = RECBOOKS; for (let j = 0; j < new_recbooks.length; j++) { new_recbooks[j].viewed_at = new Date(); } let insert = true; for (let i=0; i < recommended_books.length; i++){ for (let j = 0; j < new_recbooks.length; j++) { if (recommended_books[i].id == new_recbooks[j].id) { insert = false; } } if (insert){ new_recbooks.push(recommended_books[i]); } } new_recbooks.sort((a,b)=>{ adate = new Date(2000, 0, 1); bdate = new Date(2000, 0, 1); if ('viewed_at' in a) {adate = new Date(a.viewed_at);} if ('viewed_at' in b) {bdate = new Date(b.viewed_at);} // 100000000: instead of just erasing the suggestions from previous week, // we just move them to the back of the queue acurweek = ((new Date()).getDate()-adate.getDate()>7)?0:100000000; bcurweek = ((new Date()).getDate()-bdate.getDate()>7)?0:100000000; aviews = 0; bviews = 0; if ('views' in a) {aviews = acurweek+a.views;} if ('views' in b) {bviews = bcurweek+b.views;} return bviews - aviews; }); new_recbooks = new_recbooks.slice(0,3); recommended_books = new_recbooks; } localStorage.setItem('PRETYPE_BOOKS_ANON', JSON.stringify({ previous_books: previous_books, recommended_books: recommended_books })); build_popup(); } } var whiletyping_search_object = null; var whiletyping_search = { books: [], curriculum: [], topics: [] } var single_whiletyping_ajax_promise = null; var whiletyping_database_initial_burst = 0; //number of consecutive calls, after 3 we start the 1 per 5 min calls function get_whiletyping_database() { //gets the database from the server. // 1. by validating against a local database value we confirm that the framework is working and // reduce the ammount of continuous calls produced by errors to 1 per 5 minutes. return localforage.getItem('whiletyping_last_attempt').then(function(value) { if ( value==null || (new Date()) - (new Date(value)) > 1000*60*5 || (whiletyping_database_initial_burst < 3) ) { localforage.setItem('whiletyping_last_attempt', (new Date()).getTime()); // 2. Make an ajax call to the server and get the search database. let databaseUrl = `/search/whiletype_database/`; let resp = single_whiletyping_ajax_promise; if (resp === null) { whiletyping_database_initial_burst = whiletyping_database_initial_burst + 1; single_whiletyping_ajax_promise = resp = new Promise((resolve, reject) => { $.ajax({ url: databaseUrl, type: 'POST', data:{csrfmiddlewaretoken: "iXtqWNmxvghaV5C5V97b33xlHKWmwwpWBoUdWzUrKx1SskmT0xPSQxeE8U3vElHl"}, success: function (data) { // 3. verify that the elements of the database exist and are arrays if ( ('books' in data) && ('curriculum' in data) && ('topics' in data) && Array.isArray(data.books) && Array.isArray(data.curriculum) && Array.isArray(data.topics)) { localforage.setItem('whiletyping_last_success', (new Date()).getTime()); localforage.setItem('whiletyping_database', data); resolve(data); } }, error: function (error) { console.log(error); resolve(null); }, complete: function (data) { single_whiletyping_ajax_promise = null; } }) }); } return resp; } return Promise.resolve(null); }).catch(function(err) { console.log(err); return Promise.resolve(null); }); } function get_whiletyping_search_object() { // gets the fuse objects that will be in charge of the search if (whiletyping_search_object){ return Promise.resolve(whiletyping_search_object); } database_promise = localforage.getItem('whiletyping_database').then(function(database) { return localforage.getItem('whiletyping_last_success').then(function(last_success) { if (database==null || (new Date()) - (new Date(last_success)) > 1000*60*60*24*30 || (new Date('2023-04-25T00:00:00')) - (new Date(last_success)) > 0) { // New database update return get_whiletyping_database().then(function(new_database) { if (new_database) { database = new_database; } return database; }); } else { return Promise.resolve(database); } }); }); return database_promise.then(function(database) { if (database) { const options = { isCaseSensitive: false, includeScore: true, shouldSort: true, // includeMatches: false, // findAllMatches: false, // minMatchCharLength: 1, // location: 0, threshold: 0.2, // distance: 100, // useExtendedSearch: false, ignoreLocation: true, // ignoreFieldNorm: false, // fieldNormWeight: 1, keys: [ "title" ] }; let curriculum_index={}; let topics_index={}; database.curriculum.forEach(c => curriculum_index[c.id]=c); database.topics.forEach(t => topics_index[t.id]=t); for (j=0; j
(b.item.view_count || 0) - (a.item.view_count || 0)); whiletyping_search = {books: [], curriculum: [], topics: []}; const MAX_BOOKS=3; const MAX_COURSES=4; const MAX_TOPICS=6; let curriculum_titles = new Set(); let topics_titles = new Set(); add_without_repetition = (params)=>{ // insert items from elems into array checking that array is max size // and no title duplicates for (var i = 0; i=params.max) {break;} if (!params.titles.has(params.elems[i].item.title)){ params.titles.add(params.elems[i].item.title); params.array.push(params.elems[i].item); } } } add_without_repetition({ max: MAX_COURSES, titles: curriculum_titles, elems: curriculum, array: whiletyping_search.curriculum }); add_without_repetition({ max: MAX_TOPICS, titles: topics_titles, elems: topics, array: whiletyping_search.topics }); for (var i = 0; i=MAX_BOOKS) {break;} book = books[i].item; whiletyping_search.books.push(book); add_without_repetition({ max: MAX_COURSES, titles: curriculum_titles, elems: book.curriculum, array: whiletyping_search.curriculum }); add_without_repetition({ max: MAX_TOPICS, titles: topics_titles, elems: book.topics, array: whiletyping_search.topics }); } return true; } else { return false; } }); } function build_solutions() { if (Array.isArray(solution_search_result)) { const viewAllHTML = userSubscribed ? `View All` : ''; var solutions_section = $(` Solutions ${viewAllHTML} `); let questionUrl = "/questions/xxx/"; let askUrl = "/ask/question/xxx/"; solution_search_result.forEach((elem) => { let url = ('course' in elem)?askUrl:questionUrl; let solution_type = ('course' in elem)?'ask':'question'; let subtitle = ('course' in elem)?(elem.course??""):(elem.book ?? "")+" "+(elem.chapter?"Chapter "+elem.chapter:""); solutions_section.find('#whiletyping-solutions').append(` ${elem.text} ${subtitle} `); }); $('#search-solution-options').empty(); if (Array.isArray(solution_search_result) && solution_search_result.length>0){ $('#search-solution-options').append(solutions_section); } MathJax.Hub.Queue(["Typeset", MathJax.Hub, document.getElementById('search-solution-options')]); } } function build_whiletyping() { $('#search-pretype-options').empty(); $('#search-pretype-options').append($('#search-solution-options').html()); if (Array.isArray(whiletyping_search.books) && whiletyping_search.books.length>0) { var books_section = $(` Textbooks View All `); let searchUrl = "/books/xxx/"; whiletyping_search.books.forEach((elem) => { books_section.find('#whiletyping-books').append(` ${elem.title} ${ordinal(elem.edition)} ${elem.author} `); }); } $('#search-pretype-options').append(books_section); } function build_popup(first_time = false) { if ($('#search-text').val()=='') { build_pretype(); if (first_time) { do_whiletyping_search(); } } else { solution_search(); do_whiletyping_search().then((success) => { if (success) { build_whiletyping(); } else { build_pretype(); } }).catch((err) => { console.log(err); build_pretype(); }); } } var search_text_out = true; var search_popup_out = true; const is_login = false; function pretype_setup() { $('#search-text').focusin(function() { $('#search-popup').addClass('show'); resize_popup(); search_text_out = false; }); $( window ).resize(function() { resize_popup(); }); $('#search-text').focusout(() => { search_text_out = true; if (search_text_out && search_popup_out) { $('#search-popup').removeClass('show'); } }); $('#search-popup').mouseenter(() => { search_popup_out = false; }); $('#search-popup').mouseleave(() => { search_popup_out = true; if (search_text_out && search_popup_out) { $('#search-popup').removeClass('show'); } }); $('#search-text').on("keyup", delay(() => { build_popup(); }, 200)); build_popup(true); let prevbookUrl = `/search/pretype_books/`; if (is_login) { $.ajax({ url: prevbookUrl, method: 'POST', data:{csrfmiddlewaretoken: "iXtqWNmxvghaV5C5V97b33xlHKWmwwpWBoUdWzUrKx1SskmT0xPSQxeE8U3vElHl"}, success: function(response){ previous_books = response.previous_books; recommended_books = response.recommended_books; build_popup(); }, error: function(response){ console.log(response); } }); } else { let prebooks = null; try { prebooks = JSON.parse(localStorage.getItem('PRETYPE_BOOKS_ANON')); }catch(e) {} if (prebooks && 'previous_books' in prebooks && 'recommended_books' in prebooks) { anon_pretype(); } else { $.ajax({ url: prevbookUrl, method: 'POST', data:{csrfmiddlewaretoken: "iXtqWNmxvghaV5C5V97b33xlHKWmwwpWBoUdWzUrKx1SskmT0xPSQxeE8U3vElHl"}, success: function(response){ previous_books = response.previous_books; recommended_books = response.recommended_books; build_popup(); }, error: function(response){ console.log(response); } }); } } } $( document ).ready(pretype_setup); $( document ).ready(function(){ $('#search-popup').on('click', '.search-view-item', function(e) { e.preventDefault(); let autoCompleteSearchViewUrl = `/search/autocomplete_search_view/`; let objectUrl = $(this).attr('href'); let selectedId = $(this).data('objid'); let searchResults = []; $("#whiletyping-solutions").find("a").each(function() { let is_selected = selectedId === $(this).data('objid'); searchResults.push({ objectId: $(this).data('objid'), contentType: $(this).data('contenttype'), category: $(this).data('category'), selected: is_selected }); }); $("#whiletyping-books").find("a").each(function() { let is_selected = selectedId === $(this).data('objid'); searchResults.push({ objectId: $(this).data('objid'), contentType: $(this).data('contenttype'), category: $(this).data('category'), selected: is_selected }); }); $.ajax({ url: autoCompleteSearchViewUrl, method: 'POST', data:{ csrfmiddlewaretoken: "iXtqWNmxvghaV5C5V97b33xlHKWmwwpWBoUdWzUrKx1SskmT0xPSQxeE8U3vElHl", query: $('#search-text').val(), searchObjects: JSON.stringify(searchResults) }, dataType: 'json', complete: function(data){ window.location.href = objectUrl; } }); }); });
FAQs
For the (111) plane there are N111 = 3 × (1/6) + 3 × (1/2) = 2 atoms within the unit cell. The (110) plane has the highest atomic density and hence is best for p-channel MOSFET performance. The direction that has the most number of covalent bonds is the best for hole conduction.
What is the angle between 110 and 111 directions in the cubic system? ›
Answer: The angle between the two planes represented by the Miller indices (110) and (111) in a simple cubic is 300°.
What is the planar density of the 111 plane in BCC? ›
Calculate the planar density for the (111) plane
The area of this unit cell section can be calculated as follows: Area = a 3 2 × a 3 2 . Therefore, the planar density for the (111) plane is 1/( a 3 2 × a 3 2 ).
How many atoms are centered on the FCC 111 plane? ›
Planar density of {110} planes in the FCC crystal Page 6 Class: second Subject: Biomaterial2 /Lce.2 Lecture: Amir N.Saud Email: amir-najah@mustaqbal-college.edu.iq In the {111} planes of the FCC lattice there are 2 atoms (1/6 x 3 corner atoms + 1/2 x 3 side atoms). Planar density of {111} planes in the FCC crystal.
What is the 111 plane in a cubic system? ›
The (111) plane looks like a triangle with all the edges intersects to x, y, and z-axis. The (000) plane has no plane that intersects on the FCC cube.
How many planes are in the 111 family? ›
Indicate the four {111} planes. You may use several sketches. These are the 12 members of the <110> family of directions for a cubic crystal. These are the four members of the {111} family of planes for a cubic crystal.
What is the angle of the 111 plane? ›
What are all of the possible angles between planes in the {111} family of planes? From the dot product of the possible vectors in the {111} family, i.e. (a,b,c)⋅(a,b,c) where a, b, and c could be any combination of 1 and –1: the possible angles are therefore 0, 70.53º, 109.47º, and 180º.
What is the angle between 111 and 112? ›
The angle between [111] and [112] directions in cubic unit cell is 90°
What is the angle between 100 and 111? ›
(a) The angle between the (100) and (111) planes is 54.7°, which is necessary for double bounce reflection.
How to find the area of a 111 plane? ›
For (111): From the sketch, we can determine that the area of the (111) plane is (√2a./2) (√3a./√2) atoms in this area. packing fraction 2п/√2a./4)2 0.866a.
BCC CRYSTAL
For this (110) plane there is one atom at each of the four cube corners through which it passes, each of which is shared with four adjacent unit cells, while the center atom lies entirely within the unit cell. Thus, there is the equivalence of 2 atoms associated with this BCC (110) plane.
What is the area of the 111 plane in BCC? ›
The areal fraction (area occupied by atoms: area of the plane) of the (111) plane in BCC crystal is 3/16 = 0.34 (→ taking into account the atoms whose centre of mass lie on the (111) plane). However the (111) plane partially intersects the atom in the body centre position (as shown in the figure below).
What is the 100 plane? ›
The (100), (010), (001), (100), (010) and (001) planes form the faces of the unit cell. Here, they are shown as the faces of a triclinic (a ≠ b ≠ c, α ≠ β ≠ γ) unit cell .
What is the number of atoms per unit area of the 110 plane of a body-centered cubic crystal with lattice parameter A? ›
One fourth of each corner atom is enclosed within the unit cell, and middle atom is entirely within the unit cell, so the number of atoms on the (100) plane within the unit cell is N100= 4 × (1/4) + 1 × 1 = 2. For the (110) plane, there are N110 = 4 × (1/4) + 2 × (1/2) + 2 × 1 = 4 atoms within the unit cell.
How many 111 }- typed planes are there in the FCC structure? ›
FCC structure has four unique close-packed planes which, in Miller indices, are of the family {111}. The unit cell of the crystal structure, with plane (111), is seen in Figure 6. The axes of the unit cell, labelled a 1 , a 2 and a 3 , define the crystal orientation with respect to the global coordinate system. ...
How many atoms are in simple cubic? ›
The simple cubic unit cell is delineated by eight atoms, which mark the actual cube. These are corner atoms, so each one only contributes one eighth of an atom to the unit cell, thus giving us only one net atom.
How many atoms are in the BCC 110 plane? ›
Answer and Explanation:
BCC unit cell with (110) plane is shown below. This plane has 1 atom at the centre of the cube and 4 other atoms at the corner.
What is the 111 plane of silicon crystal structure? ›
The (111) plane is a crystal plane that is perpendicular to the <111> direction, which is a line at a 54.7-degree angle to the x-, y-, and z-axes of the crystal lattice.
