Skip to main content

CS506 Current Midterm Paper Fall 2013 File 14



by zeemal on December 27, 2013 at 11:54am
AOA guyz here is my cs506 midterm paper dated 26th Dec,2013 at 12 pm
MCQs were ez and 2 to 3 were different:
HTTP lies in ------------
Transport layer
Presentation layer
Network layer
application layer
Rowsets are in ------------------- package
java.awt
java.util
javax.swing
java.sql
Q1: differentiate b/w PrintWriter and BufferedReader w.r.t their data conversion abilities 2 marks
Q2: what command or method is used to move to a specific row in resultset to get some data? 2 marks
Q3: What java paint methods would be called and in what order for there is a JPanel and a triangle drawn on       it and a Button is painted? 3 mrks
Q4: Write 3  limitations  of default ResultSet? 3marks
Q5: Write the steps o create the complete steps for making connection ad getting data from a able in          database? 5 marks
Q6: Complete the code for establishing connection and send and receive message code of the Server  side . client sends two numbers in a single string to the server and the server sends the sum of these       no.s in a single string. 5 marks
Stay Blessed and remember me in ur prayerz!!!!
Labels:

Comments

Post a Comment

Please give us your feedback & help us to improve this site.

Popular posts from this blog

CS301 Current Finalterm Paper Spring 2014 Shared By M. Waleed

My Tday's Cs301 Paper: Mcq's Are From Moaz And Some Are From Handouts. Subjective Is From Moaz Majority One. 1- The Image Segmentation Define? 2- The Maximum Number Level Of Nodes In Binary Tree 3-The Iteration Array Have To Sort. 4- The Hapified Array Have To Solved 5- The Algorithm Of Binary Seaoh Tree 6-Sara Arrays Wala He Tha Ya Heap Wala. 7-....Wala Wala Wala...
1 comment
Read more

CS614 Quiz No.3 Shared by Students (Solved), Spring 2014

______ index stores first value in each block in the sequential file and a pointer to the block.  Select correct option:   Dense  Sparse  B-Tree  Hash In context of data parallelism, the work done by query processor should be:  Select correct option:  Almost zero  Maximum  Pipelined  Filtered across partitions The optimizer uses a hash join to join two tables if they are joined using an equijoin and  Select correct option:   Outer table has less number of rows  Inner table has less number of rows  Cardinality of tables is equal  Large amount of data needs to be joined Bitmap index is appropriate for:  Select correct option:  Low cardinality data  High cardinality data  Clustered data  Aggregated data If a task takes “T” time units to execute on a single data item, then execution of this task on “N” data items will take __...
Post a Comment
Read more

CS301 Quiz No.2 Shared by Tayyeba

Binary search algorithm can not be applied to ____ Select correct option: sorted linked list sorted binary trees        ok sorted linear array pointer array During in-order traversal using recursive calls, if we found a node is NULL. It means this node will satisfy following condition. Select correct option: It will not have left child        ok It will not have right child It will not have both left and right children None of given options Identify the data structure which allows deletions at both ends of the list but insertion at only one end. Select correct option: Input-restricted deque Output-restricted deque Priority queues        ok A BST generated from the data in ascending order is ____________. Select correct option: Linear Nonlinear Balanced        ok Un sorted In a program a reference variable, say x, can be declared as Sele...
1 comment
Read more