CT PET-2018 Part - B Phd COMPUTER APPLICATION Sample Question Paper

Similar documents
SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY :: PUTTUR (AUTONOMOUS) Siddharth Nagar, Narayanavanam Road QUESTION BANK (DESCRIPTIVE)

Princess Nora University Faculty of Computer & Information Systems ARTIFICIAL INTELLIGENCE (CS 370D) Computer Science Department

SEARCH TREE. Generating the children of a node

SEARCH SEARCH TREE. Node: State in state tree. Root node: Top of state tree

- 2 - Companion Web Site. Back Cover. Synopsis

CS Lecture 5. Vidroha debroy. Material adapted courtesy of Prof. Xiangnan Kong and Prof. Carolina Ruiz at Worcester Polytechnic Institute

DESIGN AND ANALYSIS OF ALGORITHMS (DAA 2017)

CSE 3401: Intro to AI & LP Uninformed Search II

Problem Solving as Search - I

ACCURATE PRESSURE MEASUREMENT FOR STEAM TURBINE PERFORMANCE TESTING

FireHawk M7 Interface Module Software Instructions OPERATION AND INSTRUCTIONS

Problem Solving Agents

PC-based systems ELOP II-NT

Uninformed search methods

Number Bases LESSON ONE By John Owen. Computer Science

Uninformed search methods

Representation. Representation. Representation. Representation. 8 puzzle.

Configuring Bidirectional Forwarding Detection for BGP

1.1 The size of the search space Modeling the problem Change over time Constraints... 21

CS 4649/7649 Robot Intelligence: Planning

Reduction of Bitstream Transfer Time in FPGA

Data Sheet T 8389 EN. Series 3730 and 3731 Types , , , and. EXPERTplus Valve Diagnostic

Project: OpenDRIVE Document No. Issue: Title: Style Guide For OpenDRIVE Databases VI C. Date: 05 th March 2014 no.

VLSI Design 12. Design Styles

Pedestrian Dynamics: Models of Pedestrian Behaviour

Distributed Control Systems

CONTROL VALVE TESTING

GOLOMB Compression Technique For FPGA Configuration

Performance Visualization of Bubble Sort in Worst Case Using R Programming in Personal Computer

Better Search Improved Uninformed Search CIS 32

Synchronous Sequential Logic. Topics. Sequential Circuits. Chapter 5 Steve Oldridge Dr. Sidney Fels. Sequential Circuits

Certification Exhibit FCC ID: R7PIWRS4. FCC Rule Part: ACS Report Number: W03.11.A

Flyweight Pattern. Flyweight: Intent. Use sharing to support large numbers of fine-grained objects efficiently. CSIE Department, NTUT Chien-Hung Liu

LT GasAnalyzer. LT GasAnalyzer Page 1 of 6

Courseware Sample F0

Modeling of Hydraulic Hose Paths

S.M.A.R.T.S. Stimulation Monitoring and Reservoir Testing Software tm

Comp115: Databases. Relational Algebra

Using MATLAB with CANoe

THE CANDU 9 DISTRffiUTED CONTROL SYSTEM DESIGN PROCESS

PropaGator Autonomous Surface Vehicle

Oxygen Meter User Manual

Solving Problems by Searching chap3 1. Problem-Solving Agents

Race Screen: Figure 2: Race Screen. Figure 3: Race Screen with Top Bulb Lock

Drag racing system HL190 User Manual and installation guide

The Cooperative Cleaners Case Study: Modelling and Analysis in Real-Time ABS

CMPUT680 - Winter 2001

CSE 3402: Intro to Artificial Intelligence Uninformed Search II

The MQ Console and REST API

AC : MEASUREMENT OF HYDROGEN IN HELIUM FLOW

Series 3730 and Series 3731 EXPERTplus Valve Diagnostics with Partial Stroke Test (PST)

Volume A Question No : 1 You can monitor your Steelhead appliance disk performance using which reports? (Select 2)

