Advertisement

Search Topics....

Friday, July 29, 2011

UGC NET Questions For Computer Science - Paper II

Q. Let e : B^m → B^n is a group code. The minimum distance of ‘e’ is equal to
(A) the maximum weight of a non zero code word
(B) the minimum weight of a non zero code word
(C) m
(D) n


Q. A context free grammar is :
(A) type 0.
(B) type 2.
(C) type 1.
(D) type 3.


Q. In order to build a MOD - 18 counter, the minimum number of flip flops needed is equal to :
(A)18
(B) 5
(C) 9
(D) 4


Q.Amongst the logic families DTL, TTL, ECL and CMOS, the family with the least power dissipation is :  
(A) CMOS
(B) DTL   
(C) TTL
(D) ECL


Q. Which of the following is not true in C++ ?
(A) “Private” elements of a base class are not accessible by members of its derived class.
(B)“Protected” elements of base class are not accessible by members of its derived class. 
(C) When base class access specified is “Public”, public elements of the base class become public members of its derived class.  
(D) When base class access specified is “Public”, protected elements of a base class become protected   members of its derived class. 


Q. A primary key for an entity is :
(A) a candidate key
(B) any attribute
(C) a unique attribute
(D) a superkey


Q. Which of the following is true of constructor function in C++ ?
(A) A class must have at least one constructor.
(B) A constructor is a unique function which cannot be overloaded.
(C) A constructor function must be invoked with the object name.
(D) A constructor function is automatically invoked when an object is created.


Q. Aggregate functions in SQL are :
(A) GREATEST, LEAST and ABS
(B) SUM, COUNT and AVG
(C) UPPER, LOWER and LENGTH
(D) SQRT, POWER and MOD


Q.If a relation is in 2NF and 3NF forms then :
(A)  no non-prime attribute is functionally dependent on other non-prime attributes
(B)  no non-prime attribute is functionally dependent on prime attributes
(C) all attributes are functionally independent
(D) prime attribute is functionally independent of all non-prime attributes


Q.The end of an SQL command is denoted by :
(A) an end-of-line character
(B) an ‘enter-key’ marker
(C) entering F4 key
(D) a semicolon (;)


Q. The aging algorithm with a = 0.5 is used to predict run times. The previous four runs from oldest to most recent are 40, 20, 20, and 15 msec. The prediction for the next time will be :
(A)15 msec.
(B)25 msec.
(C)39 msec.
(D)40 msec.


Q. A major defect in water fall model in software development is that :
(A)the documentation is difficult
(B)a blunder at any stage can be disastrous
(C)a trial version is available only at the end of the project
(D)the maintenance of the software is difficult


Q.Function point metric of a software also depends on the :
(A)number of function needed
(B)number of final users of the software
(C)number of external inputs and outputs
(D)time required for one set of output from a set of input data



Q.An error message produced by an interactive system should have :
(A)always the error code
(B)the list of mistakes done by the user displayed
(C)a non-judgmental approach
(D)the past records of the occurrence of the same mistake

Q.System development cost estimation with use-cases is problematic because :
(A)of paucity of examples
(B)the data can be totally incorrect
(C)the expertise and resource available are not used
(D)the problem is being over simplified


Q.The approach to software testing is to design test cases to :
(A)break the software
(B)understand the software
(C)analyse the design of sub processes in the software
(D)analyze the output of the software



Q.Given a parallel algorithm A with computation time t, if parallel algorithm A performs m computational operation, then p processors can execute algorithm A in time given by :
(A)t/p
(B)mt/p
(C)t1(m2t)/p
(D)(m2t)/p


Q.With reference to implementation of different association mining algorithms, identify the correct statement :
(A)The FP growth method was usually better than the best implementation of the a priori algorithm
(B)Apriori algorithm is usually better than CHARM
(C)Apriori algorithm is good when the support required is low
(D)At very low support the number of frequent items becomes less


Q.Consider a typical mobile communication system. If 840 frequencies are available, how many can be used in a given cell ?
(A)140
(B)120
(C)84
(D)60


Q.Identify the incorrect statement :
(A)The internet has evolved into phenomenally successful e-commerce engine
(B)e-business is synonymous with e-commerce
(C)The e-commerce model B2C did not begin with billboardware
(D)The e-commerce model G2C began with billboardware


Q. Identify the incorrect statement :
(A)ATM provides both real time and non-real time service
(B)ATM provides faster packet switching than X.25
(C)ATM was developed as part of the work on broadband ISDN
(D)ATM does not have application in Non-ISDN environments where very high data rates are required



See More Questions >>

Thursday, July 28, 2011

HSST Computer Science Data Structure Questions Published

