Graduate Assessment Test (Sample)

Similar documents
Java Application Developer Certificate Program Competencies

Binary Search Trees (BST)

Algorithms and Data Structures Written Exam Proposed SOLUTION

Ordered Lists and Binary Trees

10CS35: Data Structures Using C

Data Structures and Algorithms

Output: struct treenode{ int data; struct treenode *left, *right; } struct treenode *tree_ptr;

Database Applications Recitation 10. Project 3: CMUQFlix CMUQ s Movies Recommendation System

Java EE Web Development Course Program

Java CPD (I) Frans Coenen Department of Computer Science

PES Institute of Technology-BSC QUESTION BANK

Data Structure [Question Bank]

Data Structure with C

DATA STRUCTURES USING C

Supplement IV.C: Tutorial for Oracle. For Introduction to Java Programming By Y. Daniel Liang

Java the UML Way: Integrating Object-Oriented Design and Programming

ALLIED PAPER : DISCRETE MATHEMATICS (for B.Sc. Computer Technology & B.Sc. Multimedia and Web Technology)

Summit Public Schools Summit, New Jersey Grade Level / Content Area: Mathematics Length of Course: 1 Academic Year Curriculum: AP Computer Science A

root node level: internal node edge leaf node Data Structures & Algorithms McQuain

Questions 1 through 25 are worth 2 points each. Choose one best answer for each.

A TOOL FOR DATA STRUCTURE VISUALIZATION AND USER-DEFINED ALGORITHM ANIMATION

USING MYWEBSQL FIGURE 1: FIRST AUTHENTICATION LAYER (ENTER YOUR REGULAR SIMMONS USERNAME AND PASSWORD)

You are to simulate the process by making a record of the balls chosen, in the sequence in which they are chosen. Typical output for a run would be:

Basic Programming and PC Skills: Basic Programming and PC Skills:

Binary Trees and Huffman Encoding Binary Search Trees

Part I. Multiple Choice Questions (2 points each):

Programming Languages CIS 443

AP Computer Science AB Syllabus 1

Binary Search Trees CMPSC 122

RARITAN VALLEY COMMUNITY COLLEGE ACADEMIC COURSE OUTLINE. CISY 105 Foundations of Computer Science

AP Computer Science Java Subset

Configuring a BEC 7800TN Wireless ADSL Modem

COURSE TITLE COURSE DESCRIPTION

Chapter 5. Regression Testing of Web-Components

Quiz 4 Solutions EECS 211: FUNDAMENTALS OF COMPUTER PROGRAMMING II. 1 Q u i z 4 S o l u t i o n s

Chapter 14 The Binary Search Tree

1) The postfix expression for the infix expression A+B*(C+D)/F+D*E is ABCD+*F/DE*++

The English translation Of MBA Standard 0301

SQL INJECTION ATTACKS By Zelinski Radu, Technical University of Moldova

Toward A Taxonomy of Techniques to Detect Cross-site Scripting and SQL Injection Vulnerabilities

Compiler Construction

Sample Questions Csci 1112 A. Bellaachia

Curriculum Map. Discipline: Computer Science Course: C++

INTRUSION PROTECTION AGAINST SQL INJECTION ATTACKS USING REVERSE PROXY

A Brief Introduction to MySQL

A binary search tree or BST is a binary tree that is either empty or in which the data element of each node has a key, and:

SourceAnywhere Service Configurator can be launched from Start -> All Programs -> Dynamsoft SourceAnywhere Server.

Introduction to Object-Oriented Programming

Learning Outcomes. COMP202 Complexity of Algorithms. Binary Search Trees and Other Search Trees

Data Structures. Level 6 C Module Descriptor

CS 141: Introduction to (Java) Programming: Exam 1 Jenny Orr Willamette University Fall 2013

Summer Internship 2013

The following themes form the major topics of this chapter: The terms and concepts related to trees (Section 5.2).

Copyright 2013 Consona Corporation. All rights reserved

El Dorado Union High School District Educational Services

VB.NET - WEB PROGRAMMING

1.00 Lecture 1. Course information Course staff (TA, instructor names on syllabus/faq): 2 instructors, 4 TAs, 2 Lab TAs, graders

This example illustrates how to copy contents from one file to another file. This topic is related to the I/O (input/output) of

API for java.util.iterator. ! hasnext() Are there more items in the list? ! next() Return the next item in the list.

White Paper. Blindfolded SQL Injection

Learning Outcomes. Networking. Sockets. TCP/IP Networks. Hostnames and DNS TCP/IP

Functions Recursion. C++ functions. Declare/prototype. Define. Call. int myfunction (int ); int myfunction (int x){ int y = x*x; return y; }

EVALUATION ONLY. WA2088 WebSphere Application Server 8.5 Administration on Windows. Student Labs. Web Age Solutions Inc.