DAV CENTENARY COLLEGE, FARIDABAD

Integrating Best of Breed Outage Management Systems with Mobile Data Systems. Abstract

Computational Models: Class 6

Operating Instructions EB EN. Series 373x Electropneumatic Positioner Type 373x-5 EXPERT + with FOUNDATION fieldbus communication

Technology. In the My Files [My Files] submenu you can store all the programs that you have made on the NXT or downloaded from your computer.

Algorithms and Data Structures

KISSsoft 03/2016 Tutorial 9

Artificial Intelligence. Uninformed Search Strategies

Fast Floating Point Compression on the Cell BE Processor

An Efficient Code Compression Technique using Application-Aware Bitmask and Dictionary Selection Methods

Search I. Tuomas Sandholm Carnegie Mellon University Computer Science Department. [Read Russell & Norvig Chapter 3]

G53CLP Constraint Logic Programming

Studying Vault Board Behavior: A Preliminary Look

Application Notes. SLP85xD Load Cells

Bulgarian Olympiad in Informatics: Excellence over a Long Period of Time

Training Fees 3,400 US$ per participant for Public Training includes Materials/Handouts, tea/coffee breaks, refreshments & Buffet Lunch.

A 64 Bit Pipeline Based Decimal Adder Using a New High Speed BCD Adder

The system design must obey these constraints. The system is to have the minimum cost (capital plus operating) while meeting the constraints.

UNIVERSITY OF WATERLOO

CS472 Foundations of Artificial Intelligence. Final Exam December 19, :30pm

Assignment for Next Class. Information Systems ISM Put In Nonsense, Get Out Chaos. System and Modeling Concepts. Components of a System.

CHEMICAL ENGINEERING LABORATORY CHEG 239W. Control of a Steam-Heated Mixing Tank with a Pneumatic Process Controller

Wade Reynolds 1 Frank Young 1,2 Peter Gibbings 1,2. University of Southern Queensland Toowoomba 4350 AUSTRALIA

Uninformed search methods II.

Study on Resistance of Stepped Hull Fitted With Interceptor Plate

G.L.M. : the on-board stability calculator... DEMONSTRATION OPERATOR S MANUAL

Three-Dimensional Ray-Cast Pong

GOLFER. The Golf Putting Robot

Real World Search Problems. CS 331: Artificial Intelligence Uninformed Search. Simpler Search Problems. Example: Oregon. Search Problem Formulation

Safety Critical Systems

NASCAR Media Group CASE STUDY: LOCATION: Charlotte, NC GOAL: SOLUTION:

Uninformed search methods II.

Application of Dijkstra s Algorithm in the Evacuation System Utilizing Exit Signs

Sontek RiverSurveyor Test Plan Prepared by David S. Mueller, OSW February 20, 2004

sorting solutions osx separator series

Figure SM1: Front panel of the multipatcher software graphic user interface (GUI) at the beginning of multipatcher operation.

Introduction. AI and Searching. Simple Example. Simple Example. Now a Bit Harder. From Hammersmith to King s Cross

SEISMIC CHARACTERIZATION OF THE NOVEMBER 8, 10, AND 11, 1999 DEAD SEA UNDERWATER CHEMICAL CALIBRATION EXPLOSIONS USING CEPSTRAL MODELING AND INVERSION

Industrial Compressor Controls Standard Custom

PREAMBLE. Why the Informatics Olympiad in Team were born

Transposition Table, History Heuristic, and other Search Enhancements

Real-Time & Embedded Systems

Syntax and Parsing II

Conflating a Traffic Model Network With a Road Inventory. David Knudsen

VLSI Design 14. Memories

Self-Organizing Signals: A Better Framework for Transit Signal Priority

29th Monitoring Research Review: Ground-Based Nuclear Explosion Monitoring Technologies

Queue analysis for the toll station of the Öresund fixed link. Pontus Matstoms *