1. Two main measures for the efficiency of an algorithm are
a. Processor and memory
b. Complexity and capacity
c. Time and space
d. Data and space

2. The time factor when determining the efficiency of algorithm is measured by
a. Counting microseconds
b. Counting the number of key operations
c. Counting the number of statements
d. Counting the kilobytes of algorithm

3. The space factor when determining the efficiency of algorithm is measured by
a. Counting the maximum memory needed by the algorithm
b. Counting the minimum memory needed by the algorithm
c. Counting the average memory needed by the algorithm
d. Counting the maximum disk space needed by the algorithm


4. Which of the following case does not exist in complexity theory
a. Best case
b. Worst case
c. Average case
d. Null case


5. The Worst case occur in linear search algorithm when
a. Item is somewhere in the middle of the array
b. Item is not in the array at all
c. Item is the last element in the array
d. Item is the last element in the array or is not there at all


6. The Average case occur in linear search algorithm
a. When Item is somewhere in the middle of the array
b. When Item is not in the array at all
c. When Item is the last element in the array
d. When Item is the last element in the array or is not there at all


7. The complexity of the average case of an algorithm is
a. Much more complicated to analyze than that of worst case
b. Much more simpler to analyze than that of worst case
c. Sometimes more complicated and some other times simpler than that of worst case
d. None or above


8. The complexity of linear search algorithm is
a. O(n)
b. O(log n)
c. O(n2)
d. O(n log n)


9. The complexity of Binary search algorithm is
a. O(n)
b. O(log )
c. O(n2)
d. O(n log n)


10. The complexity of Bubble sort algorithm is
a. O(n)
b. O(log n)
c. O(n2)
d. O(n log n)


11. The complexity of merge sort algorithm is
a. O(n)
b. O(log n)
c. O(n2)
d. O(n log n)


12. The indirect change of the values of a variable in one module by another module is called
a. internal change
b. inter-module change
c. side effect
d. side-module update


13. Which of the following data structure is not linear data structure?
a. Arrays
b. Linked lists
c. Both of above
d. None of above


14. Which of the following data structure is linear data structure?
a. Trees
b. Graphs
c. Arrays
d. None of above


15. The operation of processing each element in the list is known as
a. Sorting
b. Merging
c. Inserting
d. Traversal


16. Finding the location of the element with a given value is:
a. Traversal
b. Search
c. Sort
d. None of above


17. Arrays are best data structures
a. for relatively permanent collections of data
b. for the size of the structure and the data in the structure are constantly changing
c. for both of above situation
d. for none of above situation


18. Linked lists are best suited
a. for relatively permanent collections of data
b. for the size of the structure and the data in the structure are constantly changing
c. for both of above situation
d. for none of above situation


19. Each array declaration need not give, implicitly or explicitly, the information about
a. the name of array
b. the data type of array
c. the first data from the set to be stored
d. the index set of the array


20. The elements of an array are stored successively in memory cells because
a. by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated
b. the architecture of computer memory does not allow arrays to store other than serially
c. both of above
d. none of above

Solved Questions >> 

Computer Science Questions Previously asked by PSC

Q. The statements char c[ ] = " there!"; putchar(c); will result in printing: 
(A) There
(B) there.
(C) there!
(D) "there!"


Q. Total number of nodes in a 3-stage ternary tree will be : 
(A) 12
(B) 5
(C) 13
(D) 15

Q. The power ratio of 1 in dBs will be : 
(A) 10
(C) 1
(B) 0
(D) 100

Q. The units for telephone traffic is : 
(A) Erlangs
(B) Poissons
(C) Bells
(D) N one of the above

Q.   The number of full adders needed to implement one bit serial adder is :  
(A)   2  
(B)   4  
(C)   8  
(D)   1  

Q.   The supply voltage of ECL gates is :      
 (A)   -5.2V   (B)   +5.2V  
 (C)   -3.3V   (D)   +1.5V  

Q.   Which of the following is not a standard size of floppy diskettes?   
(A)   5.25 in  
(B)   10 in  
(C)   3.5 in  
(D)   8 in  

Q.   The Moore's law is applicable to :      
(A)   Automobile industry  
(B)  Computer industry  
(C)   Cement industry  
(D)   Semiconductor industry
 
Q.   DVD stands for:       
(A)   Digi tal Video Disc  
(B)   Digital Vital Disc  
(C)   Digital Versatile Disc  
(D)   N one of the above  

C and C++ Questions >>

Wednesday, July 27, 2011

Possible Questions from Computer Concepts

Q. "STORED PROGRAM CONCEPT " Postulated By
a. Richard Stalman
b. Henry Dunant
c. Pascal
d. John von neumann