An Overview of Java. overview-1

TREE BASIC TERMINOLOGIES

Recommended readings. Lecture 11 - Securing Web. Applications. Security. Declarative Security

Blindfolded SQL Injection. Written By: Ofer Maor Amichai Shulman

Using Foundstone CookieDigger to Analyze Web Session Management

Course Number: IAC-SOFT-WDAD Web Design and Application Development

The C Programming Language course syllabus associate level

The Tower of Hanoi. Recursion Solution. Recursive Function. Time Complexity. Recursive Thinking. Why Recursion? n! = n* (n-1)!

PORTAL ADMINISTRATION

CSCI 3136 Principles of Programming Languages

Converting a Number from Decimal to Binary

Getting Started with Tableau Server 6.1

MAX = 5 Current = 0 'This will declare an array with 5 elements. Inserting a Value onto the Stack (Push)

CS170 Lab 11 Abstract Data Types & Objects

Java Software Structures

AP Computer Science A - Syllabus Overview of AP Computer Science A Computer Facilities

Model 2.4 Faculty member + student

CS 111 Classes I 1. Software Organization View to this point:

Facebook Twitter YouTube Google Plus Website

How To Let A Lecturer Know If Someone Is At A Lecture Or If They Are At A Guesthouse

Division of Mathematical Sciences

Analysis of Algorithms I: Optimal Binary Search Trees

CompSci-61B, Data Structures Final Exam

SE 360 Advances in Software Development Object Oriented Development in Java. Polymorphism. Dr. Senem Kumova Metin

Web Development in Java

1) Which of the following is a constant, according to Java naming conventions? a. PI b. Test c. x d. radius

Enterprise Application Development Using UML, Java Technology and XML

How To Teach C++ Data Structure Programming

Microsoft SQL Server Installation Guide

7.1 Our Current Model

Java Program Coding Standards Programming for Information Technology

User s Guide. Version 2.1

Handout 1. Introduction to Java programming language. Java primitive types and operations. Reading keyboard Input using class Scanner.

Specialized Programme on Web Application Development using Open Source Tools

Transcription:

Graduate Assessment Test (Sample) CS201-203 1. Fibonacci sequence is defined by a recurrence relation. The series is: 0,1,1,2,3,5,8,13,... Write a complete recursive method/function that returns the fibonacci sequence element for a particular index; int fibonacci(index) 2. Draw a BST (Binary Search Tree) with the following integer values: 60,55,45,57,59,100,67,107,101. Give the sequence of the nodes visited by preorder, postorder and inorder traversal algorithms. 3. Give a suitable class definition of a node in BST. Write a search method/function that determines if the element is present in the BST. CS312 Assessment Test 1. Consider that T(n) = 2T(n/2) +f(n); where f(n)= n². Find a theta notation for T(n) 2. Derive the time complexity (in theta notation) for the number of times the statement x=x+1 is executed j=n while (j>=1) for i=1 to j x= x+1; j=j/2 3. Express the recurrence relation for the Fibonacci sequence (problem #1). What is the solution in O notation. CS386 Assessment Test 1. Give the Regular Expression that describes the set of Strings over (0,1) where every 0 is always followed by a 1 Draw a nondeterministic finite automaton (may use null transitions) 2. Consider the following grammar: <S> a<s>b<s> a<s>b<s>c<s> d Give two distinct derivations on the string: adbadbdcd (Show steps) Based on two distinct derivations, how do you classify this grammar.

3. Using the Chomsky hierarchy of formal languages, (i) name the types of language and (ii) the corresponding automata that accepts the language L = 0 n 10 m 1* m>n where m,n are positive integers Object Oriented Programming Assessment Test (CS202/CS203) GeometricObject class is defined as below: public abstract class GeometricObject private java.util.date datecreated; public GeometricObject() datecreated = new java.util.date(); public java.util.date getdatecreated() return datecreated; public String tostring() return "Created on " + datecreated; public abstract double getsurface(); public abstract double getvolume(); Design and implement Sphere and Cylinder classes that extend GeometricObject: Each class should contain the following methods: A no-argument constructor that creates a default object. A constructor that creates an object with the specified data fields (i.e. radius for a Sphere and radius and height for a Cylinder). Accessor(get) methods for each data field. A method named getsurface( ) that returns the surface area of the object. o Surface Area of a Sphere = 4*PI*(radius^2) o Surface Area of a Cylinder = 2*PI*radius*height A method named getvolume( ) that returns the volume of the object. o Volume of a Sphere = 4/3*PI*(radius^3) o Volume of a Cylinder = PI*(radius^2)*height A method named tostring( ) that returns a string description of the object. The description should contain the name of the shape and its data fields. For example, the tostring( ) method for a Cube should return: Sphere: radius = 6

The following test program creates 5 different geometric objects and stores them in an array type of GeometricObject. Complete the following test program such that it computes surface area and volume of each object sorts the array based on its surface area in descending order outputs a description of the shape using tostring( ) method and outputs the data field (i.e. radius for a sphere), surface area and volume of the object in the sorted order public class GeometricObjectTest public static void main(string[] args) GeometricObject objarray[] = new Sphere(5), new Cylinder(3,2.5), new Sphere(6.3), new Sphere(2.7), new Cylinder(2.1,1.7) ; // compute their surface area and volume // sort them in descending order based on its surface area // display their shape description using tostring( ) method // display their data field (i.e. radius for a sphere), // surface area and volume Web programming Assessment Test (CS320) Complete the following application using any technology. JSP is preferable as its competency is expected for CS520. However, you can implement this application using any other technology for which you need to bring your own laptop. [Introduction] A local ACM Student Chapter has accumulated a sizable collection of technical books over the last few years. Most of the books are about topics such as software development, networking, and program languages, which would interest many students and faculty. However, due to the lack of a proper distribution mechanism, the books are just collecting dust now on the shelves in the ACM office. To rectify this situation, the ACM chapter has chosen a member to be the librarian to manage these books. To make the life of the librarian a little easier, you are going to develop an online book reservation system, using, of course, JSP without scripting elements. With this system, students and faculty can browse and reserve the books that they are interested in online, and later pick up the physical copies of the books at the ACM office. The system also helps the librarian to keep track of the books in the collection. In its simplest form, the online book reservation system consists of a Login page, a User page, a Librarian page, and a backend database.

[Database] The backend database contains the following information: The title and description of each book. The username and password of each user, and whether the user is a librarian or not. The status of each book, which could be, Reserved, or CheckedOut. And for the books that have been reserved (or checked out), the database also keeps track the user who reserved (or checked out) the book. For this part of the exam, you need to turn in a library.sql file which include the statements to create all the tables in the database, and the statements to populate the tables so that there are at least four books in the database, and each table has at least two records. [Login] A user must login to reserve books online. The Login page validates the username and password provided by a user against the information stored in the database. If the authentication is successful, the Login page redirects the user to the User page or the Librarian page based on whether the user is a librarian or not. [User] The User page allows a user to browse, search, and reserve books, as shown below: Search Title Description Status Code Complete Programming C# Java - How to Program Core Servlets and JavaServer Pages Reserve Best practices in the art and science of constructing software. Topics include design, applying good techniques to construction, eliminating errors, planning, managing construction activities, and relating personal character to superior software Programming C# provides an adept and extremely well conceived guide to the C# language and is written for the developer with some previous C++, Java, and/or Visual Basic experience. Enormous, expensive, heavy (I carried it around northern europe for a month so I know this!) and overwrought. Too much bloat and prattle at times. Excellent presentation. May overwhelm a beginner. Intended for developers familiar with Java, this guide explains the role of servlets and JavaServer Pages (JSP) in creating e-commerce sites, dynamic web sites, and web-enabled services. Topics include handling missing data, manipulating HTTP status codes, redirecting requests, setting JavaBean properties, and accessing databases with JDBC. The second edition has been updated to servlets 2.4 and JSP 2.0 CheckedOut Reserved By default the page displays all the books in the database. A user may use the keyword search feature to limit the display to only the books whose title or description contains the keyword.

A user can reserve the books which are currently available. However, the total number of books which are reserved or checked out by the same user cannot be more than 2. For example, a user may reserve at most two books, and if he or she has already reserved or checked out one book, then the user can reserve only one more book. If the reservation fails due to the violation of this rule, an error message should be displayed, and if the reservation succeeds, the status of the reserved books should be changed from to Reserved. [Librarian] The Librarian page allows a librarian to view and update the status of the books through drop-down lists, as shown below: Search Title Status User Code Complete Programming C# CheckedOut cysun Java - How to Program Reserved somebody Core Servlets and JavaServer Pages Update Note that the Librarian page is designed to allow only three kinds of status updates: from CheckedOut to from Reserved to CheckedOut from Reserved to And similar to the User page, the Librarian page also has a keyword search feature, which can be used to limit the display to only the books whose title or description contains the keyword. [Grading Criteria] Database (20pt) Login basic username and password validation (10pt) redirect based on user type (10pt) User search (15pt) display (including proper display of the checkboxes) (20pt) reservation (25pt) Librarian search (10pt) display (including proper display of the drop-down lists) (20pt) update (30pt) final.html is missing or doesn't have the link to your application on the CS server (-10pt) Only features working correctly on the CS server will receive full credit. Partial credit will be given at my discretion. The total of the final is 100pt. Anything above 100 is considered extra credit.