1 Which of the following keyword can not be appeared inside the class? a)virtual b)static c)template d)friend c
|
|
- Paula Austin
- 6 years ago
- Views:
Transcription
1 1 Whih of the following keywor n not e ppere insie the lss? )virtul )stti )templte )frien 2 Wht is templte? )Templte is formul for reting generi lss )Templte is use to mnipulte lss )Templte is use for reting funtions )None of these 3 Selet the orret syntx of templte: )Templte )Templte<> )Temp )None of these 4 A lss is generte from templte lss is lle. )inherite lss )erive lss )generte lss )sulss 5 is useful when templte of templte is use? )Frien funtion )Stti funtion )Typeef )Inheritne 6 Whih of the C++ feture llows you to rete lsses tht re ynmi for using t types? )Templtes )Inheritne )Polymorphism )Informtion hiing 7 A funtion templte mens. )reting funtion hving ext type
2 )reting funtion without hving to speify ext type )oth n 8 Whih of the following is use to esrie the funtion using pleholer type? )Templte type prmeter )Templte prmeter )Templte type )None of these 9 String templte is use. )to reple string. )to reple string with nother string )to elete string 10 Mximum numer of templte rgument in funtion templte is. )two )three )four )mny 11 Templte funtion must hve )one or more thn one rgument )zero rgument )only one rgument )t lest two rguments 12 Templte funtion must hve t lest generi t type. )zero )one )two 13 Templtes provie wy of strting informtion. )type )t )metho
3 )ess 14 If you rete instntition of lss templte with n int n then rete seon instntition with oule then )one the funtion is use for one t type it eomes unville for other type )you n not perform this kin of opertion in C++ )you must preee eh funtion ll with the wor int or oule 15 If templtes were remove from C++,Whih of the following will e true? I. Some lgorithms oul no longer e implemente II. Any prtiulr lgorithms oul still e implemente ut often less elegntly. )Only I is true )Only II is true )Both I n II is true )None of these 16 In the templte <lss T>elrtion of T stns for. )integer t type )ritry lss )generi t types 17 Wht will e the output of the following oe? #inlue<iostrem> using nmespe st; templte <lss T> lss TEST puli: T I; TEST(T j):i(j)out<< TEST ; ; int min() TEST<int>oj(1.1); out <<oj.i<<enl; )TEST1.1
4 )TEST1 )1 )Syntx error 18 Wht will e the output of the following oe? #inlue<iostrem> using nmespe st; lss TEST puli: T I; TEST(T j):i(j)out<< TEST ; ; int min() TEST<oule>oj(1.1) out<<oj.i<<enl; )TEST1.1 )TEST1 )1 )Syntx error 19 Wht is the mening of templte prmeter? )It is use to pss type s rgument )It is use to evlute type )It hs no return type )None of these 20 Wht n e psse y non-type templte prmeter uring ompile time? )int )oule )hr )onstnt expression 21 Wht will e the output of the following oe? #inlue<iostrem> using nmespe st; templte <lss T1,T2>
5 int min(t1 t1,t2 t2) if(t1<t2) return 1; else int min() out<<min(10,20)<<enl; )0 )1 )2 )Syntx error 22 Wht will e the output of the following oe? #inlue<iostrem> using nmespe st; templte <lss T1,typenme T2> int min(t1 t1,t2 t2) if(t1<t2) return 1; else int min() out<<min(10,20)<<enl; )0 )1 )2 )Syntx error 23 Wht will e the output of the following oe? #inlue<iostrem> using nmespe st; strut TEST int I; ; templte <lss T>
6 vio fun(t ) int j=.i+.i;.i=j; int min() TEST s=10; fun(s); out<<s.i<<enl; )10 )20 )Grge vlue )Syntx error 24 Choose the orret sttement from the following: )Templte funtion will tke long time to exeute )Templte funtions re written when you wnt to hve only one oe for mny ifferent types ) Due to templte funtion the uplite oe will get inrese )None of these 25 Wht will e the output of the following oe? #inlue<iostrem> using nmespe st; templte <lss T1> T Mx(T Vl1,T Vl2) return Vl1>Vl2? Vl1:Vl2; int min() int p; p=mx(100,200); out<<p<<enl; )100 )200 )Syntx error )1
7 26 Wht will e the output of the following oe? #inlue<iostrem> using nmespe st; templte <lss T1> inline t squre(tx) T result; result=x*x; return result; ; int min() int,; oule,; =10; =10.1; =squre(); out<<<< <<<<enl; =squre(); out<<<< <<<<enl; ) ) )Syntx error )None of these 27 Wht will e the output of the following oe? #inlue<iostrem> #inlue<string> using nmespe st; templte<typenme T> voi isply(t result) out<<result<<enl; int min() oule vl=11.11; string str( test String ); isply(vl); isply(str); )11.11 Test String
8 ) )Test String )None of these 28 How mny types of templtes re there in ++? )two )Three )Four )None Of These 29 Wht is the tsk of ompiler while hnling templte? )type ssoition )portility )oe elimintion )ll of the ove 30 Wht shoul e the nme of the prmeter tht the templte shoul tke? )sme s lss )sme s funtion )sme s templte ) none of these 31 Whih keywor n e use with templte? )typenme )lss )oth n )None of these 32 Whih of the following esries iffrene etween templte funtion n templte lss in ++? )The ompiler etermines the type of templte funtion's rguments,ut the types of templte lsses must e stte expliitly when elring ojets )templte funtions nnot e efine for user-efine types, ut templte lsses n. )templte lsses nnot e efine for user-efine types, ut templte funtions n. )None Of These 33 Wht is the vliity of templte prmeter?. Insie the lss
9 . Insie the lok. whole progrm. None of these 34 Consier the following oe Frgment Templte<typenme t> voi swp(t &,T&) T temp; temp=; =temp; Determining the right hoie of type prmeter T ours t. Compile time only. Run time only. link time only. prtly t Compile time n prtly t run time 35 Whih of the following oes not require instlltion?. Non virtul memer funtion. Memer lss. Funtion. All of ove 36 Exeution of whih sttement sets the STL itertor ITR to point to the first element of ontin ARR? )ARR.reset(ITR); )ARR.egin(ITR); )ITR=ARR.egin(); )None of these 37 STL is se on following progrmming prigm. ) templte ) inheritne ) polymorphism ) None Of These
10 38 STL is se on following progrmming prism )struture progrmming )funtion progrmming )ojet oriente progrmming 39 The use of nmespe is to. )struture the progrm into logil units )to enpsulte t )to inite the eginning of progrm 40 Whih opertor is use to signify nmespe? )Binry )Ternry )sope )None of these 41 If I wish to ess the nmespe vrile,then the syntx eing use is, )nmespe:opertor )nmespe::opertor )nmespe-> Opertor )None Of These 42 Whih keywor is use to ess the vrile in nmespe. )ynmi )virtul )onstnt )using 43 Choose the orret sttement )nmespe st; )using nmespe st; )nmespe st using; )nmespe using st; 44 Whih of the following orretly esrie the nmespe feture in C++? ) Nmespes mens memory spe llote for nmes use in progrm
11 ) Nmespes refer to the nmes tht re use in the progrm ) Nmespes provie fility for orgnising the nmes in the progrm to voi nme lshes ) None 45 Wht will e the output of the following oe? #inlue <iostrem> using nmespe st; nmespe test int = 10; int min () int = 20; test::; out<<; ) 10 ) 20 ) Syntx error ) Runtime error 46 Wht will e the output of the following oe? #inlue <iostrem> using nmespe st; nmespe test1 int = 10; nmespe test2 int = 20; int min () test1::= test2:: =30; out<<test1::<< <<test2::; ) ) ) 30 30
12 ) syntx error 47 Wht is the output of the following oe? #inlue <iostrem> using nmespe st; nmespe test voi f(hr *s) out<<s; voi f(int ) out<<; int min() using test::f(int); f(10); ) 10 ) Grge vlue ) Syntx error ) None of these 48 Wht will e the output of the following oe? #inlue <iostrem> using nmespe st; nmespe test voi f(hr *s) out<<s; voi f(int ) out<<; int min()
13 using test::f; f(10); f( Hello ); ) 10 ) Hello ) 10Hello ) Syntx error 49 Wht will e the output of the following oe? #inlue <iostrem> using nmespe st; nmespe test voi f(hr *s) out<<s; voi f(int *) out<<*; int min() int i =10; using test::f; f(i); f( Hello ); f(&i); ) 10 ) 10Hello10 ) 10Hello Grgevlue ) Syntx error 50 Whih keywor is use to hnle the exeption? ) try ) th
14 ) throw ) exeption 51 Whih of the following most preferre wy of throwing n hnling exeption? )Throw y vlue n th y referene )Throw y referene n th y vlue )Throw y vlue n th y vlue )None of these 52 Whih of the following is the most generl exeption hnler tht thes exeption of ny type? )Cth(st::exeption) )Cth(st:ny_exeption) )Cth(...) )Cth() 53 Whih of the following uses n exeption ) Missing prenthesis in min() ) Clling funtion whih is not present ) A syntx error )A runtime error 54 Wht will e the output of following oe? #inlue<iostrem> using nmespe st; oule ivision(int,int ) if (==0) Throw Error!!!Division y zero!! ; return(/); int min() int i=10; int j=0; oule k=0; try k=ivision(i,j); out<<k<<enl;
15 th(onst hr *msg) out<<msg<<enl; )10 )0 )Error!!!Division y zero!! )Runtime error 55 Wht will e the output of following oe? #inlue<iostrem> #inlue<exeption> using nmespe st; int min() try int *A=new int[1000]; out<< Memory is llote ; th(exeption &e) out<< Error in memory llotion <<enl; ) Memory is llote ) Error in memory llotion )Syntx error )Run time error 56 Whih lok shoul e ple fter try lok? )throw )th )oth or )None of these 57 Wht will e the output of following oe?
16 #inlue<iostrem> using nmespe st; int min() try throw 100; th(int ) out<< Numer : <<<<enl; out<< No exeption!!! <<enl; )Numer:100 )Numer )No Exeption!!! )Syntx error 58 Choose the orret sttement )Exeption re not suitle for ritil points in the progrm )Exeption re suitle for ritil points in the progrm )Both & )None of these 59 In C++ progrm hnling, try lok must e followe y th loks. )extly one )one or more )extly two 60 The proess of hnling the tul exeption ours )insie the progrm )outsie the progrm )oth & 61 Whih of the following is use to hek the error in the lok?
17 )try )throw )th 62 Wht shoul e present when throwing ojet? )onstrutor )estrutor )opy onstrutor 63 For hnling the exeption in C++ re use )th hnlers )exeption hnlers )pointers 64 For hnling the exeptions in C++ is use. )hnler funtion )terminte funtion )oth & 65 How mny prmeters oes the throw expression n hve? )0 )1 )2 )3 66 Wht kin of exeptions re use in C++ )Hnle ) Unhnle )Stti )Dynmi 67 Wht will hppen when exeption is unught? )Arise n error )progrm will run
18 )exeute in loop 68 Choose the orret sttement )A funtion n throw ny type of exeption )A funtion n throw n exeption of ertin type only )A exeption n't throw ny type of exeption 69 Wht funtion will e lle when we hve unught exeption? )th )throw )terminte 70 Wht will hppen when progrms throws ny other of exeption other thn speifie? )still exeute )terminte )rise n error. C 71 Whih lterntive n reple the throw sttement? )exit )for )rek )return 72 Wht re preefine exeption in ++? )memory llotion errors )i/o errors )oth & 73 Wht is run-time type informtion? )informtion out n ojet's ttype )informtion out the vriles )informtion out the lok
19 74 Whih of the follwing opertors is use to otin the ynmi type of n ojet? )ynmi_st )typei )typeinfo 75 To whih type of lss the RTTI n e pplie? )enpsulte )erive )polymorphi 76 The type_info mens )the type informtion returne y ynni_st opertor )the type informtion returne y typie opertor )the type informtion returne y stti st 77 The input n output strems in n out re therefore hve. )struture,funtions )ojets,memer funtions )funtions,ojets 78 The opertor funtions for <<(strem insertion)>>n strem extrtion must e )memer funtion of lss )non memer funtion of lss )oth memer n non memer funtion )non of these 79 A file to e opene for writing requires the )fstrem )ofstrem )ifstrem )iofstrem 80 A file to e opene for reing requires the strem
20 )fstrem )ofstrem )ifstrem )iofstrem 81 If we rete file y ifstrem then we n )r e from s well s write into the file )re t from file )write t to file 82 To perform strem I/o with isk files in ++, you shoul )use the lsses erive from ios )inlue iostrem.h )use lnguge lirry funtions to re n write t 83 The purpose of using files is )voi typing t multiple times in progrm )to el with lrge quntitiezs of t )to store quntities of t )ll of these 84 The eof() is use to )hek en of file )hek en of sentene )hek en of sentene 85 Wht is the output of the following oe? #INCLUDE<IOSTREAM> using nmespe st; int min() Int I; out<<:enter the integer vlue: ; in>>i+10;
21 )10 )0 )syntx error 86 Re() is memer funtion of )ostrem lss )file lss )istrem lss 87 Choose orret ojet out instntition of output strem )out )err )log )ll of these 88 Wht must e speifie when we onstrut n ojet of lss ostrem? )strem )stremuf )memory 89 How mny groups of opertions re there in ++? )1 )2 )3 )4 90 Whih opertor is use for input strem? ) > ) < ) << ) >> 91 in will stop enountering the extrtion when it enounters? ) ( ) )
22 ) lnk spe ) none of these 92 Whih of the following ojet is use to get the input t runtime? ) out ) in ) oi ) none of these 93 For reing with in ojet we nee to inlue files. ) fstrem.h ) stio.h ) iostrem.h ) none of these 94 From the following is not mnipultor. ) e ) sientifi ) enl ) none of these 95 Wht will e the output of the following oe? #inlue<iostrem> using nmespe st; int min() hr [100]; in.getline(, 100,'\n'); out<<; ) lnk line ) 100 ) the ontents tht we type on the onsole will e isplye. ) syntx error 96 The in will strt proessing the input when ) we hit the enter key ) we press the lnk spe ) oth &
23 ) none of these 97 Whih opertor is use to insert t into the file? ) << ) >> ) < ) none of these 98 Whih of the following is the orret formt of reing the inry input? ) infile.re((hr*)&v,sizeof(v)) ) infile.re(sizeof(v)) ) infile.re(hr*,size(v)) ) re(hr*,sizeof(v)) 99 Choose the orret option I. t is trnsferre etween onsole n progrm II. t is trnsferre etween the progrm n isk file. ) only I is true ) only II is true ) oth I n II is true ) neither I nor II is true 100 Choose the orret option I. strem ts s n interfe etween file n progrm II. the re() n write() hnles the t in text formt ) only I is true ) only II is true ) oth I n II is true ) neither I nor II is true 111 Whih of the following will t s intermeite etween I/O opertions n physil file? ) memory ) RAM ) strem uffer ) none of these 112 From the following whih funtions oes the uffer flushing? ) fopen
24 ) flose ) opy ) none of these 113 Whih of the funtions return the urrent position of get or put pointers in ytes? ) tellg() ) tellp() ) tell() ) oth n 114 Whih of these re inry file opertions? ) get() n put() ) re() n write() ) oth n ) none of these 115 Whih one of the following sttement onnets the file strem ojet nme fin with externl file test.text? ) fin= test.txt ) fin.open( test.txt ); ) fin.open(test.txt); 116 A file strem tht reeives or res t from file into progrm is referre to s. ) out ) output file strem ) input file strem ) in 117 Whih of the following heer file oes not exist? ) <iostrem> ) <string> ) <sstring> ) <sstrem> 118 The ojets hve the vlues tht n e teste for vrious error onitions ) ostrem ) ofstrem
25 ) strem ) ifstrem 119 If you use sme vrile for two getline sttements ) you nnot use sme vrile for two getline sttements ) oth the inputs re store in tht vrile ) the seon input overwrites the first one
Containers: Queue and List
Continers: Queue n List Queue A ontiner in whih insertion is one t one en (the til) n eletion is one t the other en (the he). Also lle FIFO (First-In, First-Out) Jori Cortell n Jori Petit Deprtment of
More informationCOMPUTER EDUCATION TECHNIQUES, INC. (WEBLOGIC_SVR_ADM ) SA:
In orer to lern whih questions hve een nswere orretly: 1. Print these pges. 2. Answer the questions. 3. Sen this ssessment with the nswers vi:. FAX to (212) 967-3498. Or. Mil the nswers to the following
More informationCS 241 Week 4 Tutorial Solutions
CS 4 Week 4 Tutoril Solutions Writing n Assemler, Prt & Regulr Lnguges Prt Winter 8 Assemling instrutions utomtilly. slt $d, $s, $t. Solution: $d, $s, nd $t ll fit in -it signed integers sine they re 5-it
More informationError Numbers of the Standard Function Block
A.2.2 Numers of the Stndrd Funtion Blok evlution The result of the logi opertion RLO is set if n error ours while the stndrd funtion lok is eing proessed. This llows you to rnh to your own error evlution
More informationDistance vector protocol
istne vetor protool Irene Finohi finohi@i.unirom.it Routing Routing protool Gol: etermine goo pth (sequene of routers) thru network from soure to Grph strtion for routing lgorithms: grph noes re routers
More informationUTMC APPLICATION NOTE UT1553B BCRT TO INTERFACE PSEUDO-DUAL-PORT RAM ARCHITECTURE INTRODUCTION ARBITRATION DETAILS DESIGN SELECTIONS
UTMC APPLICATION NOTE UT1553B BCRT TO 80186 INTERFACE INTRODUCTION The UTMC UT1553B BCRT is monolithi CMOS integrte iruit tht provies omprehensive Bus Controller n Remote Terminl funtions for MIL-STD-
More information10.2 Graph Terminology and Special Types of Graphs
10.2 Grph Terminology n Speil Types of Grphs Definition 1. Two verties u n v in n unirete grph G re lle jent (or neighors) in G iff u n v re enpoints of n ege e of G. Suh n ege e is lle inient with the
More informationCICS Application Design
CICS Applition Design In orer to lern whih questions hve een nswere orretly: 1. Print these pges. 2. Answer the questions. 3. Sen this ssessment with the nswers vi:. FAX to (212) 967-3498. Or. Mil the
More informationRolling Back Remote Provisioning Changes. Dell Command Integration for System Center
Rolling Bk Remote Provisioning Chnges Dell Commn Integrtion for System Center Notes, utions, n wrnings NOTE: A NOTE inites importnt informtion tht helps you mke etter use of your prout. CAUTION: A CAUTION
More informationType Checking. Roadmap (Where are we?) Last lecture Context-sensitive analysis. This lecture Type checking. Symbol tables
Type Cheking Rodmp (Where re we?) Lst leture Contet-sensitie nlysis Motition Attriute grmmrs Ad ho Synt-direted trnsltion This leture Type heking Type systems Using synt direted trnsltion Symol tles Leil
More informationAdvanced Programming Handout 5. Enter Okasaki. Persistent vs. Ephemeral. Functional Queues. Simple Example. Persistent vs.
Avne Progrmming Hnout 5 Purel Funtionl Dt Strutures: A Cse Stu in Funtionl Progrmming Persistent vs. Ephemerl An ephemerl t struture is one for whih onl one version is ville t time: fter n upte opertion,
More informationIntroduction to Algebra
INTRODUCTORY ALGEBRA Mini-Leture 1.1 Introdution to Alger Evlute lgeri expressions y sustitution. Trnslte phrses to lgeri expressions. 1. Evlute the expressions when =, =, nd = 6. ) d) 5 10. Trnslte eh
More informationCS453 INTRODUCTION TO DATAFLOW ANALYSIS
CS453 INTRODUCTION TO DATAFLOW ANALYSIS CS453 Leture Register llotion using liveness nlysis 1 Introdution to Dt-flow nlysis Lst Time Register llotion for expression trees nd lol nd prm vrs Tody Register
More informationClass Overview. Database Design. Database Design Process. Database Design. Introduction to Data Management CSE 414
Introution to Dt Mngement CSE 44 Unit 6: Coneptul Design E/R Digrms Integrity Constrints BCNF Introution to Dt Mngement CSE 44 E/R Digrms ( letures) CSE 44 Autumn 08 Clss Overview Dtse Design Unit : Intro
More informationMcAfee Web Gateway
Relese Notes Revision C MAfee We Gtewy 7.6.2.11 Contents Aout this relese Enhnement Resolved issues Instlltion instrutions Known issues Additionl informtion Find produt doumenttion Aout this relese This
More informationCS553 Lecture Introduction to Data-flow Analysis 1
! Ide Introdution to Dt-flow nlysis!lst Time! Implementing Mrk nd Sweep GC!Tody! Control flow grphs! Liveness nlysis! Register llotion CS553 Leture Introdution to Dt-flow Anlysis 1 Dt-flow Anlysis! Dt-flow
More informationCOMPUTER EDUCATION TECHNIQUES, INC. (XML ) SA:
In orer to lern whih questions hve een nswere orretly: 1. Print these pges. 2. Answer the questions. 3. Sen this ssessment with the nswers vi:. FAX to (212) 967-3498. Or. Mil the nswers to the following
More informationCOMMON FRACTIONS. or a / b = a b. , a is called the numerator, and b is called the denominator.
COMMON FRACTIONS BASIC DEFINITIONS * A frtion is n inite ivision. or / * In the frtion is lle the numertor n is lle the enomintor. * The whole is seprte into "" equl prts n we re onsiering "" of those
More informationGENG2140 Modelling and Computer Analysis for Engineers
GENG4 Moelling n Computer Anlysis or Engineers Letures 9 & : Gussin qurture Crete y Grn Romn Joles, PhD Shool o Mehnil Engineering, UWA GENG4 Content Deinition o Gussin qurture Computtion o weights n points
More informationKulleġġ San Ġorġ Preca Il-Liċeo tas-subien Ħamrun. Name & Surname: A) Mark the correct answer by inserting an X in the correct box. a b c d.
Kulleġġ Sn Ġorġ Pre Il-Liċeo ts-suien Ħmrun Hlf Yerly Exmintion 2012 Trk 3 Form 3 INFORMATION TECHNOLOGY Time : 1hr 30 mins Nme & Surnme: Clss: A) Mrk the orret nswer y inserting n X in the orret ox. 1)
More informationCMPUT101 Introduction to Computing - Summer 2002
CMPUT Introdution to Computing - Summer 22 %XLOGLQJ&RPSXWHU&LUFXLWV Chpter 4.4 3XUSRVH We hve looked t so fr how to uild logi gtes from trnsistors. Next we will look t how to uild iruits from logi gtes,
More informationcisc1110 fall 2010 lecture VI.2 call by value function parameters another call by value example:
cisc1110 fll 2010 lecture VI.2 cll y vlue function prmeters more on functions more on cll y vlue nd cll y reference pssing strings to functions returning strings from functions vrile scope glol vriles
More informationLINX MATRIX SWITCHERS FIRMWARE UPDATE INSTRUCTIONS FIRMWARE VERSION
Overview LINX MATRIX SWITCHERS FIRMWARE UPDATE INSTRUCTIONS FIRMWARE VERSION 4.4.1.0 Due to the omplex nture of this updte, plese fmilirize yourself with these instrutions nd then ontt RGB Spetrum Tehnil
More informationPointers and Arrays. More Pointer Examples. Pointers CS 217
Pointers nd Arrs CS 21 1 2 Pointers More Pointer Emples Wht is pointer A vrile whose vlue is the ddress of nother vrile p is pointer to vrile v Opertions &: ddress of (reference) *: indirection (dereference)
More informationFig.25: the Role of LEX
The Lnguge for Specifying Lexicl Anlyzer We shll now study how to uild lexicl nlyzer from specifiction of tokens in the form of list of regulr expressions The discussion centers round the design of n existing
More informationCS321 Languages and Compiler Design I. Winter 2012 Lecture 5
CS321 Lnguges nd Compiler Design I Winter 2012 Lecture 5 1 FINITE AUTOMATA A non-deterministic finite utomton (NFA) consists of: An input lphet Σ, e.g. Σ =,. A set of sttes S, e.g. S = {1, 3, 5, 7, 11,
More information6.045J/18.400J: Automata, Computability and Complexity. Quiz 2: Solutions. Please write your name in the upper corner of each page.
6045J/18400J: Automt, Computbility nd Complexity Mrh 30, 2005 Quiz 2: Solutions Prof Nny Lynh Vinod Vikuntnthn Plese write your nme in the upper orner of eh pge Problem Sore 1 2 3 4 5 6 Totl Q2-1 Problem
More informationMidterm Exam CSC October 2001
Midterm Exm CSC 173 23 Otoer 2001 Diretions This exm hs 8 questions, severl of whih hve suprts. Eh question indites its point vlue. The totl is 100 points. Questions 5() nd 6() re optionl; they re not
More informationbox Boxes and Arrows 3 true 7.59 'X' An object is drawn as a box that contains its data members, for example:
Boxes nd Arrows There re two kinds of vriles in Jv: those tht store primitive vlues nd those tht store references. Primitive vlues re vlues of type long, int, short, chr, yte, oolen, doule, nd flot. References
More informationWORKSHOP 9 HEX MESH USING SWEEP VECTOR
WORKSHOP 9 HEX MESH USING SWEEP VECTOR WS9-1 WS9-2 Prolem Desription This exerise involves importing urve geometry from n IGES file. The urves re use to rete other urves. From the urves trimme surfes re
More informationParallelization Optimization of System-Level Specification
Prlleliztion Optimiztion of System-Level Speifition Luki i niel. Gjski enter for Emedded omputer Systems University of liforni Irvine, 92697, US {li, gjski} @es.ui.edu strt This pper introdues the prlleliztion
More informationOutline. Motivation Background ARCH. Experiment Additional usages for Input-Depth. Regular Expression Matching DPI over Compressed HTTP
ARCH This work ws supported y: The Europen Reserh Counil, The Isreli Centers of Reserh Exellene, The Neptune Consortium, nd Ntionl Siene Foundtion wrd CNS-119748 Outline Motivtion Bkground Regulr Expression
More informationXML and Databases. Outline. XPath. Outline - Lectures. XPath Data Model. Outline - Assignments. XPath. Sebastian Maneth NICTA and UNSW
Outline XML n Dtses Leture 6 Noe Seleting Queries: XPth 1.0 1. XPth Dt Moel: 7 types of noes 2. Simple Exmples 3. Lotion Steps n Pths 4. Vlue Comprison, n Other Funtions Sestin Mneth NICTA n UNSW CSE@UNSW
More informationDistributed Systems Principles and Paradigms. Chapter 11: Distributed File Systems
Distriuted Systems Priniples nd Prdigms Mrten vn Steen VU Amsterdm, Dept. Computer Siene steen@s.vu.nl Chpter 11: Distriuted File Systems Version: Deemer 10, 2012 2 / 14 Distriuted File Systems Distriuted
More informationCOMP108 Algorithmic Foundations
Grph Theory Prudene Wong http://www.s.liv..uk/~pwong/tehing/omp108/201617 How to Mesure 4L? 3L 5L 3L ontiner & 5L ontiner (without mrk) infinite supply of wter You n pour wter from one ontiner to nother
More informationDiscussion 1 Recap. COP4600 Discussion 2 OS concepts, System call, and Assignment 1. Questions. Questions. Outline. Outline 10/24/2010
COP4600 Discussion 2 OS concepts, System cll, nd Assignment 1 TA: Hufeng Jin hj0@cise.ufl.edu Discussion 1 Recp Introduction to C C Bsic Types (chr, int, long, flot, doule, ) C Preprocessors (#include,
More informationPackage Contents. Wireless-G USB Network Adapter with SpeedBooster USB Cable Setup CD-ROM with User Guide (English only) Quick Installation
A Division of Ciso Systems, In. Pkge Contents Wireless-G USB Network Adpter with SpeedBooster USB Cle Setup CD-ROM with User Guide (English only) Quik Instlltion 2,4 GHz 802.11g Wireless Model No. Model
More informationFunctor (1A) Young Won Lim 10/5/17
Copyright (c) 2016-2017 Young W. Lim. Permission is grnted to copy, distribute nd/or modify this document under the terms of the GNU Free Documenttion License, Version 1.2 or ny lter version published
More informationTable-driven look-ahead lexical analysis
Tle-riven look-he lexil nlysis WUU YANG Computer n Informtion Siene Deprtment Ntionl Chio-Tung University, HsinChu, Tiwn, R.O.C. Astrt. Moern progrmming lnguges use regulr expressions to efine vli tokens.
More informationSAS Event Stream Processing 5.1: Using SAS Event Stream Processing Studio
SAS Event Strem Proessing 5.1: Using SAS Event Strem Proessing Stuio Overview to SAS Event Strem Proessing Stuio Overview SAS Event Strem Proessing Stuio is we-se lient tht enles you to rete, eit, uplo,
More informationLesson 4.4. Euler Circuits and Paths. Explore This
Lesson 4.4 Euler Ciruits nd Pths Now tht you re fmilir with some of the onepts of grphs nd the wy grphs onvey onnetions nd reltionships, it s time to egin exploring how they n e used to model mny different
More informationFrom Dependencies to Evaluation Strategies
From Dependencies to Evlution Strtegies Possile strtegies: 1 let the user define the evlution order 2 utomtic strtegy sed on the dependencies: use locl dependencies to determine which ttriutes to compute
More informationDistributed Systems Principles and Paradigms
Distriuted Systems Priniples nd Prdigms Christoph Dorn Distriuted Systems Group, Vienn University of Tehnology.dorn@infosys.tuwien..t http://www.infosys.tuwien..t/stff/dorn Slides dpted from Mrten vn Steen,
More informationCSc 453 Compilers and Systems Software. 6 : Top-Down Parsing I
C 45 Compilers n ystems oftwre 6 : op-down Prsing I Christin Collberg Deprtment of Computer iene University of rizon ollberg@gmil.om Copyright 2009 Christin Collberg eptember 14, 2009 1 Overview 2 Compiler
More informationCalculus Differentiation
//007 Clulus Differentition Jeffrey Seguritn person in rowot miles from the nerest point on strit shoreline wishes to reh house 6 miles frther down the shore. The person n row t rte of mi/hr nd wlk t rte
More informationPattern Matching. Pattern Matching. Pattern Matching. Review of Regular Expressions
Pttern Mthing Pttern Mthing Some of these leture slides hve een dpted from: lgorithms in C, Roert Sedgewik. Gol. Generlize string serhing to inompletely speified ptterns. pplitions. Test if string or its
More informationASTs, Regex, Parsing, and Pretty Printing
ASTs, Regex, Prsing, nd Pretty Printing CS 2112 Fll 2016 1 Algeric Expressions To strt, consider integer rithmetic. Suppose we hve the following 1. The lphet we will use is the digits {0, 1, 2, 3, 4, 5,
More informationFunctor (1A) Young Won Lim 8/2/17
Copyright (c) 2016-2017 Young W. Lim. Permission is grnted to copy, distribute nd/or modify this document under the terms of the GNU Free Documenttion License, Version 1.2 or ny lter version published
More informationProblem Final Exam Set 2 Solutions
CSE 5 5 Algoritms nd nd Progrms Prolem Finl Exm Set Solutions Jontn Turner Exm - //05 0/8/0. (5 points) Suppose you re implementing grp lgoritm tt uses ep s one of its primry dt strutures. Te lgoritm does
More informationGreedy Algorithm. Algorithm Fall Semester
Greey Algorithm Algorithm 0 Fll Semester Optimiztion prolems An optimiztion prolem is one in whih you wnt to fin, not just solution, ut the est solution A greey lgorithm sometimes works well for optimiztion
More informationFinal Exam Review F 06 M 236 Be sure to look over all of your tests, as well as over the activities you did in the activity book
inl xm Review 06 M 236 e sure to loo over ll of your tests, s well s over the tivities you did in the tivity oo 1 1. ind the mesures of the numered ngles nd justify your wor. Line j is prllel to line.
More informationCOMP 423 lecture 11 Jan. 28, 2008
COMP 423 lecture 11 Jn. 28, 2008 Up to now, we hve looked t how some symols in n lphet occur more frequently thn others nd how we cn sve its y using code such tht the codewords for more frequently occuring
More informationReducing a DFA to a Minimal DFA
Lexicl Anlysis - Prt 4 Reducing DFA to Miniml DFA Input: DFA IN Assume DFA IN never gets stuck (dd ded stte if necessry) Output: DFA MIN An equivlent DFA with the minimum numer of sttes. Hrry H. Porter,
More information3D convex hulls. Convex Hull in 3D. convex polyhedron. convex polyhedron. The problem: Given a set P of points in 3D, compute their convex hull
Convex Hull in The rolem: Given set P of oints in, omute their onvex hull onvex hulls Comuttionl Geometry [si 3250] Lur Tom Bowoin College onvex olyheron 1 2 3 olygon olyheron onvex olyheron 4 5 6 Polyheron
More informationTroubleshooting. Verify the Cisco Prime Collaboration Provisioning Installation (for Advanced or Standard Mode), page
Trouleshooting This setion explins the following: Verify the Ciso Prime Collortion Provisioning Instlltion (for Advned or Stndrd Mode), pge 1 Upgrde the Ciso Prime Collortion Provisioning from Smll to
More informationCS 551 Computer Graphics. Hidden Surface Elimination. Z-Buffering. Basic idea: Hidden Surface Removal
CS 55 Computer Grphis Hidden Surfe Removl Hidden Surfe Elimintion Ojet preision lgorithms: determine whih ojets re in front of others Uses the Pinter s lgorithm drw visile surfes from k (frthest) to front
More informationParadigm 5. Data Structure. Suffix trees. What is a suffix tree? Suffix tree. Simple applications. Simple applications. Algorithms
Prdigm. Dt Struture Known exmples: link tble, hep, Our leture: suffix tree Will involve mortize method tht will be stressed shortly in this ourse Suffix trees Wht is suffix tree? Simple pplitions History
More informationExample: 2:1 Multiplexer
Exmple: 2:1 Multiplexer Exmple #1 reg ; lwys @( or or s) egin if (s == 1') egin = ; else egin = ; 1 s B. Bs 114 Exmple: 2:1 Multiplexer Exmple #2 Normlly lwys include egin nd sttements even though they
More informationCompilers. Topic 4. The Symbol Table and Block Structure PART II. Mick O Donnell: Alfonso Ortega:
Compilers Topi 4 The ol Tle nd Blok Struture PART II Mik O Donnell: mihel.odonnell@um.es Alfonso Orteg: lfonso.orteg@um.es Topi 2: Blok Struture 2 1 ol tles with lok strutures Blok Struture Progrmming
More informationINTEGRATED WORKFLOW ART DIRECTOR
ART DIRECTOR Progrm Resoures INTEGRATED WORKFLOW PROGRAM PLANNING PHASE In this workflow phse proess, you ollorte with the Progrm Mnger, the Projet Mnger, nd the Art Speilist/ Imge Led to updte the resoures
More informationCompilers Spring 2013 PRACTICE Midterm Exam
Compilers Spring 2013 PRACTICE Midterm Exm This is full length prctice midterm exm. If you wnt to tke it t exm pce, give yourself 7 minutes to tke the entire test. Just like the rel exm, ech question hs
More information5 ANGLES AND POLYGONS
5 GLES POLYGOS urling rige looks like onventionl rige when it is extene. However, it urls up to form n otgon to llow ots through. This Rolling rige is in Pington sin in Lonon, n urls up every Friy t miy.
More informationCompiling a Parallel DSL to GPU
Compiling Prllel DSL to GPU Rmesh Nrynswmy Bdri Gopln Synopsys In. Synopsys 2012 1 Agend Overview of Verilog Simultion Prllel Verilog Simultion Algorithms Prllel Simultion Trdeoffs on GPU Chllenges Synopsys
More informationComputational geometry
Leture 23 Computtionl geometry Supplementl reding in CLRS: Chpter 33 exept 33.3 There re mny importnt prolems in whih the reltionships we wish to nlyze hve geometri struture. For exmple, omputtionl geometry
More informationCS 340, Fall 2016 Sep 29th Exam 1 Note: in all questions, the special symbol ɛ (epsilon) is used to indicate the empty string.
CS 340, Fll 2016 Sep 29th Exm 1 Nme: Note: in ll questions, the speil symol ɛ (epsilon) is used to indite the empty string. Question 1. [10 points] Speify regulr expression tht genertes the lnguge over
More informationMITSUBISHI ELECTRIC RESEARCH LABORATORIES Cambridge, Massachusetts. Introduction to Matroids and Applications. Srikumar Ramalingam
Cmrige, Msshusetts Introution to Mtrois n Applitions Srikumr Rmlingm MERL mm//yy Liner Alger (,0,0) (0,,0) Liner inepenene in vetors: v, v2,..., For ll non-trivil we hve s v s v n s, s2,..., s n 2v2...
More informationWORKSHOP 8A TENSION COUPON
WORKSHOP 8A TENSION COUPON WS8A-2 Workshop Ojetives Buil the tension oupon geometry Control the mesh y using tehniques isusse in lss Compre FEA stress results to theoretil results From Stress Conentrtion
More informationV = set of vertices (vertex / node) E = set of edges (v, w) (v, w in V)
Definitions G = (V, E) V = set of verties (vertex / noe) E = set of eges (v, w) (v, w in V) (v, w) orere => irete grph (igrph) (v, w) non-orere => unirete grph igrph: w is jent to v if there is n ege from
More informationQuiz2 45mins. Personal Number: Problem 1. (20pts) Here is an Table of Perl Regular Ex
Long Quiz2 45mins Nme: Personl Numer: Prolem. (20pts) Here is n Tle of Perl Regulr Ex Chrcter Description. single chrcter \s whitespce chrcter (spce, t, newline) \S non-whitespce chrcter \d digit (0-9)
More information10.5 Graphing Quadratic Functions
0.5 Grphing Qudrtic Functions Now tht we cn solve qudrtic equtions, we wnt to lern how to grph the function ssocited with the qudrtic eqution. We cll this the qudrtic function. Grphs of Qudrtic Functions
More informationA matching algorithm for measuring the structural similarity between an XML document and a DTD and its applications $
Informtion Systems 29 (2004) 23 46 A mthing lgorithm for mesuring the struturl similrity etween n XML oument n DTD n its pplitions $ Elis Bertino, Giovnn Guerrini, Mro Mesiti, * Diprtimento i Informti
More informationInternet Routing. IP Packet Format. IP Fragmentation & Reassembly. Principles of Internet Routing. Computer Networks 9/29/2014.
omputer Networks 9/29/2014 IP Pket Formt Internet Routing Ki Shen IP protool version numer heder length (words) for qulity of servie mx numer remining hops (deremented t eh router) upper lyer protool to
More informationLoop Shifting and Compaction for the High-Level Synthesis of Designs with Complex Control Flow
Shifting n Comption for the High-Level Synthesis of Designs with Complex Control low Sumit Gupt Nikil Dutt Rjesh Gupt Alexnru Niolu Center for Emee Computer Systems Shool of Informtion n Computer Siene
More informationLecture 8: Graph-theoretic problems (again)
COMP36111: Advned Algorithms I Leture 8: Grph-theoreti prolems (gin) In Prtt-Hrtmnn Room KB2.38: emil: iprtt@s.mn..uk 2017 18 Reding for this leture: Sipser: Chpter 7. A grph is pir G = (V, E), where V
More informationLecture 10 Evolutionary Computation: Evolution strategies and genetic programming
Lecture 10 Evolutionry Computtion: Evolution strtegies nd genetic progrmming Evolution strtegies Genetic progrmming Summry Negnevitsky, Person Eduction, 2011 1 Evolution Strtegies Another pproch to simulting
More informationWORKSHOP 19 GLOBAL/LOCAL MODELING USING FEM FIELDS
WORKSHOP 19 GLOBAL/LOCAL MODELING USING FEM FIELDS WS19-1 WS19-2 Prolem Desription This exerise is use to emonstrte how to mp isplement results from the nlysis of glol(overll) moel onto the perimeter of
More informationGenerating Editors for Direct Manipulation of Diagrams
Generting Eitors for Diret Mnipultion of Digrms Gerhr Viehstet n Mrk Mins Lehrstuhl für Progrmmiersprhen Universität Erlngen-Nürnerg Mrtensstr. 3, 91058 Erlngen, Germny E-mil: fviehste,minsg@informtik.uni-erlngen.e
More informationΕΠΛ323 - Θεωρία και Πρακτική Μεταγλωττιστών
ΕΠΛ323 - Θωρία και Πρακτική Μταγλωττιστών Lecture 3 Lexicl Anlysis Elis Athnsopoulos elisthn@cs.ucy.c.cy Recognition of Tokens if expressions nd reltionl opertors if è if then è then else è else relop
More informationWORKSHOP 8B TENSION COUPON
WORKSHOP 8B TENSION COUPON WS8B-2 Workshop Ojetives Prtie reting n eiting geometry Prtie mesh seeing n iso meshing tehniques. WS8B-3 Suggeste Exerise Steps 1. Crete new tse. 2. Crete geometry moel of the
More informationStack Manipulation. Other Issues. How about larger constants? Frame Pointer. PowerPC. Alternative Architectures
Other Issues Stck Mnipultion support for procedures (Refer to section 3.6), stcks, frmes, recursion mnipulting strings nd pointers linkers, loders, memory lyout Interrupts, exceptions, system clls nd conventions
More informationCS 241. Fall 2017 Midterm Review Solutions. October 24, Bits and Bytes 1. 3 MIPS Assembler 6. 4 Regular Languages 7.
CS 241 Fll 2017 Midterm Review Solutions Octoer 24, 2017 Contents 1 Bits nd Bytes 1 2 MIPS Assemly Lnguge Progrmming 2 3 MIPS Assemler 6 4 Regulr Lnguges 7 5 Scnning 9 1 Bits nd Bytes 1. Give two s complement
More informationIn the last lecture, we discussed how valid tokens may be specified by regular expressions.
LECTURE 5 Scnning SYNTAX ANALYSIS We know from our previous lectures tht the process of verifying the syntx of the progrm is performed in two stges: Scnning: Identifying nd verifying tokens in progrm.
More informationCOSC 6374 Parallel Computation. Non-blocking Collective Operations. Edgar Gabriel Fall Overview
COSC 6374 Prllel Computtion Non-loking Colletive Opertions Edgr Griel Fll 2014 Overview Impt of olletive ommunition opertions Impt of ommunition osts on Speedup Crtesin stenil ommunition All-to-ll ommunition
More informationGraph Contraction and Connectivity
Chpter 14 Grph Contrtion n Connetivity So fr we hve mostly overe tehniques for solving problems on grphs tht were evelope in the ontext of sequentil lgorithms. Some of them re esy to prllelize while others
More informationInternet Routing. Reminder: Routing. CPSC Network Programming
PS 360 - Network Progrmming Internet Routing Mihele Weigle eprtment of omputer Siene lemson University mweigle@s.lemson.eu pril, 00 http://www.s.lemson.eu/~mweigle/ourses/ps360 Reminer: Routing Internet
More informationDr. D.M. Akbar Hussain
Dr. D.M. Akr Hussin Lexicl Anlysis. Bsic Ide: Red the source code nd generte tokens, it is similr wht humns will do to red in; just tking on the input nd reking it down in pieces. Ech token is sequence
More informationLexical Analysis. Amitabha Sanyal. (www.cse.iitb.ac.in/ as) Department of Computer Science and Engineering, Indian Institute of Technology, Bombay
Lexicl Anlysis Amith Snyl (www.cse.iit.c.in/ s) Deprtment of Computer Science nd Engineering, Indin Institute of Technology, Bomy Septemer 27 College of Engineering, Pune Lexicl Anlysis: 2/6 Recp The input
More informationSection 2.3 Functions. Definition: Let A and B be sets. A function (mapping, map) f from A to B, denoted f :A B, is a subset of A B such that
Setion 2.3 Funtions Definition: Let n e sets. funtion (mpping, mp) f from to, enote f :, is suset of suh tht x[x y[y < x, y > f ]] n [< x, y 1 > f < x, y 2 > f ] y 1 = y 2 Note: f ssoites with eh x in
More information4.3 Balanced Trees. let us assume that we can manipulate them conveniently and see how they can be put together to form trees.
428 T FOU 4.3 Blned Trees T BT GOIT IN T VIOU setion work well for wide vriety of pplitions, ut they hve poor worst-se performne. s we hve noted, files lredy in order, files in reverse order, files with
More informationDoubts about how to use azimuth values from a Coordinate Object. Juan Antonio Breña Moral
Douts out how to use zimuth vlues from Coordinte Ojet Jun Antonio Breñ Morl # Definition An Azimuth is the ngle from referene vetor in referene plne to seond vetor in the sme plne, pointing towrd, (ut
More informationCOSC 6374 Parallel Computation. Dense Matrix Operations
COSC 6374 Prllel Computtion Dense Mtrix Opertions Edgr Griel Fll Edgr Griel Prllel Computtion Edgr Griel erminology Dense Mtrix: ll elements of the mtrix ontin relevnt vlues ypilly stored s 2-D rry, (e.g.
More informationPROBLEM OF APOLLONIUS
PROBLEM OF APOLLONIUS In the Jnury 010 issue of Amerin Sientist D. Mkenzie isusses the Apollonin Gsket whih involves fining the rius of the lrgest irle whih just fits into the spe etween three tngent irles
More informationA decision support system prototype for fuzzy multiple objective optimization
EUSFLAT - LFA A eision support system prototype for fuzzy multiple ojetive optimiztion Fengjie Wu Jie Lu n Gungqun Zhng Fulty of Informtion Tehnology University of Tehnology Syney Austrli E-mil: {fengjiewjieluzhngg}@it.uts.eu.u
More informationEnterprise Digital Signage Create a New Sign
Enterprise Digitl Signge Crete New Sign Intended Audiene: Content dministrtors of Enterprise Digitl Signge inluding stff with remote ess to sign.pitt.edu nd the Content Mnger softwre pplition for their
More informationAvocado: A Distributed Virtual Reality Framework
Avodo: A Distriuted Virtul Relity Frmework Henrik Trmerend GMD - Germn Ntionl Reserh Center for Informtion Tehnology henrik.trmerend@gmd.de Astrt We present Avodo, our ojet-oriented frmework for the development
More information10/9/2012. Operator is an operation performed over data at runtime. Arithmetic, Logical, Comparison, Assignment, Etc. Operators have precedence
/9/22 P f Performing i Si Simple l Clcultions C l l ti with ith C#. Opertors in C# nd Opertor Precedence 2. Arithmetic Opertors 3. Logicl Opertors 4. Bitwise Opertors 5. Comprison Opertors 6. Assignment
More informationTo access your mailbox from inside your organization. For assistance, call:
2001 Ative Voie, In. All rights reserved. First edition 2001. Proteted y one or more of the following United Sttes ptents:,070,2;,3,90;,88,0;,33,102;,8,0;,81,0;,2,7;,1,0;,90,88;,01,11. Additionl U.S. nd
More informationWORKSHOP 3 FRAME MODEL CREATION USING CURVES, AND ANALYSIS
WORKSHOP 3 FRAME MODEL CREATION USING CURVES, AND ANALYSIS WS3-1 WS3-2 Workshop Ojetives Moel simple frme struture using geometri urves n 1D Br elements. The frme moel is to e onstrine using pin restrints,
More informationCMPSC 470: Compiler Construction
CMPSC 47: Compiler Construction Plese complete the following: Midterm (Type A) Nme Instruction: Mke sure you hve ll pges including this cover nd lnk pge t the end. Answer ech question in the spce provided.
More informationLAB L Hardware Building Blocks
LAB L Hrdwre Building Blocks Perform the following groups of tsks: LL1.v 1. In previous l we creted the 2-to-1 mux shown in the left prt of the figure elow nd found tht it cts s n if sttement. c c 0 1
More information