DOCSLIB.ORG

Follow Us Guidance and Counseling Mansfield Independent School District

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Follow Us Guidance and Counseling Mansfield Independent School District Mansfield ISD High School COURSE GUIDE 2018-2019 Follow Us Guidance and Counseling Mansfield Independent School District Mission To inspire and educate students to be producve cizens. A desnaon district commied to excellence. Vision Students First Connuous Improvement Integrity Values Communicaon Posive Relaonships Resiliency Moo MISD: A great place to live, learn, and teach. Guiding Statements 1. Students will read on level or higher by the beginning of third grade and will remain on level or higher as an MISD student. 2. Students will demonstrate mastery of Algebra I by the end of ninth grade. 3. Students will graduate with 24+ college hours and/or industry cerficaon or a cerficate. 4. Students will parcipate in an extra or co‐curricular acvity. 5. Our parents and students will have choices with educaonal opportunies. TABLE OF CONTENTS MISD High School Information ..........................................................................................................4 Scheduling & Other Information ..............................................................................................4 Academic & General Information..............................................................................................5 Graduation Programs ..............................................................................................................9 Class of 2018-Future You………………………………………………………………………………..9 College Preparation Timeline .................................................................................................. 10 Pre-AP & AP Information & Course Offerings .................................................................................. 11 Dual Credit Programs in MISD......................................................................................................... 22 MISD Virtual School Information .................................................................................................... 39 MISD High School Course Descriptions ........................................................................................... 40 English/Language Arts ......................................................................................................... 41 Fine Arts .............................................................................................................................. 45 Health/Physical Educaton/Athletics ...................................................................................... 51 Journalism ........................................................................................................................... 53 Languages Other Than English .............................................................................................. 55 Mathematics ......................................................................................................................... 60 Science ................................................................................................................................ 65 Social Studies ....................................................................................................................... 70 Special Programs .................................................................................................................. 73 CATE on Home Campus ........................................................................................................ 76 Frontier High School @ BBIA Information ....................................................................................... 79 Ben Barber Innovation Academy (BBIA) & FHS Course Descriptions ............................................... 80 Agriculture, Food, and Natural Resources .............................................................................. 80 Architecture & Construction .................................................................................................. 83 Arts, A/V Technology, and Communications ........................................................................... 86 Business Management & Administration ................................................................................ 91 Finance ................................................................................................................................ 94 Marketing……………………………………………………………………………………………………………..97 Hospitality and Tourism, Culinary Arts ................................................................................ 100 Information Technology ....................................................................................................... 102 Manufacturing………………………………………………………………………………………………….….105 Transportation, Distribution, Logistics, &Welding…………………………………………………….…..108 Education and Training……………………..……………………………………..…………………….……..110 Human Services……………………………………………………………………………………..……….......112 Law, Public Safety, Corrections, & Security…………………………………………………………………114 Health Science………………………………………………………..………………………………….………..118 Science, Technology, Engineering, & Mathematics ................................................................ 126 Student Applications & Worksheets .............................................................................................. 129 Early (3-year) Graduation Application .................................................................................. 129 Mid-Term Graduation Applicaton ......................................................................................... 130 3 SCHEDULING & OTHER INFORMATION HIGHLIGHTS WITHIN THE 2018-2019 COURSE GUIDE Please read this guide carefully. Contact your counselor for additional information regarding scheduling, course prerequisites, dual credit, testing, and/or graduation requirements. Credit is awarded at the end of each semester with a grade of 70 or better. There are many factors to consider in selecting courses that will meet individual needs for next year. Remember to select courses to fit overall planning which projects beyond the high school years. Interest and ability should determine choices. Experience shows that those who plan an entire high school program early and frequently review the plan will be able to graduate without difficulty. It is important to know that this course description guide includes all courses that are offered in the Mansfield ISD. However, due to enrollment and teacher availability, not every class will be offered every year at all campuses. REGISTRATION Although students will receive specific instructions during that time from high school personnel, the responsibility for appropriate graduation and career choices rests with students and parents. The counseling staff is available to assist in making decisions related to course selections. One of the most critical functions performed by a school is the registration of students. Based upon registration information, courses are scheduled and teachers are employed for the next year; therefore, it is important that course selections be given serious consideration. After mid-May of each year, changes will be made only to correct scheduling errors or to equalize class enrollments. SCHEDULING UNDER THE BLOCK MISD high schools are organized on an A/B Block Schedule with students taking four classes per day on alternating days. Each block is 90 minutes in length. Ninth, tenth, and eleventh grade students are required to take eight classes each semester in the block schedule. Twelfth grade students who have passed the required End Of Course (EOC) will be required to take six classes each semester in the block schedule. Seniors who have not passed their required EOCs must take eight classes. However, all seniors are strongly advised to take advantage of the educational opportunities found in the MISD and take eight classes each semester. Seniors not taking all eight classes each semester must register for a senior release class and leave campus during their free block. The senior release/free block must be either the first or last block of the day. GUIDELINES FOR SCHEDULING IN THE BLOCK FORMAT 1. Remember, classes required for graduation are non-negotiable. Therefore, if you participate in a program that is double-blocked, it is critical that credits are closely monitored. 2. Courses taken at Ben Barber Innovation Academy (BBIA) are available yielding 1 credit for 18 weeks and 2-3 credits for 36 week courses. 3. The block schedule is designed so that students through the lengthened class periods can explore content more thoroughly and develop patterns of management and organization that will benefit them throughout life. 4. Carefully plan your schedule. The four year plan is very important in order to obtain all of the courses you wish to take. 5. Spend time with your high school counselor; it is time well spent. 4 ACADEMIC & GENERAL INFORMATION MISD GRADING SYSTEM FOR GRADES 9-12 The district high schools use a weighted numerical grading system. In calculating GPA, ten points are added to a student’s average in AP, Pre-AP, Academic Decathlon, and approved dual credit courses. The following chart reflects the MISD grading system for grades 9-12: A 90-100 B 80-89 C 70-79 F Below 70 Special note: Beginning in the 2014-2015 school year and thereafter, if a student fails either semester of any MISD yearlong course and passes the opposite semester with a high enough grade for an overall average of 70 for the full course, a full credit will be granted. In this situation, for averaging to occur, the courses must have been taken during the same school year and in consecutive
Load more

