cissp官方进修指南第八版（英文），改版后2018最新进修指南。
不用看cbk那么费劲，就看这个版本九百多页，八个知识域全覆盖，还省事。
DevelopmentEditor:KellyTalbotTechnicalEditors:JeffParker,BobSipes,andDavidSeidlCopyEditor:KimWimpsettEditorialManager:PeteGaughanProductionManager:KathleenwisorExecutiveeditor:imminatelProofreader:AmyschneiderIndexer:JohnnaVanHoosedinseProjectCoordinator,Cover:brentSavageCoverDesigner:wileyCoverImage:@JeremyWoodhouse/GettyImages,Inc.CopyrightC2018byJohnWileySons,InC,Indianapolis,IndianaPublishedsimultaneouslyinCanadaISBN:978-1-119-47593-4ISBN:978-1-119-47595-8(ebk)ISBN:978-1-119-47587-3(ebk)ManufacturedintheUnitedStatesofamericaNopartofthispublicationmaybereproduced,storedinaretrievalsystemortransmittedianyformorbyanymeans,electronic,mechanical,photocopying,recording,scanningorotherwise,exceptaspermittedunderSections107or108ofthe1976UnitedStatesCopyrightAct,withouteitherthepriorwrittenpermissionofthePublisher,orauthorizationthroughpaymentoftheappropriateper-copyfeetotheCopyrightClearanceCenter,222RosewoodDrive,Danvers,MAO1923,(978)750-8400,fax(978)646-8600RequeststothePublisherforpermissionshouldbeaddressedtothepermissionsDepartment,JohnWileysons,Inc.111RiverStreet,Hoboken,NJo7030,(201)748-6011,fax(201)748-6008,oronlineathttp://www.wiley.com/go/permissionsLimitofliability/DisclaimerofWarranty:Thepublisherandtheauthormakenorepresentationsorwarrantieswithrespecttotheaccuracyorcompletenessofthecontentsofthisworkandspecificallydisclaimallwarranties,includingwithoutlimitationwarrantiesoffitnessforaparticularpurpose.Nowarrantymaybecreatedorextendedbysalesorpromotionalmaterials.Theadviceandstrategiescontainedhereinmaynotbesuitableforeverysituation.Thisworkissoldwiththeunderstandingthatthepublisherisnotengagedinrenderinglegal,accounting,orotherprofessionalservices.Ifprofessionalassistanceisrequiredtheservicesofacompetentprofessionalpersonshouldbesought.Neitherthepublishernortheauthorshallbeliablefordamagesarisingherefrom.ThefactthatanorganizationorWebsiteisreferredtointhisworkasacitationand/orapotentialsourceoffurtherinformationdoesnotmeanthattheauthororthepublisherendorsestheinformationtheorganizationorWebsitemayprovideorrecommendationsitmaymakeFurtherreadersshouldbeawarethatInternetWebsiteslistedinthisworkmayhavechangedordisappearedbetweenwhenthisworkwaswrittenandwhenitisreadForgeneralinformationonourotherproductsandservicesortoobtaintechnicalsupportpleasecontactourCustomerCareDepartmentwithintheU.S.at(877)762-2974,outsidetheUS.at(317)5723993orfax(317)572-4002Wileypublishesinavarietyofprintandelectronicformatsandbyprint-on-demand.Somematerialincludedwithstandardprintversionsofthisbookmaynotbeincludedine-booksorinprint-On-demand.IfthisbookreferstomediasuchasaCDorDVdthatisnotincludedintheversionyoupurchasedyoumaydownloadthismaterialathttp://booksupport.wilev.comFormoreinformationaboutwileyproductsvisitwww.wiley.comLibraryofCongressControlNumber:2018933561TRADEMARKS:Wiley,theWileylogo,andtheSybexlogoaretrademarksorregisteredtrademarksofJohnWileySons,Incand/oritsaffiliates,intheUnitedStatesandothercountries,andmaynotbeusedwithoutwrittenpermission.CISSPisaregisteredtrademarkof(ISC)2,Inc.AllothertrademarksarethepropertyoftheirrespectiveownersJohnWileySons,Incisnotassociatedwithanyproductorvendormentionedinthisbook.ToDewittLatimer,mymentor,friend,andcolleague.Imissyoudearly.MikeChappleToCathy,yourperspectiveontheworldandlifeoftensurprisesme,challengesme,andmakesmeloveyouevenmoreJamesmichaelstewartToNimfa,thanksforsharingyourlifewithmeforthepast26yearsandlettingmeshareminewithyouDarrilgibsonDearFuture(ISC)2MemberCongratulationsonstartingyourjourneytoCISSPRcertificationEarningyourCISSPisanexcitingandrewardingmilestoneinyourcybersecuritycareer.Notonlydoesitdemonstrateyourabilitytodevelopandmanagenearlyallaspectsofanorganizationscybersecurityoperations,butyoualsosignaltoemployersyourcommitmenttolife-longlearningandtakinganactiveroleinfulfillingthe(isc)2visionofinspiringasafeandsecurecyberworldThematerialinthisstudyguideisbaseduponthe(isc)2cisspCommonBodyofKnowledge.ItwillhelpyoupreparefortheexamthatwillassessyourcompetencyinthefollowingeightdomainsaSecurityandriskmanagement■AssetsecuritySecurityArchitectureandengineeringaCommunicationandNetworksecurityaIdentityandAccessManagement(IAM)SecurityAssessmentandTesting■SecurityOperationsSoftwareDevelopmentSecurityWhilethisstudyguidewillhelpyouprepare,passingthecisspexamdependsonyourmasteryofthedomainscombinedwithyourabilitytoapplythoseconceptsusingyourreal-worldexperienceiwishyouthebestofluckasyoucontinueonyourpathtobecomeaCISSPandcertifiedmemberof(Isc)2Sincerely,Davidshearer.CISSPCEO(ISC)2Ackn。
w|edgmentsWe'dliketoexpressourthankstoSybexforcontinuingtosupportthisproject.Extrathankstotheeightheditiondevelopmentaleditor,kellyTalbot,andtechnicaleditors,JeffParker,BobSipes,andDavidSeidlwhoperformedamazingfeatsinguidingustoimprovethisbookThanksaswelltoouragent,CaroleJelen,forcontinuingtoassistinnailingdowntheseprojectsMikejames.anddarrilSpecialthanksgototheinformationsecurityteamattheUniversityofNotreDame,whoprovidedhoursofinterestingconversationanddebateonsecurityissuesthatinspiredandinformedmuchofthematerialinthisbookIwouldliketothanktheteamatwileywhoprovidedinvaluableassistancethroughoutthebookdevelopmentprocess.ialsooweadebtofgratitudetomyliteraryagent,CaroleJelenofWatersideProductions.Mycoauthors,JamesMichaelStewartanddarrilGibsonweregreatcollaborators.JeffParker,BobSipes,andDavidSeidl,ourdiligentandknowledgeabletechnicaleditors,providedvaluableinsightaswebroughtthiseditiontopressIdalsoliketothankthemanypeoplewhoparticipatedintheproductionofthisbookbutwhomIneverhadthechancetomeet:thegraphicsteam,theproductionstaff,andallofthoseinvolvedinbringingthisbooktopress-MikeChappleThankstoMikeChappleandDarrilGibsonforcontinuingtocontributetothisprojectThanksalsotoallmycisspcoursestudentswhohaveprovidedtheirinsightandinputtoimprovemytrainingcoursewareandultimatelythistome.Tomyadoringwife,CathyBuildingalifeandafamilytogetherhasbeenmorewonderfulthanIcouldhaveeverimagined.ToSlaydeandremi:youaregrowingupsofastandlearningatanoutstandingpace,andyoucontinuetodelightandimpressmedaily.YouarebothgrowingintoamazingindividualsTomymom,Johnnie:ItiswonderfultohaveyouclosebyToMarkNomatterhowmuchtimehaspassedorhowlittleweseeeachother,Ihavebeenandalwayswillbeyourfriend.andfinally,asalways,toElvis:Youwerewayaheadofthecurrentbaconobsessionwithyourpeanutbutter/banana/baconsandwich;ithinkthat'sproofyoutraveledthroughtimeJamesmichaelStewartThankstoJimMinatelandCaroleJelenforhelpinggetthisupdateinplacebefore(IsC)2releasedtheobjectives.Thishelpedusgetaheadstartonthisnewedition,andweappreciateyourefforts.It'sbeenapleasureworkingwithtalentedpeoplelikeJamesMichaelStewartandMikeChappleThankstobothofyouforallyourworkandcollaborativeeffortsonthisproject.Thetechnicaleditors,JeffParkerBobSipes,andDavidSeidl,provideduswithsomeoutstandingfeedback,andthisbookisbetterbecauseoftheireffortsThankstotheteamatSybex(includingprojectmanagers,editors,andgraphicsartists)foralltheworkyoudidhelpingusgetthisbooktoprint.Last,thankstomywife,Nimfa,forputtingupwithmyoddhoursasIworkedonthisbookDarrilgibsonAbouttheauthorsMikeChapple,CISSP,PhD,Security+,CISA,CySA+,isanassociateteachingprofessorofIT,analytics,andoperationsattheUniversityofNotreDame.InthepasthewaschiefinformationofficerofBrandInstituteandaninformationsecurityresearcherwiththenationalSecurityagencyandtheu.s.airForcehisprimaryareasofexpertiseincludenetworkintrusiondetectionandaccesscontrols.mikeisafrequentcontributortoTechTarget'sSearchSecuritysiteandtheauthorofmorethan25booksincludingthecompanionbooktothisstudyguide:CISSPOfficial(ISC)2PracticeTests,theCompTIACSA+StudyGuide,andCyberwarfare:InformationOperationsinaConnectedWorld.MikeoffersstudygroupsfortheCISSP,SSCP,Security+,andcSa+certificationsonhiswebsiteatwww.certmike.comJamesMichaelStewart,CISSP,CEH,ECSA,CHFI,Security+Network+,hasbeenwritingandtrainingformorethan20years,withacurrentfocusonsecurity.hehasbeenteachingCiSsPtrainingcoursessince2002,nottomentionothercoursesonInternetsecurityandethicalhacking/penetrationtestingHeistheauthorofandcontributortomorethan75booksandnumerouscoursewaresetsonsecuritycertification,Microsofttopics,andnetworkadministrationincludingtheSecurity+(SY0-501)Reviewguide.Moreinformationaboutmichaelcanbefoundathiswebsiteatwww.impactonline.comDarrilGibson,CISSP,Security+,CASP,istheCeoofYODa(shortforYouCanDoAnything),andhehasauthoredorcoauthoredmorethan40books.Darrilregularlywrites,consults,andteachesonawidevarietyoftechnicalandsecuritytopicsandholdsseveralcertificationsHeregularlypostsblogarticlesathttp://blogs.getcertifiedgetahead.com/aboutcertificationtopicsandusesthatsitetohelppeoplestayabreastofchangesincertificationexams.Heloveshearingfromreaders,especiallywhentheypassanexamafterusingoneofhisbooks,andyoucancontacthimthroughthelebloggingsite.