Q? : Founder of the social networking website 'Facebook' 
a. Mark Elliot Zuckerberg
b. Henry Dunant
c. Pascal
d. John von neumann

9. Special programs which wrote for understanding the operation of the device it interfaces to, such as a printer, video card, sound card or CD ROM drive. 
(a) Operating System 
(b) Software 
(c) Firmware 
(d) Driver


Q? Name associated with Open Source Program 
a. Pascal
b. Henry Dunant
c. Richard Stalman
d. John von neumann

Q? An internet protocol that allows quick file tarns-mission to remote computers is know as: 
(a) HTTP 
(b) FI'P 
(c) TCP/IP 
(d) ISP


Q. Protocol used to temporarily store new messages in your mailbox on an e-mail server is known as: 
(a) POP 
(b) SMTP
(c) TCP/IP 
(d) FTP 

Q. Company which maintains internet computers and telecommunications equipment in order to provide internet access to businesses, organisaations and individuals is called: 
(a) Internet Service Agency 
(b) ICAAN 
(c) Internet Service Provider 
(d) Web Hosting 

Q.The device that protects all computers in the net-work from many attacks is called: 
(a) Router 
(b) Access Point 
(c) Anti Virus Software 
(d) Firewall 



Q. Free telephone-style conversations to travel over the internet to virtually anywhere in the world is known as: 
(a) Teleconference 
(b) Videoconference 
(c) Internet Telephony 
(d) Internet broadcasting


Q. The main routes that data travels over the interrnet is called: 
(a) Internet backbone 
(b) Firewall 
(c) Internet Router 
(d) Silicon Valley 

Q.An IT term refers to allowing someone to open web pages and see web sites on the internet. 
(a) Hacking 
(b) Cracking 
(c) Web Caching 
(d) Web Surfing


Q. 1,024 gigabytes is equal to: 
(a) 1 kilobytes 
(b) 1 megabyte 
(c) 1 yottabyte 
(d) 1 terabyte 

Q. This type of memory would not lose its data when the computer lost power thus ensuring BIOS programs would always be available. What type of memory is referring here? 
(a) ROM 
(b) RAM 
(c) Primary Memory 
(d) Secondary Memory

Monday, July 25, 2011

Questions asked in HSST Junior Exam - 2006

Which among the following is an interior routing protocol?
A) OSPF
B) EGP
C) BGP
D) NNTP

The maximum length ( in bytes ) of an IP packet

A) 255
B) 1023
C)32767
D) 65535

Which among the following is not a type of HTTP request ?
A) GET
B) HEAD
C) RELEASE
D) POST

The degree of multiprogramming is controlled primarily by :
A) Short-term scheduler
B) Medium-term scheduler
C) Long-term scheduler
D) Disk Scheduler

Which of the following is a high-level synchronization concept?

A) Interrupt
B) Semaphore
C) Mutex
D) Monitor

Paging solves the problem of :
A) Thrashing
B) Page faults
C) Internal fragmentation
D) External fragmentation

Yacc is a :
A) Lexical analyzer generator
B) Parser generator
C) Macro preprocessor
D) Code optimizer

The BSD version of Unix was developed by :
A) Bell Labs
B) MIT
C) University of Berkeley
D) Sun Microsystems

_____ uses an FAT for file allocation
A) OS/2
B) Linux
C) Unix
D) Solaris

Which of the following cannot be blank ( null ) ?

A) Foreign key
B) Secondary key
C) Primary key
D) Connecting key

Saturday, July 23, 2011

HSST Computer Science Syllabi - Page 2

6.     Data Communication and Computer Networks
Data Communication : Analog and Digital transmission. Asynchronous and Synchronous
transmission. Transmission media. Multiplexing and Concentration, Switching techniques.
Polling. Channel capacity.  Transmission media - twisted pair, coaxial cables, fibre-optic
cables, wireless transmission- radio, microwave and infrared waves. Light wave
transmission. Telephones - local loop, trunks, multiplexing, switching, narrowband ISDN,
broadband ISDN. ATM, High speed LANs. Cellular Radio, Communication satellitesgeosynchronous and low-orbit.
Reference Models : The OSI model,  TCP/I P model.
Topologies, Networking Devices. Protocols for - ( i) Data link layer (ii) Network layer, and
(iii) Transport layer, TCP/I P protocols, Networks security, Network administration.
Local Area Networks (LAN), Metropolitan Area Networks (MAN), Wide Area Networks
(WAN). Wireless Networks, Inter Networks.
Internetworking : Switch/Hub. Bridge. Router. Gateways. Concentrated virtual circuits.
Tunnelling, Fragmentation. Firewalls.Routing : Virtual circuits and datagrams. Routing Algorithms. Congestion control.
Network Security : Cryptography - public key, secret key, Domain Name System (DNS) - Electronic
Mail and World Wide Web {WWW). The DNS, Resource Records. Name servers. E-mail
architecture and E-mail Servers.
7.   System software and Compilers.
Assembly language fundamentals (8085 and 8088 based assembly language programming).
Assemblers - 2-pass and single-pass.  Macros and  macro processors.
Loading, linking, relocation, program  relocatability.  Linkage editing.
Text editors, Programming  Environments. Debuggers and program generators.
Compilation and Interpretation. Bootstrapping. Phases of compilation. Lexical analysis. LEX.
Context free grammars. Parsing and parse trees. Representation of parse trees and rightmost and
leftmost derivations, Bottom up parsers - shift-reduce. operator precedence and LR. YACC.
Top down parsers - left recursion and its removal. Recursive descent parser. Predictive parser.
Intermediate codes - Quadruples,  Triples. Indirect Triples. Intermediate code generation, Code
generation, Code optimization.

 8.     Operating Systems