Recommended publications
  • Fencing Cyberspace: Drawing Borders in a Virtual World Maureen A
    University of Minnesota Law School Scholarship Repository Minnesota Law Review 1998 Fencing Cyberspace: Drawing Borders in a Virtual World Maureen A. O'Rourke Follow this and additional works at: https://scholarship.law.umn.edu/mlr Part of the Law Commons Recommended Citation O'Rourke, Maureen A., "Fencing Cyberspace: Drawing Borders in a Virtual World" (1998). Minnesota Law Review. 1923. https://scholarship.law.umn.edu/mlr/1923 This Article is brought to you for free and open access by the University of Minnesota Law School. It has been accepted for inclusion in Minnesota Law Review collection by an authorized administrator of the Scholarship Repository. For more information, please contact [email protected]. Fencing Cyberspace: Drawing Borders in a Virtual World Maureen A. O'Rourke* Introduction ............................................................................... 610 I. An Introduction to the Internet and the World W ide W eb .................................................................. 615 A. Origins of the Internet ................................................... 615 B. Development of the World Wide Web ........................... 619 C. Emergence of the Internet as a Commercial Marketplace ............................................... 624 1. Development of the Marketplace .............................. 624 2. Web Business Models ................................................ 625 a. Advertising-Based Models ................................... 626 b. Subscription-Based Models .................................
    [Show full text]
  • Survey of Methodologies, Approaches, and Challenges in Parallel Programming Using High-Performance Computing Systems
    Hindawi Scientific Programming Volume 2020, Article ID 4176794, 19 pages https://doi.org/10.1155/2020/4176794 Review Article Survey of Methodologies, Approaches, and Challenges in Parallel Programming Using High-Performance Computing Systems Paweł Czarnul ,1 Jerzy Proficz,2 and Krzysztof Drypczewski 2 1Dept. of Computer Architecture, Faculty of Electronics, Telecommunications and Informatics, Gdansk University of Technology, Gda´nsk, Poland 2Centre of Informatics–Tricity Academic Supercomputer & Network (CI TASK), Gdansk University of Technology, Gdan´sk, Poland Correspondence should be addressed to Paweł Czarnul; [email protected] Received 11 October 2019; Accepted 30 December 2019; Published 29 January 2020 Guest Editor: Pedro Valero-Lara Copyright © 2020 Paweł Czarnul et al. ,is is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. ,is paper provides a review of contemporary methodologies and APIs for parallel programming, with representative tech- nologies selected in terms of target system type (shared memory, distributed, and hybrid), communication patterns (one-sided and two-sided), and programming abstraction level. We analyze representatives in terms of many aspects including programming model, languages, supported platforms, license, optimization goals, ease of programming, debugging, deployment, portability, level of parallelism, constructs enabling parallelism and synchronization, features introduced in recent versions indicating trends, support for hybridity in parallel execution, and disadvantages. Such detailed analysis has led us to the identification of trends in high-performance computing and of the challenges to be addressed in the near future. It can help to shape future versions of programming standards, select technologies best matching programmers’ needs, and avoid potential difficulties while using high- performance computing systems.
    [Show full text]
  • SAP Solutions on Vmware Vsphere Guidelines Summary and Best Practices
    SAP On VMware Best Practices Version 1.1 December 2015 © 2015 VMware, Inc. All rights reserved. Page 1 of 61 SAP on VMware Best Practices © 2015 VMware, Inc. All rights reserved. This product is protected by U.S. and international copyright and intellectual property laws. This product is covered by one or more patents listed at http://www.vmware.com/download/patents.html. VMware is a registered trademark or trademark of VMware, Inc. in the United States and/or other jurisdictions. All other marks and names mentioned herein may be trademarks of their respective companies. VMware, Inc. 3401 Hillview Ave Palo Alto, CA 94304 www.vmware.com © 2015 VMware, Inc. All rights reserved. Page 2 of 61 SAP on VMware Best Practices Contents 1. Overview .......................................................................................... 5 2. Introduction ...................................................................................... 6 2.1 Support ........................................................................................................................... 6 2.2 SAP ................................................................................................................................ 6 2.3 vCloud Suite ................................................................................................................... 9 2.4 Deploying SAP with vCloud Suite ................................................................................ 11 3. Virtualization Overview ..................................................................
    [Show full text]
  • Oracle Solaris and Oracle SPARC Systems—Integrated and Optimized for Mission Critical Computing
    An Oracle White Paper September 2010 Oracle Solaris and Oracle SPARC Servers— Integrated and Optimized for Mission Critical Computing Oracle Solaris and Oracle SPARC Systems—Integrated and Optimized for Mission Critical Computing Executive Overview ............................................................................. 1 Introduction—Oracle Datacenter Integration ....................................... 1 Overview ............................................................................................. 3 The Oracle Solaris Ecosystem ........................................................ 3 SPARC Processors ......................................................................... 4 Architected for Reliability ..................................................................... 7 Oracle Solaris Predictive Self Healing ............................................ 7 Highly Reliable Memory Subsystems .............................................. 9 Oracle Solaris ZFS for Reliable Data ............................................ 10 Reliable Networking ...................................................................... 10 Oracle Solaris Cluster ................................................................... 11 Scalable Performance ....................................................................... 14 World Record Performance ........................................................... 16 Sun FlashFire Storage .................................................................. 19 Network Performance ..................................................................
    [Show full text]
  • Cluster Suite Overview
    Red Hat Enterprise Linux 4 Cluster Suite Overview Red Hat Cluster Suite for Red Hat Enterprise Linux Edition 1.0 Last Updated: 2020-03-08 Red Hat Enterprise Linux 4 Cluster Suite Overview Red Hat Cluster Suite for Red Hat Enterprise Linux Edition 1.0 Landmann [email protected] Legal Notice Copyright © 2009 Red Hat, Inc. This document is licensed by Red Hat under the Creative Commons Attribution-ShareAlike 3.0 Unported License. If you distribute this document, or a modified version of it, you must provide attribution to Red Hat, Inc. and provide a link to the original. If the document is modified, all Red Hat trademarks must be removed. Red Hat, as the licensor of this document, waives the right to enforce, and agrees not to assert, Section 4d of CC-BY-SA to the fullest extent permitted by applicable law. Red Hat, Red Hat Enterprise Linux, the Shadowman logo, the Red Hat logo, JBoss, OpenShift, Fedora, the Infinity logo, and RHCE are trademarks of Red Hat, Inc., registered in the United States and other countries. Linux ® is the registered trademark of Linus Torvalds in the United States and other countries. Java ® is a registered trademark of Oracle and/or its affiliates. XFS ® is a trademark of Silicon Graphics International Corp. or its subsidiaries in the United States and/or other countries. MySQL ® is a registered trademark of MySQL AB in the United States, the European Union and other countries. Node.js ® is an official trademark of Joyent. Red Hat is not formally related to or endorsed by the official Joyent Node.js open source or commercial project.
    [Show full text]
  • Arxiv:1312.1411V2 [Cs.LO] 9 Jun 2014 Ocretporm R Adt Einadipeet Seilyw Especially Implement, Buffering and Implement Design Multiprocessors to Tectures
    Don’t sit on the fence A static analysis approach to automatic fence insertion Jade Alglave1, Daniel Kroening2, Vincent Nimal2, and Daniel Poetzl2 1 University College London, UK 2University of Oxford, UK Abstract Modern architectures rely on memory fences to prevent undesired weakenings of memory consistency. As the fences’ semantics may be subtle, the automation of their placement is highly desirable. But precise methods for restoring consistency do not scale to deployed systems code. We choose to trade some precision for genuine scalability: our technique is suitable for large code bases. We implement it in our new musketeer tool, and detail experiments on more than 350 executables of packages found in Debian Linux 7.1, e.g. memcached (about 10000 LoC). 1 Introduction Concurrent programs are hard to design and implement, especially when running on multiprocessor archi- tectures. Multiprocessors implement weak memory models, which feature e.g. instruction reordering, store buffering (both appearing on x86), or store atomicity relaxation (a particularity of Power and ARM). Hence, multiprocessors allow more behaviours than Lamport’s Sequential Consistency (SC) [Lam79], a theoretical model where the execution of a program corresponds to an interleaving of the different threads. This has a dramatic effect on programmers, most of whom learned to program with SC. Fortunately, architectures provide special fence (or barrier) instructions to prevent certain behaviours. Yet both the questions of where and how to insert fences are contentious, as fences are architecture-specific and expensive. Attempts at automatically placing fences include Visual Studio 2013, which offers an option to guarantee acquire/release semantics (we study the performance impact of this policy in Sec.
    [Show full text]
  • High Performance Virtual Machine Recovery in the Cloud
    High Performance Virtual Machine Recovery in the Cloud Valentina Salapura1 and Richard Harper2 1IBM T. J. Watson Research Center, 1101 Kitchawan Rd, NY, Yorktown Heights, U.S.A. 2IBM T. J. Watson Research Center, Research Triangle Park, NC, U.S.A. Keywords: Cloud Computing, High Availability, Virtualization, Automation, Enterprise Class. Abstract: In this paper, we outline and illustrate concepts that are essential to achieve fast, highly scalable virtual machine planning and failover at the Virtual Machine (VM) level in a data center containing a large number of servers, VMs, and disks. To illustrate the concepts a solution is implemented and analyzed for IBM’s Cloud Managed Services enterprise cloud. The solution enables at-failover-time planning, and keeps the recovery time within tight service level agreement (SLA) allowed time budgets via parallelization of recovery activities. The initial serial failover time was reduced for an order of magnitude due to parallel VM restart, and to parallel VM restart combined with parallel storage device remapping. 1 INTRODUCTION originally designed for smaller managed environments, and do not scale well as the system Cloud computing is being rapidly adopted across the size and complexity increases. Detecting failures, IT industry as a platform for increasingly more determining appropriate failover targets, re-mapping demanding workloads, both traditional and a new storage to those failover targets, and restarting the generation of mobile, social and analytics virtual workload have to be carefully designed and applications. In the cloud, customers are being led parallelized in order to meet the service level to expect levels of availability that until recently agreement (SLA) for large systems.
    [Show full text]
  • Comparing and Improving Centralized and Distributed Techniques for Coordinating Massively Parallel Shared-Memory Systems
    Comparing and Improving Centralized and Distributed Techniques for Coordinating Massively Parallel Shared-Memory Systems by Eric Freudenthal A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy Department of Computer Science New York University May 2003 Approved: Research Advisor: Allan Gottlieb c Eric Freudenthal All Rights Reserved 2003 In memory of my father, Dr. Peter Charles Freudenthal, Ph.D., NYU 1970. iii Acknowledgment I was fortunate to work with the many exceptionally talented people who partic- ipated in the NYU Ultracomputer research project lead by Allan Gottlieb and Malvin Kalos. My collaboration with Jan Edler designing coordination algo- rithms for Symunix and its runtime libraries greatly influenced my early work on algorithms described in this dissertation. I benefited much from Allan Gottlieb’s generous commitment to refining my ideas and writing style. In particular, his insistence on precise language and reasoning nurtured the maturation of both my analytical and communication skills. The contributions of three other faculty to my dissertation research are also deserving of recognition: Alan Siegel encouraged me to identify and narrow my research focus to a small set of interesting phenomena. Vijay Karamcheti and Benjamin Goldberg generously read drafts of this dissertation and assisted me in developing a clear overall narrative. Finally, this project would never have been completed without the continuous support and encouragement I received from my family and friends. iv Abstract Two complementary approaches have been proposed to achieve high per- formance inter-process coordination on highly parallel shared-memory systems. Gottlieb et. al. introduced the technique of combining concurrent memory refer- ences, thereby reducing hot spot contention and enabling the “bottleneck-free” execution of algorithms referencing a small number of shared variables.
    [Show full text]
  • Scale-Out Deployments of SAP HANA on Vsphere
    Best Practices and Recommendations for Scale-Out Deployments of SAP HANA on VMware vSphere August 2015 DEPLOYMENT AND TECHNICAL CONSIDERATIONS GUIDE Best Practices and Recommendations for Scale-Out Deployments of SAP HANA on VMware vSphere Table of Content Introduction. 4 Audience . 4 Production Support . 5 SAP HANA System Types . 6 Overview . 6 SAP HANA Scale-Up Option. 8 SAP HANA Scale-Out Option . 9 SAP HANA Appliance Model . 11 SAP HANA Tailored Datacenter Integration . 11 Co-Deployment of Mixed Workloads in VMware vSphere Virtualized SAP HANA Scale-Out TDI Multi-VM Environments .. 12 SAP HANA Tailored Datacenter Integration Support Process . 15 Benefits of Leveraging the TDI Deployment Option for SAP HANA Scale-Out Configurations with VMware vSphere . 16 Virtualized SAP HANA Scale-Out TDI Reference Architecture . 17 General Concepts and Overview . 17 SAP Scale-Out on vSphere Storage Considerations. 19 NAS Over NFS Storage Option . 22 Fibre Channel-based SAN Storage Option . 22 SAP Scale-Out on vSphere Network Considerations . 25 SAP HANA Scale-Out on vSphere High Availability . 29 SAP HANA Data Persistence. 30 VMware HA-protected SAP HANA Systems . 31 SAP HANA Auto-Restart Feature with VMware HA . 33 SAP HANA Systems Protected with Host Auto-Failover to a Standby VM . 34 Host Auto-Failover. 34 SAP HANA Disaster Recovery Solutions with VMware vSphere . 37 Summary SAP HANA HA and Disaster Recovery Solutions with VMware vSphere . 39 VMware vSphere Site Recovery Manager . 40 DEPLOYMENT AND TECHNICAL CONSIDERATIONS GUIDE / 2 Best Practices and Recommendations for Scale-Out Deployments of SAP HANA on VMware vSphere Virtualized SAP HANA Business Warehouse Scale-Out Sizing .
    [Show full text]
  • Fundamental Understanding and Future Guidance for Handheld Computers in the Rail Industry
    Fundamental Understanding and Future Guidance for Handheld Computers in the Rail Industry Yasamin Dadashi, BSc, BSc, MSc Thesis Submitted to the University of Nottingham for the Degree of Doctor of Philosophy November 2009 Abstract Advances in mobile computing technology and software applications have led to an expansion in potential uses for handheld computers for various tasks. One strong application area is in maintenance and inspection. Network Rail has been progressively developing and applying handheld computers to field-based maintenance and inspection operations, with the aims of improving work productivity and quality, and personal and system safety. However, it is clear that these aims so far have been achieved with varying degrees of success. Handheld computer devices have the potential to enhance the procedure of performing the tasks in many different ways. However, the current handheld computers introduced to maintenance and inspection tasks in Network Rail have principally been designed as data entry tools and in most cases the primary objective is to reduce the amount of paper work and the associated costs and errors. This highlights the need for fundamental research into the ways in which handheld computer technologies should be specified, designed and implemented for effective use in a complex distributed environment such as the rail industry. The main purpose of this research was to study the applications of handheld computers in the rail industry and to generate a set of design principles for development of future systems within Network Rail. The findings of this research have contributed to the identification of human factors principles that need to be considered for design and implementation of successful handheld computer applications.
    [Show full text]
  • Don't Sit on the Fence*
    Don’t sit on the fence⋆ A static analysis approach to automatic fence insertion Jade Alglave1, Daniel Kroening2, Vincent Nimal2, and Daniel Poetzl2 1University College London 2University of Oxford Abstract Modern architectures rely on memory fences to prevent undesired weak- enings of memory consistency. As the fences’ semantics may be subtle, the au- tomation of their placement is highly desirable. But precise methods for restoring consistency do not scale to deployed systems code. We choose to trade some pre- cision for genuine scalability: our technique is suitable for large code bases. We implement it in our new musketeer tool, and detail experiments on more than 350 executables of packages found in Debian Linux 7.1, e.g. memcached (about 10000 LoC). 1 Introduction Concurrent programs are hard to design and implement, especially when running on multiprocessor architectures. Multiprocessors implement weak memory models, which feature e.g. instruction reordering, store buffering (both appearing on x86), or store atomicity relaxation (a particularity of Power and ARM). Hence, multiprocessors allow more behaviours than Lamport’s Sequential Consistency (SC) [20], a theoretical model where the executionof a program correspondsto an interleaving of the different threads. This has a dramatic effect on programmers, most of whom learned to program with SC. Fortunately, architectures provide special fence (or barrier) instructions to prevent certain behaviours. Yet both the questions of where and how to insert fences are con- tentious, as fences are architecture-specific and expensive. Attempts at automatically placing fences include Visual Studio 2013, which offers an option to guarantee acquire/release semantics (we study the performance impact of this policy in Sec.
    [Show full text]
  • Arxiv:1611.07372V1 [Cs.LO] 22 Nov 2016 the Strength of Our Approach, We Have Implemented a Prototype and Run It on a Wide Range of Examples and Benchmarks
    MENDING FENCES WITH SELF-INVALIDATION AND SELF-DOWNGRADE PAROSH AZIZ ABDULLA, MOHAMED FAOUZI ATIG, STEFANOS KAXIRAS, CARL LEONARDSSON, ALBERTO ROS, AND YUNYUN ZHU Uppsala University, Sweden e-mail address: [email protected] Uppsala University, Sweden e-mail address: mohamed [email protected] Uppsala University, Sweden e-mail address: [email protected] Uppsala University, Sweden e-mail address: [email protected] Universidad de Murcia, Spain e-mail address: [email protected] Uppsala University, Sweden e-mail address: [email protected] Abstract. Cache coherence protocols based on self-invalidation and self-downgrade have recently seen increased popularity due to their simplicity, potential performance efficiency, and low energy consumption. However, such protocols result in memory instruction reordering, thus causing extra program behaviors that are often not intended by the programmers. We propose a novel formal model that captures the semantics of programs running under such protocols, and employs a set of fences that interact with the coherence layer. Using the model, we design an algorithm to analyze the reachability and check whether a program satisfies a given safety property with the current set of fences. We describe a method for insertion of optimal sets of fences that ensure correctness of the program under such protocols. The method relies on a counter-example guided fence insertion procedure. One feature of our method is that it can handle a variety of fences (with different costs). This diversity makes optimization more difficult since one has to optimize the total cost of the inserted fences, rather than just their number.
    [Show full text]