Transcription:

CT PET-2018 Part - B Phd COMPUTER APPLICATION Sample Question Paper Note: All Questions are compulsory. Each question carry one mark. 1. Error detection at the data link layer is achieved by? [A] Bit stuffing [B] Cyclic redundancy codes [C] Hamming codes [D] Equalization 2.Which data communication method is used to transmit the data over a serial communication link? [A] Simplex [B] Half-duplex [C] Full duplex [D] All of above 3.In communication satellite, multiple repeaters are known as? [A] Detectors [B] Modulators [C] Stations [D] Transponders 4. Protocols are? [A] Agreements on how communication components and DTE's are to communicate [B] Logical communication channels for transferring data [C] Physical communication channels sued for transferring data [D] None of above 5. Loss in signal power as light travels down the fiber is called? [A] Attenuation [B] Propagation [C] Scattering [D] Interruption 6. The part of machine level instruction,which tells the central processor what has to be done, is [A]. Operation code [B]. Address [C]. Locator [D]. Flip-Flop 7. Which of the following refers to the associative memory? [A]. the address of the data is generated by the CPU [B]. [C]. the address of the data is supplied by the users there is no need for an address i.e. the data is used as an address the data are accessed [D]. sequentially 8. To avoid the race condition, the number of processes that may be simultaneously inside their critical section is [A]. 8 [B]. 1 [C]. 16 [D]. 0 9. A system program that combines the separately compiled modules of a program into a form suitable for execution

[A]Assembler [B]linking order [c]crosscompiler [D] load and go 10. If x is an array of interger, then the value of &x[i] is same as [A]. &x[i-1] + size of (int) [B]. x + size of (int) * i [C]. x+i [D]. none of these 11. If S is an array of 80 characters, then the value assigned to S through the statement scanf("%s",s) with input 1 2 3 4 5 would be [A]. "12345" [B]. [C]. [D]. nothing since 12345 is an integer S is an illegal name for string %s cannot be used for reading in values of S 12.Data structure suitable for an application discussed in? [A] data design [B] architectural design [C] procedural design [D] interface design 13.Which of the following is minimum error code? [A] Octal code [B] Grey code [C] Binary code [D] Excess 3 code 14.Popular application flip-flop are? [A] Counters [B] Shift registers [C] Transfer registers [D] All of above 15.SR Flip flop can be converted to T- type flip-flop if? [A] S is connected to Q [B] R is connected to Q [C] Both S and R areshortend [D] S and R are connected to Q and Q' respectively 16.Register is a? [A] Set of capacitor used to register input instructions in a digital computer [B] Set of paper tapes and cards put in a file [C] Temporary storage unit within the CPU having dedicated or general purpose use [D] Part of the auxiliary memory 17.For which of the following flip-flop the output clearly defined for all combinations of two inputs? [A] Q type flip-flop [B] R S type flip-flop [C] J K flip-flop [D] T flip-flop 18.An association of several structure of a data base can be expressed graphically by? [A] Tuple [B] Record [C] Relationship [D] Field 19.In an object oriented model, one object can access data of another object by passing? [A] Instance variable [B] Variable [C] Message [D] Function