模仿数据链路层的gobackn协议/*该协议是搭载ack的回退n步协议*/#include#include"protocol.h"#definemax_seq7#defineflag126#defineESC100#definewait_time2700 //发送计时器等待的时间#defineack_wait_time280staticintphl_ready=0;unsignedcharbuf[max_seq+1][270];unsignedcharack[8];//发送空的ack帧unsignedcharin_buf[600],last_buf[520];//接收时的缓冲区;去掉冗余之后的缓冲区,为防备因误码两帧合并为一帧而定义了很大一个数组intnbuffered=0;//发送的帧数intbuf_size[max_seq+1];//记下以发送各帧的帧长intnext_frame_to_send=0;intframe_in_phl=0;//用于成帧intframe_expected=0;intack_expected=0;intbetween(inta,intb,intc){ if(((a＜=b)&&(b＜c))||((c＜a)&&(a＜=b))||((b＜c)&&(c＜a))) return1; elsereturn0;}//判断帧尾,防止出现误判escescflag为数据的情况intend_flag(intin_len){ intcount=0; inti; if(in_len=0;i--)//记录flag前的esc数目 count++; returncount%2;//若flag前的esc为偶数，则为帧尾}//成帧函数--数据帧voidsend_frame(char*my_buf,intlen){ intn; buf[frame_in_phl][0]=(frame_expected+max_seq)%(max_seq+1); //ack buf[frame_in_phl][1]=frame_in_phl; //发送帧的帧号 for(n=0;n＜len;n++) buf[frame_in_phl][n+2]=my_buf[n]; //将处理过的新帧赋值到缓冲区中 len=len+2; *(unsignedint*)(buf[frame_in_phl]+len)=crc32(buf[frame_in_phl],len); //在原始帧的基础上加检验和 buf_size[frame_in_phl]=len+4; //记录当前帧的长度,包括3个帧头，4个检验和 nbuffered=nbuffered+1; //缓冲区占用数加一 frame_in_phl=(frame_in_phl+1)%(max_seq+1);}//成帧函数--ack帧voidsend_ack() //ack帧的处理{ ack[0]=(frame_expected+max_seq)%(max_seq+1); ack[1]=max_seq+10; //ack帧的序号位，使ack[1]==frame_expected恒不成立 *(unsignedint*)(ack+2)=crc32(ack,2); //在原始帧的基础上加检验和}//主函数intmain(intargc,char**argv){intevent,arg,n,m,i,j,len=0,in_len=0; unsignedcharmy_buf[260]; intphl_wait=0;//在物理层中还没有被发送的帧protocol_init(argc,argv);enable_network_layer();for(;;){event=wait_for_event(&arg);switch(event){caseNETWORK_LAYER_READY:

ActiveRecord模型Rails实验室目标手动创建迁移手动创建模型建立模型实例方法建立模型您可以在spec/models目录中找到此应用程序的测试套件，并使用以下命令运行它们：bundleexecrspec。
该实验室进行测试以确保您的应用程序可以创建记录，并且具有可以在模型上调用的实例方法。
指示手动创建一个名为“students的表，该表具有以下列：first_name和last_name–这应该通过创建新的数据库迁移来完成为学生表创建一个模型，该模型继承自ActiveRecord::Base在模型中实现to_s实例方法，该方法将为学生前往串联的名字和姓氏。
例如：first_name:"Daenerys",last_name:"Targaryen"=＞"DaenerysTargaryen"在Learn.co上查看，并开始

LeetCodecpp最新中文题解.pdfLeetCodecpp最新中文题解.pdfLeetCodecpp最新中文题解.pdf目录3.4Addbinary615.1.5BinaryTreeLevelOr-3.5LongestPalindromicSubstring.62dertraversalil3.6RegularExpressionMatching665.1.6BinaryTreeZigzag3.7WildcardMatching67LevelOrdertraversal.963.8LongestCommonPrefix5.1.7RecoverBinarySearch3.9ValidNumber70Tree983.10Integertoroman725.1.8SameTree3.11RomantoInteger735.1.9SymmetricTree1003.12CountandSay745.1.10BalancedBinaryTree..1023.13Anagrams755.1.11FlattenBinaryTreeto3.14SimplifyPath76LinkedList1033.15LengthofLastWord775.1.12PopulatingNextRightPointersineachnodeii105第4章栈和队列7952二叉树的构建10641栈795.2.1ConstructBinaryTree4ValidParentheses79fromPreorderandIn4.1.2LongestvalidParenorderTraversa106theses805.2.2ConstructBinaryTree4.1.3LargestRectangleinfromInorderandposHistogram82torderTraversal1074.1.4Evaluatereversepol-53二叉查找树108ishnotation845.3.1UniqueBinarySearch4.2队列85Trees.1085.3.2UniqueBinarySearch第5章树86Treesli.1105.1二叉树的遍历865.3.3ValidateBinarySearch5.1.1BinaryTreePreorderTreeTraversal865.3.4ConvertSortedarrayto5.1.2BinaryTreeInorderBinarySearchTree...112Traversal885.3.5ConvertSortedListto5.1.3BinaryTreePostorderBinarySearchTree113Traversal9054二叉树的递归.1145.1.4BinaryTreeLevelOr5.4.1MinimumDepthofBidertraversal)2narylree115目录5.4.2MaximumDepthofBi8.3.,2重新实现nextpermunaryTree116tation1425.4.3PathSum11783.3递归.1435.44PathSumil1188.4PermutationsII1445.4.5BinaryTreeMaximum8.4.1nextpermutation...144PathSuum11984.2重新实现nextpermu5.4.6PopulatingNextRighttation144Pointersineachnode120843递归1445.4.7SumRoottoLeafnum8.5Combinations146bers2185.1递归1468.5.2迭代147第6章排序1238.6LetterCombinationsofaphone6.1MergeSortedArray123umber1476.2MergeTwoSortedLists12486.1递归1486.3MergekSortedLists124862迭代96.4InsertionSortList125第9章广度优先搜索1506.5Sortlist1269.1WordLadder1506.6FirstMissingPositive1279.2WordLadderil1546.7SortColors1289.3Surroundedregions162第7章查找94小结16413194.l适用场景1647.1Searchforarange131942思考的步骤7.2SearchInsertPosition.13294.3代码模板1657.3Searcha2DMatrix133第10章深度优先搜索173第8章暴力枚举法13510.1PalindromePartitioning1738.1Subsets13510.2UniquePaths1768.1.1递归1350.2.1深搜1768.1.2迭代.1371022备忘录法.1768.2Subsetsil13810.23动规177821递归13810.24数学公式1788.2.2迭代.14110.3UniquePathsIl1798.3Permutations14210.3.1备忘录法1798.3.1nextpermutation14210.3.2动规.180目录10.4N-Queens1813.4Maximalrectangle21310.5N-QueensII18413.5BestTimetoBuyandSellStock10.6Restoreipaddresses186.21410.7CombinationSum18813.6InterleavingString21510.8CombinationSumIl18913.7ScrambleString21710.9GenerateParentheses.19013.8MinimumPathSum.22210.10Sudokusolver19213.9EditDistance22410.11WordSearch.19313.10DecodeWays.22610.12小结19513.11Distinctsub22710.12.1适用场景19513.12WordBreak22810.122思考的步骤1951313WordBreakil2300.12.3代码模板197第14章图23210.12.4深搜与回溯法的区別.19714.1CloneGraph23210.12.5深搜与递归的区别..197第15章细节实现题235第11章分治法19915.1ReverseInteger2351.1Pow(x,n)19915.2PalindromeNumber.23611.2Sqrt(x)20015.3InsertInterval237第12章贪心法20115.4MergeIntervals23812.1Jumpgame20115.5MinimumWindowSubstring23912.2JumpgameII15.6MultiplyStrings24112.3BestTimetobuyandSellstock20415.7SubstringwithConcatenation12.4BestTimetobuyandsellstockl205ofallwords24412.5LongestSubstringWithoutre15.8Pascal,sTriangle245peatingCharacters20615.9PascalsTriangleIl24612.6ContainerwithMostWater..20715.10SpiralMatrix24715.11SpiralmatrixII248第13章动态规划20915.12ZigZagConversion25013.1Triangle20915.13DivideTwoIntegers25113.2MaximumSubarray15.14TextJustification25313.3PalindromePartitioningII1215.15MaxPointsonaline255目录第1章编程技巧在判断两个浮点数a和b是否相等时,不要用a==b,应该判断二者之差的绝对值fabs(a-b)是否小于某个阈值,例如1e-9。
判断一个整数是否是为奇数,用x%2!=0,不要用x%2=1,因为ⅹ可能是负用char的值作为数组下标(例如,统计字符串中每个字符岀现的次数),要考虑到char可能是负数。
有的人考虑到了,先强制转型为unsignedint再用作下标,这仍然是错的。
正确的做法是,先强制转型为unsignedchar,再用作下标。
这涉及C十整型提升的规则,就不详述了。
以下是关于STL使用技巧的,很多条款来自《EffectiveSTL》这本书。
vector和string优先于动态分配的数组首先,在功能上,由于vector能够保证连续内存,因此一旦分配了后,它的功能跟原始数组相当;其次,如果用new,意味着你要确保后面进行孓delete,一旦忘记了,就会出现BUG,且这样需要都写一行delete,代码不够短再次,声明多维数组的话,只能一个一个new,例如int**ary=newint*[row_num];for(inti=0:i<rownum;++1)ary[i]newint[col_num]用vector的话一行代码搞定vector<vector<int>>ary(row_num,vector<int>(col_num,0))使用reserve来避免不必要的重新分配第2章线性表这类题目考察线性表的操作,例如,数组,单链表,双向链表等。
2数组2.1.1RemoveDuplicatesfromSortedarray描述Givenasortedarray,removetheduplicatesinplacesuchthateachelementappearonlyonceandreturnthenewlengthDonotallocateextraspaceforanotherarray,youmustdothisinplacewithconstantmemoryForexample,GiveninputarrayA=[1,1,2Yourfunctionshouldreturnlength=2,andaisnow[1,2]分析无代码1/LeetCode,RemoveDuplicatesfromSortedArray//时间复杂度0(n),空间复杂度0(1)classSolutiontublicintremoveDuplicates(vector<int>&nums)tif(numsemptyo)return0;intindex=ofor(inti=1:inumssize:1++iif(nums[index]!nums[i])nums[++index]=nums[i]returnindex12.1数组代码2//LeetCode,RemoveDuplicatesfromSortedArray/使用STL,时间复杂度0(n),空间复杂度0(1)classSolutionipublicintremoveDuplicates(vector<int>&nums)treturndistance(numsbegin(),unique(numsbegin(),numsend())代码3/LeetCode,RemoveDuplicatesfromSortedArray/使用STL,时间复杂度0(n),空间复杂度0(1)lassSolutionfublicintremoveDuplicates(vector<int>&nums)treturndistance(numsbegin(,removeDuplicates(numsbegin(,numsend(),numsbegintemplate<typenameInIt,typenameoutit>OutItremoveDuplicates(InItfirst,InItlast,OutItoutput)thile(firstlast)i*output++=*firstfirstupper_bound(first,last,*firstreturnoutput相关题目RemoveDuplicatesfromSortedArrayI,见§2.1.22.1.2RemoveDuplicatesfromSortedArrayII描述Followupfor"RemoveDuplicates"Whatifduplicatesareallowedatmosttwice?Forexample,Givensortedarraya=[1,1,1,2,2,3]Yourfunctionshouldreturnlength=5,andAisnow[1,1,2,2,3分析加一个变量记录一下元素出现的次数即可。
这题因为是已经排序的数组,所以一个变量即可解决。
如果是没有排序的数组,则需要引入一个hashmap来记录出现次数。
4第2章线性表代码1//LeetCode,RemoveDuplicatesfromSortedArrayII//时间复杂度0(n),空间复杂度0(1)//qauthorhex108(https://github.com/hex108)classSolutiontublicintremoveDuplicates(vector<int>&nums)tif(numssize(<=2)returnnumssizeintindex=2for(inti=2:inumssize(:i++)ff(nums[i]!numslindex-2]nums[index++]=nums[i]returnindex;代码2下面是一个更简洁的版本。
上面的代码略长,不过扩展性好一些,例如将occur<2改为occur3,就变成了允许重复最多3次。
//LeetCode,RemoveDuplicatesfromSortedArrayII7/@author虞航仲(http://weibo.com/u/1666779725)//时间复杂度0(n),空间复杂度0(1)lassSolutionfpublicintremoveDuplicates(vector<int>&nums)tconstintn=numssizeintindex=0:for(inti=0:i<n;++i)if(i>0&&i<n-1&nums[i]=nums[i-1]&nums[i]=nums[i1])continue;nums[index++]=nums[i]returnindex;相关题目RemoveDuplicatesfromSortedArray,见§2.1.1

在日常工作中，钉钉打卡成了我生活中不可或缺的一部分。然而，有时候这个看似简单的任务却给我带来了不少烦恼。 每天早晚，我总是得牢记打开钉钉应用，点击"工作台"，再找到"考勤打卡"进行签到。有时候因为工作忙碌，会忘记打卡，导致考勤异常，影响当月的工作评价。而且，由于我使用的是苹果手机，有时候系统更新后，钉钉的某些功能会出现异常，使得打卡变得更加麻烦。 另外，我的家人使用的是安卓手机，他们也经常抱怨钉钉打卡的繁琐。尤其是对于那些不太熟悉手机操作的长辈来说，每次打卡都是一次挑战。他们总是担心自己会操作失误，导致打卡失败。 为了解决这些烦恼，我开始思考是否可以通过编写一个全自动化脚本来实现钉钉打卡。经过一段时间的摸索和学习，我终于成功编写出了一个适用于苹果和安卓系统的钉钉打卡脚本。