Main functions of operating systems. Multiprogramming, multiprocessing and multitasking.
Memory management ; Virtual memory, paging, fragmentation.
Concurrent processing : Mutual exclusion. Critical regions, lock and unlock.
Scheduling : CPU scheduling. I /O Scheduling. Resource scheduling. Deadlock and scheduling
algorithms. Banker's algorithm for deadlock handling.
The Unix system  :  File system, process management. Bourne shell, shell  variables, command line
programming.
Systems Calls :  Creat, open, close, read,  write. Iseek, link, unlink, stat, fstat, umask, chmod, exec,
fork, wait, system.



Next Page >>

HSST Computer Science Syllabi - Page 3

9.   Software  Engineering
System Development Life Cycle (SDLC) : Steps, Water fall model. Prototypes, Spiral model.
Software Metrics ; Software Project Management.
Software Design : System design. detailed design. function oriented design, object-oriented design,
user interface design. Design level metrics.
Coding and Testing : Testing level metrics. Software quality and reliability. Clean room approach,
software engineering.

10.     Computer Graphics
Display systems. Input devices, 2D Geometry - .Algorithms for drawing primitives, clipping and
windowing, windows, view ports, Graphic operations for transformations , 3D Graphics. Animation,
Graphics standard. Applications.
Storage Devices, Input Tools. Authoring Tools, Application, Files.

11.  Programming Language Theory
Programming language concepts, paradigms, models.
Data. Data types, Operators, Expressions. Assignment. Flow of Control - Control structures, I/O
structures. I/O statements, User-Defined and built- in functions. Parameter passing.
Principles, classes, inheritance, class hierarchies, polymorphism, dynamic binding, reference
semantics and their implementation.
Principles, functions, lists, types and polymorphism, higher order functions, lazy evaluation,
equations and pattern matching.
Principles, horn clauses and their execution, logical variables, relations, data structures, controlling
the search order, program development in Prolog, implementation of Prolog, example programs in
Prolog.

12.  Current Trends and Technologies
The topics of current interest in Computer Science and Computer Applications shall be covered. The
experts shall use their judgement from time to time to include the topics of popular interest which are
expected to be known by an ardent follower of the field. Currently, they include :
Parallel computing
Parallel virtual Machine (PVM) and message passing interface (MPI) libraries and calls. Advanced
architectures. Today's fastest computersMobile Computing
Mobile connectivity - Cells. Framework, wireless delivery technology and switching methods, mobile
information access devices, mobile data internetworking standards, cellular data communication
protocols, mobile computing applications. Mobile databases - protocols, scope, tools and technology.
E-Technologies

Electronic Commerce : Framework, Media convergence of Applications, Consumer Applications,
Organisation applications.
Electronic Payment Systems : Digital Token, Smart Cards, Credit Cards. Risks in Electronic Payment
System, Designing Electronic Payment Systems.
Electronic Data Interchange (EDI) : Concepts, Applications, (Legal, Security and Privacy) issues.
EDI and Electronic Commerce. Standardisation and EDI. EDI Software Implementation. EDI
Envelope for Message Transport, internet-based EDI.
Data Warehousing : Data Warehouse environment, architecture of a data warehouse methodology,
analysis, design, construction and administration.
Data Mining : Extracting models and patterns from large databases, data mining techniques,
classification, regression, clustering, summarization, dependency modelling, link analysis,
sequencing analysis, mining scientific and business data.
Principles of parallelism, co routines, communication and execution, Parallel Virtual Machine (PVM)
and Message Passing Interface (MPI) routines and calls. Parallel programs in PVM paradigm as well
as MPl paradigm for simple problems like matrix multiplication.

Courtesy : Official Website of Kerala PSC