Open navigation menu
Close suggestions
Search
Search
en
Change Language
Upload
Sign in
Sign in
Download free for days
0 ratings
0% found this document useful (0 votes)
195 views
8 pages
BCS 6th Sem Past Papers Karachi University
Uploaded by
muhammadusmanshaikh00
AI-enhanced title
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content,
claim it here
.
Available Formats
Download as PDF or read online on Scribd
Download
Save
Save BCS 6th sem past papers Karachi university For Later
Share
0%
0% found this document useful, undefined
0%
, undefined
Print
Embed
Report
0 ratings
0% found this document useful (0 votes)
195 views
8 pages
BCS 6th Sem Past Papers Karachi University
Uploaded by
muhammadusmanshaikh00
AI-enhanced title
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content,
claim it here
.
Available Formats
Download as PDF or read online on Scribd
Carousel Previous
Carousel Next
Download
Save
Save BCS 6th sem past papers Karachi university For Later
Share
0%
0% found this document useful, undefined
0%
, undefined
Print
Embed
Report
Download
Save BCS 6th sem past papers Karachi university For Later
You are on page 1
/ 8
Search
Fullscreen
ye rtment of Computer Science — 2142-C umputer Net friversity of Karachi . 1 (6° Semester orks Date: 25-1 eb-2021 Max. Marks: 48 cs Iseat NI |igwstnan Nuwar Tati | Instruct Ty Atm all yucstions: Exp rani te di iment lumber the ancwert cat Nuomber and Fare 2)_Dr nut wre on question paper except Mar By Please retuen the question paper lls ith your ave” cri wn 1: (Attempt any Three) aa 1) Define the tenn VLAN? Explain the benefis Of LAN? by Why a router does nt propagate an ene bron” Wentfy th ane of Proxy ARP? ). Define the mecage type defined by TMP? Define re pen of ares va iefined in 1PV6? he rowter has o flow label rves ata rer and he TOU ro igre the fhow abel and forward the Paakt Mt aring the packet, and sending. a Ah) The HPs standard states tht pak wih» ho information for that flow label the router What are the disadv ‘eating this evout a9 ant eT0", ICMP message jon 2: (Attempt any Three) aay 4), Define the term CIDR? What i the role of fag bi define in IPv heads” yreved in IFVG? Diferrdat betwen switching and ating? of Timers define in TCP? the waffie elas and flow label fields inthe TP¥6 beader? «ay Question 3: (Attempt any Three) pes of messages defined by ICMP ae patie tyrouter covery) fragmentation required ctor? Wi i the diff between the term transit and a) explain the followin redirect, by ifferemiate benwcen scoess router v> border esting? «) Mos routing loops ean impoct network performane includes ad network rules? 18) Deseribe some Wireless Network security sex? highlights some major campus Quest ay 1) Describe some circumstances where it mi routers make the routing é2cision? hy Whats the diference betwcen in channel and common channel sigralin packet size in a packet switching nerwork? : 9, Differentiate beeen the flowing (attempt any t 1) Designated Router va Backup designatod router fi) ingress fering v8 egress filter iil) access routers vs border rox iv) FIBs v2 RIBS ight be desirable 19 use source rowing rather than let the What isthe significance of Tage Fiaa. Qs. Qs. wer Use ding the ans ement? After provi hi execution of the following irelse staternent x" after the What will be “x” a switch statement to reverite it. a) What are jagged arrays in java? Give example. b)_ Write a Java Program to find whether a string pers p that reads the same as backward and forward such as "bob”.) ‘or number is palindrome or not. (A palindrome is a word €) Predict the output: class array output ( public static void main(String args{J) { int array variable (J = new int (10J; for (int i= 0; 2 < 10; +44) ( array_variable(i} = i; System.out.print (array_variable[i] + " 2) What do you mean by access modifier in java? Explain with the help of an example. b) What is an Applet? How itis differed from Application? Explain, ©) Why is string class considered as immutable and string buffer as mutable? 3) Define inheritance with respect to Object Oriented Programming? Give an example of inheritance relationship using java, *) Whats static method? Can we declare the static variables and methods in an abstract class? ‘) What is exception? How can you define the runtime exception and arithmetic exception?/ epartment of Computer Science rsity of Karachi Ferminal Examinatio Date: Max, Time: 2 Hours Max, Marks: 48 1) Attempt any FOUR (04) questions. Alt questions carry equal marks: 2) Darnot write on question paper except Name, Seat Number and Enrollment Naber. 5) Please return the question paper along with your answer script a. ‘a) Why java is considered to be one ofthe pioneer languages in the Object Oriented your answer) aligns? Gustify 'b)_ Define different types of variable with the reference to java 1) What is constructor? How many types of constructors are used in java? a2. 'a)_ What is the difference between String s= "Test" and String s= new String("Test"7? Which is better and why? ») to accept a number and check the number is even or not. Print Xf the number is ‘rite a Java program even oF Oif the number is oud What isthe output ofthe following code if number Is 14, 25, oF 30? a if (nunker 2 2 == 0) ysten.out.println nunber +" is eve if (number 15 == 0) system.out .println {number +" is multiple of 5"; ies} if (number § 2 == 0) systen.out.printLn (number ¢" is even"); Af (number t 5 == 0) system.out printin (number +" is multiple of 5"): 'a)_ How can you swap the values of two numeric variables without using any other variables? Justify your +b) Write a program that prompts user fora postive integer. The program shall read the input as int; and print the "reverse" of the input integer. For examples, Frater a positive integer: 12345 The reverse is: 54321 Page 1 of?Department of Computer Science University of Karachi FSanination Paw: 18sebs2021 BCS Programme (6" Semester) Max. Time: 2:00 Hanis Maas, Maths: 60) [ Seat Number: Name: | 2329; Algorithms Ferm | Enrolment Number: College/institute: Testructions 1 Please fill inthe information required above. and retwn this aust 2, Attempt amy FOUR (04) questions inchuding Question Nd. Lwhi $ All questions carry equal marks 4. Start each 4 m1 paper tony with your answer seript his compulsory uestion oN a new page of your answer seript Question 1: (COMPULSORY QUESTION) Write brief and to-the-point answers tothe f ollowing questions 8 What is meant by recursive algorithm? What types of computational problems may’ hotter be solved using recursive algoril b ed 10 8 ‘What are the two types of binary heap? Elaborate with example(s) ‘What is the difference between a directed graph and an unuitected grapl? Provide simple examples for both types of graph, © Is quick-sort really the faster sorting algorithin? How, and w ‘Question 2: Read the following algorithm (pseudocode) carefully: ‘Algo Funnyaigo (N) NteN iN <0 then write 0 else N2eNt N3.@ N=: ‘while N3 > 0 NZ. N2"N1; NB N31; endwhile wnite N2; endif, Endalgo FunnyAlgo Observe the algorithm carefully to mention the purpese for which the algovitinn is des its esymmptotic untime complexity. Question 3: and mention Design a simple algorithm for finding both the smallest clement and the largest element stored in an unsorted array having size N. Your algorithm should return a pair (Min, Max), where Min ig the smallest
Applv(x)]” Truel }False| J 'b) Write FOL statements for the following assertions: Use your own vocabulary of predicates but do state them. A. Shahid is either a surgeon or a lawyer. B. Few surgeons are doctors C. There exists a lawyer all of whose customers are teachers. D. Every surgeon has a lawyer. QUESTION NOs Consider the following search problem: © Which path will each search algorithm return, assuming all successor functions work out in such a way that nodes are explored in alphabetical arder whenever possible? i). A* Search |. Greedy best first Page 2of3Department of Computer Science ——_230K-Intraduetion to Artificial Intelligence University of Karachi Tenninal Examination BCS Program (6 Semester) iow Seat Number: Enroliment Number. [inttte/Colege: = a. Instructions: a + Attempn any FIVE (0S) questions. All questions carry equal marks + Return the question paper along with your answer script Write your Name, College Name, Seat Number and Enrolment Number abo. QUESTION NOL (2) For each of the following assertions, say whether itis true or false and support your answer with examples or counter examples where appropriate. ‘An agent thet senses only partial information about the state cannot be perfectly rational ‘There exist task environments in which no pure reflex agent can behave rationally There exists a task environment in which every agent is rational. The input to an agent program is the same as the input to the agent function, Every agent function is implementable by some program/machine combination, Suppose an agent selects its action unifermly at random from the set of possible actions. There exists a deterministic task environment in which this agent is rational. Iis possible for a given agent to be perfectly rational in two distinet task enviconments. Every agent is rational in an unobservable environment. Prommpne> (b) With reference to the Al i by computers: (any FIVE) Playing a decent game of table tennis (Ping-Pong). Driving in the center of Cairo, Egypt. Buying a week's worth of groceries on the Web, Playing a decent game of bridge at a competitive level Giving competent legal advice in a specialized area of law. Translating spoken English into spoken Swedish in real time. Performing a complex surgical operation. rature to discover whether the following tasks can currently be solved a7 money QUESTION NOZ (a) Define in your own words the following terms (any FOUR) A. State B. state space C. node D. goal E, branching factor (b) To what extent are the following computer systems instances of artificial intelligence: Justify your answer. (any THREE) ‘A. Supermarket bar code scanners. B. Web search engines. C. Voice-activated telephone menus. D. Internet routing algorithms that respond dynamically to the state of the network. QUESTION NO 3 (a) For each of the following activities, give a PEAS description any TWO of the task environment. A. Shopping for used Al books on the Internet, 8. Practicing tennis against a wall Bidding on an item at an auction, Page 1 of 3Department of Computer Science 2107. Datw¢ University of Karachi Fetminal L sain Date 11-Feb-2021 eognane (! Semnestend May, Time: 2 How Mas. Marks: 48 Marks « Nunabe Name stlancnt Nuntver Listinte/Collepe Loseruotions - vy KOUR (OA questions in siven sequence. All question Vane, Seat Number vind Enrotinent Niamber and Coll the question paper along with your answer seript sarry equal marks name Question #1, Loot the cove word OOTEELTG001 100 are corteet, assuming, they were created using an even parity Hamm Code Hit is ineorieet, indicate what the eoreet code word should have been, Also, indicate What the onigttnal data was. bY Dillerentiate between the 15 nsibilitie Reterence Model Name one standards-bay of the datalink layer and the transport layer of the OST ved protocol at eaeh layer Question 2, 2) Consider a data stream TOL TELO0L, Eneode this digital data into digital signal by using INKY 1 ii, Diferential Manchester tii, MLT3 bY Using: BXYS& TIDE, encode the bit stream 100000000000011 10. Assume that the polarity of the Fast Lis po 1) The minimum and the maximum fiequeney limits of a voice grade telephone line are 300Hz and S3001Ly respectively, Phe Signal-to-Noise ratio of the line is 35dB, Clearly indicating all the steps, calculate the theoretically highest bil rate possible on this telephone fine }) A channel has a dats rate of F kbps and a propagation delay of 20 ms. For what range of frame sizes nil-wail give an efficiency of al least 50%? a) .\ periodic composite signal with a bandwidth of 200 Hz is composed of two sine waves. The first one has a fiequency of 100 Hz with maximum amptitute of 20 Volts; the second one has maximum amplitude of § Volts, Draw the fequeney spectrum: b) Discuss the drawbacks of using X, & in response to the drawbacks which technique was designed? Question M5 A Consider a simple telephone network consi (LEME falleduples: unk between Ling of two end offices and one intermediate switch with h end office and the intermediate switeh, Assume a 4-kHz channel for each voice call, The average telephone is used to make four calls per 8-hour workday, with mean call duration of six minutes, Hen percent af the calls are long distance. What is the maximum number of telephones an chd office can support? bb A bro Jeast network is one in whieh a tainsmission from any one attached station is received by all other attached stations ever a shared medium. Examples are a bus-topology local arza network, such as Bthernet, and a wireless radio network, Discuss the need or lack of need for a network layer (OST layer 3) in u broadcast network,
You might also like
Brain Station 23 Question
PDF
67% (3)
Brain Station 23 Question
24 pages
3rd Mid Sem Pyqs
PDF
No ratings yet
3rd Mid Sem Pyqs
14 pages
Dsa Old Question Collection
PDF
No ratings yet
Dsa Old Question Collection
31 pages
Data Structures (5 Years PYQ)
PDF
No ratings yet
Data Structures (5 Years PYQ)
12 pages
Cs 702 Final Term Solved
PDF
No ratings yet
Cs 702 Final Term Solved
19 pages
Dsa 9
PDF
No ratings yet
Dsa 9
18 pages
Solved ISRO Scientist or Engineer Computer Science 2018 Paper With Solutions
PDF
No ratings yet
Solved ISRO Scientist or Engineer Computer Science 2018 Paper With Solutions
24 pages
Majors 2nd Sem
PDF
No ratings yet
Majors 2nd Sem
7 pages
Offline PYQ Paper 2024
PDF
No ratings yet
Offline PYQ Paper 2024
17 pages
3rd Sem - End Term
PDF
No ratings yet
3rd Sem - End Term
8 pages
EEX4465 2022 23 - Final
PDF
No ratings yet
EEX4465 2022 23 - Final
4 pages
Computer Algorithm
PDF
No ratings yet
Computer Algorithm
59 pages
Vatly 9
PDF
No ratings yet
Vatly 9
14 pages
Data Structure Model Papers (Two) 2425
PDF
No ratings yet
Data Structure Model Papers (Two) 2425
6 pages
CS - ISRO Previous Solved Papers
PDF
No ratings yet
CS - ISRO Previous Solved Papers
17 pages
Model Question Paper - PHD Admission Test, CSE, IIT Guwahati
PDF
No ratings yet
Model Question Paper - PHD Admission Test, CSE, IIT Guwahati
4 pages
1st Sem
PDF
No ratings yet
1st Sem
17 pages
Wa0011.
PDF
No ratings yet
Wa0011.
13 pages
Question Papers of Two Year M. Tech I Semester Regular Examinations April - 2013
PDF
No ratings yet
Question Papers of Two Year M. Tech I Semester Regular Examinations April - 2013
49 pages
18 CSC201 Ja
PDF
No ratings yet
18 CSC201 Ja
2 pages
MIT6 034F10 Final 2010
PDF
No ratings yet
MIT6 034F10 Final 2010
49 pages
Vsec Ix Jan 2020
PDF
No ratings yet
Vsec Ix Jan 2020
3 pages
(LASER) BITS WILP Data Structures and Algorithms Design Assignment 2017
PDF
No ratings yet
(LASER) BITS WILP Data Structures and Algorithms Design Assignment 2017
32 pages
PHD Computersc
PDF
No ratings yet
PHD Computersc
19 pages
Final 23-24-1
PDF
No ratings yet
Final 23-24-1
2 pages
CS - 2007 - by WWW - LearnEngineering.in
PDF
No ratings yet
CS - 2007 - by WWW - LearnEngineering.in
18 pages
IT2 Answer Key
PDF
No ratings yet
IT2 Answer Key
4 pages
IT2070 - Data Structures and Algorithms
PDF
No ratings yet
IT2070 - Data Structures and Algorithms
8 pages
ADA1
PDF
No ratings yet
ADA1
9 pages
Algo Final
PDF
No ratings yet
Algo Final
7 pages
DATASTRUCTUREALGORITHMS-2017 3rdsem
PDF
No ratings yet
DATASTRUCTUREALGORITHMS-2017 3rdsem
7 pages
Ds Pyq
PDF
No ratings yet
Ds Pyq
14 pages
5th - Midsem (2023)
PDF
No ratings yet
5th - Midsem (2023)
7 pages
Nana. Anan Capgemini Placement Preparation ALgorithm&DS
PDF
No ratings yet
Nana. Anan Capgemini Placement Preparation ALgorithm&DS
13 pages
IT2070 - Data Structures and Algorithms
PDF
No ratings yet
IT2070 - Data Structures and Algorithms
5 pages
DAA All-Quizzes
PDF
No ratings yet
DAA All-Quizzes
9 pages
CS702 Current Papersfrom 27 Feb 1 Marchupdated
PDF
No ratings yet
CS702 Current Papersfrom 27 Feb 1 Marchupdated
5 pages
2nd Semester PYQ
PDF
No ratings yet
2nd Semester PYQ
10 pages
Mcoa011 Main Exam Paper 2017
PDF
No ratings yet
Mcoa011 Main Exam Paper 2017
10 pages
DATA STRUCTURES - Lateral Entry
PDF
No ratings yet
DATA STRUCTURES - Lateral Entry
4 pages
DSA Model QP
PDF
No ratings yet
DSA Model QP
5 pages
CS133 Final Exam
PDF
No ratings yet
CS133 Final Exam
14 pages
Answer:c: Loop Loo P
PDF
No ratings yet
Answer:c: Loop Loo P
37 pages
Pgcet Cse-2011
PDF
No ratings yet
Pgcet Cse-2011
14 pages
Comp 314 - 2017
PDF
No ratings yet
Comp 314 - 2017
4 pages
Data Structures and Algorithm Analysis 1005
PDF
100% (1)
Data Structures and Algorithm Analysis 1005
22 pages
DS MCQ
PDF
No ratings yet
DS MCQ
9 pages
Assignment 3 PDF
PDF
No ratings yet
Assignment 3 PDF
5 pages
Question Booklet
PDF
No ratings yet
Question Booklet
16 pages
21.2 Algo
PDF
No ratings yet
21.2 Algo
4 pages
Capgemini Reckoner V2.0
PDF
No ratings yet
Capgemini Reckoner V2.0
26 pages
Dsa (10-8-2012)
PDF
No ratings yet
Dsa (10-8-2012)
11 pages
Google Interview Questions
PDF
No ratings yet
Google Interview Questions
9 pages
Yahoo Inc Placement Process Details
PDF
No ratings yet
Yahoo Inc Placement Process Details
12 pages
140 Google Interview Questions
PDF
No ratings yet
140 Google Interview Questions
6 pages