20.The concept of data independence is similar to the concept of? [A] Data Type [B] Abstract data type [C] Consolidation [D] Isolation 21.How is it possible that both programs and data can be stored on the same floppy disk? [A] Floppy disks can only store data, not programs [B] Programs and data are both software, and both can be stored on any memory device [C] A floppy disk has to be formatted for one or for the other [D] A floppy disks has two sides, one for data and one for program 22.The initial configuration of the queue is a,b,c,d (a is the front end). To get the configuration d,c,b,a one needs a minimum of? [A] 2 deletions and 3 additions [B] 3 additions and 2 deletions [C] 3 deletions and 3 additions [D] 3 deletions and 4 additions 23.Linked list are not suitable data structure of which one of the following problems? [A] Insertion sort [B] Binary search [C] Radix sort [D] Polynomial manipulation 24.Which of the following statement is true? [A] Optimal binary search tree construction can be performed efficiently using dynamic programming. [B] Breath first search cannot be used to find converted components of a graph. [C] Given the prefix and post fix walks over a binary tree.the binary tree cannot be uniquely constructe [D] Depth first search can be used to find connected components of a graph. 25.Given two sorted lists of size m and n respectively.the number of comparisons needed in the worst case by the merge sort algorithm will be? [A] mn [B] max(m,n) [C] min(m,n) [D] m+n-1 26.Merge sort uses? [A] Divide and conquer strategy [B] Backtracking approach [C] Heuristic search [D] Greedy approach 27.A vertex of degree one is called [A] padent [B] isolated vertex [C] null vertex [D] colored vertex 28.Which of the following is useful in traversing a given graph by breadth first search? [A] Stack [B] Set [C] List [D] Queue

29.Which of the following derivation a top-down parser use while parsing an input string? The input is assumed to be scanned in left to right order? [A] Leftmost derivation [B] Leftmost derivation traced out in reverse [C] Rightmost derivation [D] Rightmost derivation traced out in reverse 30.Macro processor is an inbuilt function of? [A] Loader [B] Editor [C] Linker [D] Assembler 31.Forward reference table(frt) is arranged like? [A] Stack [B] Queue [C] Linked list [D] Double linked list 32.Which of the following derivation a top-down parser use while parsing an input string? The input is assumed to be scanned in left to right order? [A] Leftmost derivation [B] Leftmost derivation traced out in reverse [C] Rightmost derivation [D] Rightmost derivation traced out in reverse 33.The phenomenon of having a continuous glow of beam on the screen even after it is removed is called? [A] Fluorescence [B] Persistence [C] Phosphorescence [D] Incandescence 34.The perspective anomaly in which the object behind the center of projection is projected upside down and backward onto the view plane is called? [A] Perspective foreshortening [B] Vanishing view [C] View Confusion [D] Topological distortion 35. A queue is implemented using an array such that ENQUEUE and DEQUEUE operations are performed efficiently. Which one of the following statements is CORRECT (n refers to the number of items in thequeue)? [A] Both operations can be performed in O(1)time [B] At most one operation can be performed in O(1) time but the worst case time for the other operation will beω(n) [C] The worst case time complexity for both operations will beω(n) [D] Worst case time complexity for both operations will be Ω(logn) 36. Let G be a weighted connected undirected graph with distinct positive edge weights. If every edge weight is increased by the same value, then which of the following statements is/are TRUE? P: Minimum spanning tree of G does not change Q: Shortest path between any pair of vertices does not change [A] P only [B ]Q only [C] Neither P norq [D] Both P andq

37. Which of the following languages is generated by the givengrammar? S as bs ε [A] {a n b m n,m 0} [B] {w {a,b} whasequalnumberofa sand b s} [C] {a n n 0} {b n n 0} {a n b n n 0} [D] {a,b} 38. Which of the following is NOT a superkey in a relational schema with attributesv, W, X, Y, Z and primary key V Y? [A]VXYZ [B]VWXZ [C]VWXY [D]VWXYZ 40.What will be the output of the following Cprogram? voidcount(int n) { static int d=1; printf("%d ",n); printf("%d ",d); d++; if(n>1) count(n-1); printf("%d ",d); } void main(){ count(3); } [A] 3 1 2 2 1 3 4 4 4 [B] 3 1 2 1 1 1 2 2 2 [C] 3 1 2 2 1 3 4 [D] 3 1 2 1 1 1 2 39.Which of the following is/are example(s) of stateful application layer protocols? (i) HTTP (ii) FTP (iii) TCP (iv) POP3 [A] (i) and (ii)only [B] (ii) and (iii)only [C] (ii) and (iv)only [D](iv)only