CS101
532
CS201
225
CS301
232
CS302
174
CS304
192
CS401
224
CS402
258
CS403
228
CS408
113
CS411
121
CS502
249
CS504
268
CS601
679
CS604
381
CS605
261
CS607
184
CS609
230
CS610
300
CS614
100
CS703
65
Code | Question | Option A | Option B | Option C | Option D | Answer | |
---|---|---|---|---|---|---|---|
CS601 | A Bridge Never Forwards Frames Out Of The Port | Root | Designated | Blocking | Forwarding | C | |
CS601 | A Cable Break In A Topology Stops All Transmission | Mesh | Star | Primary | Bus | B | |
CS601 | A Can Forward Or Block Messages Based On The Information In The Message Itself | Message Digest | Proxy Firewall | Packet-Filter Firewall | Private Key | B | |
CS601 | A Can Forward Or Block Packets Based On The Information In The Network Layer And Transport Layer Headers | Proxy Firewall | Message Digest | Packet-Filter Firewall | Private Key | C | |
CS601 | A Can Learn About Network By Sending Out A Router-Solicitation Packet | Router; Routers | Router; Hosts | Host; Routers | Host; Hosts | C | |
CS601 | A Certifies The Binding Between A Public Key And Its Owner | Kdc | Tls | Ca | Firewall | C | |
CS601 | A Changes The Format Of A High-Bandwidth Video Signal To A Lower-Quality Narrow-Bandwidth Signal | Timestamp | Sequence Number | Mixer | Translator | D | |
CS601 | A Cipher Is | An Encryption Algorithm | A Decryption Algorithm | A Private Key | (A) Or (B) | D | |
CS601 | A Client Issues When It Needs Service From A Server | An Active Request | A Finite Open | An Active Open | A Passive Open | C | |
CS601 | A Client Machine Usually Needs To Send Email | Only Pop | Both Smtp And Pop | Only Smtp | None Of The Above | C | |
CS601 | A Connection Provides A Dedicated Link Between Two Devices | Multipoint | Point-To-Point | Primary | Secondary | B | |
CS601 | A Connectionless Iterative Server Uses Ports | Well-Known | Ephemeral | Active | (A) And (B) | A | |
CS601 | A Connection-Oriented Concurrent Server Uses Ports | Well-Known | Ephemeral | Active | (A) And (B) | D | |
CS601 | A Datagram Is Fragmented Into Three Smaller Datagrams. Which Of The Following Is True? | The Do Not Fragment Bit Is Set To 1 For All Three Datagrams | The Identification Field Is The Same For All Three Datagrams | The More Fragment Bit Is Set To 0 For All Three Datagrams | The Offset Field Is The Same For All Three Datagrams | B | |
CS601 | A Device Called A(N) Allows Frames From An Atm Network To Be Transmitted Across A Frame Relay Network | Frad | Lmi | Vofr | Dlci | A | |
CS601 | A Dns Response Is Classified As If The Information Comes From A Cache Memory | Authoritative | Recursive | Unauthoritative | Iterative | C | |
CS601 | A Dns Server Creates Maintains And Updates The Zone File | Root | Primary | Secondary | All The Above | B | |
CS601 | A Dns Server Gets Its Data From Another Dns Server | Root | Primary | Secondary | All The Above | C | |
CS601 | A Dns Servers Zone Is The Entire Dns Tree | Secondary | Root | Primary | All The Above | B | |
CS601 | A Flow-Based Qos Model Designed For Ip Is Called | Rsvp | Integrated Services | Differentiated Services | Multicast Trees | B |