Username: Save?
Password:
Home Forum Links Search Login Register*
    News: Welcome to the TechnoWorldInc! Community!
Recent Updates
[March 06, 2024, 02:45:27 PM]

[March 06, 2024, 02:45:27 PM]

[March 06, 2024, 02:45:27 PM]

[March 06, 2024, 02:45:27 PM]

[February 14, 2024, 02:00:39 PM]

[February 14, 2024, 02:00:39 PM]

[February 14, 2024, 02:00:39 PM]

[February 14, 2024, 02:00:39 PM]

[February 08, 2024, 10:26:18 AM]

[February 08, 2024, 10:26:18 AM]

[February 08, 2024, 10:26:18 AM]

[February 08, 2024, 10:26:18 AM]

[November 27, 2023, 06:32:12 PM]
Subscriptions
Get Latest Tech Updates For Free!
Resources
   Travelikers
   Funistan
   PrettyGalz
   Techlap
   FreeThemes
   Videsta
   Glamistan
   BachatMela
   GlamGalz
   Techzug
   Vidsage
   Funzug
   WorldHostInc
   Funfani
   FilmyMama
   Uploaded.Tech
   MegaPixelShop
   Netens
   Funotic
   FreeJobsInc
   FilesPark
Participate in the fastest growing Technical Encyclopedia! This website is 100% Free. Please register or login using the login box above if you have already registered. You will need to be logged in to reply, make new topics and to access all the areas. Registration is free! Click Here To Register.
+ Techno World Inc - The Best Technical Encyclopedia Online! » Forum » THE TECHNO CLUB [ TECHNOWORLDINC.COM ] » Career/ Jobs Zone » Placement Papers » FutureSoft
 Aptitude + Technical
Pages: [1]   Go Down
  Print  
Author Topic: Aptitude + Technical  (Read 2629 times)
Tanya
TWI Addict
********



Karma: 1
Offline Offline

Posts: 4190


View Profile
Aptitude + Technical
« Posted: June 06, 2007, 12:02:37 AM »


Aptitude + Technical


FUTURESOFT QUESTIONs conducted at SHREDS(COCHIN) on 24-8-2003::
            40 min - 30 Questions
            Correct ans 3 marks
            Wrong ans -1 mark

      There were 3 or 4 different sets of questions......

        This is my version of questions( this is based on only a
vague memory of mine and i would request any of the members who
attended the test and who remember,  to contribute any correction or
improvisation to the questions)


1.) S --> AB|AS
    A --> a|aA
    B --> b

What is the grammar accepted by the above?

Ans-> aa*b

2.)Given a string STOCK and a stack of size 4.
      Which of the following strings cannot  be generated using this
stack.

(a) TSOCK
(b) TOSKC
(c) STOCK
(d) TKOSC
(e) None of these

3.)Where are the following variables stored
Automatic
Global
Static

(a)Heap,Stack,Heap
(b)Stack,Heap,Heap
(c)Heap,Heap,Stack
(d)None of these

Ans-> (d)

4.) What is the greatest disadvantage of dynamic RAM over static RAM

Ans. capacitor  needs to refresh every 2 ms.

5.) What happens when the CPU gets interrupted?

(a)Performs ISR immediately
(b)releases the memory and data bus for the interrupting process
(c)Finishes the current instruction and performs ISR
(d)gets halted

6.) The s/n id 3 dB and freq is 300hz.Find the capacity of the line.
(a)100
(b)150
(c)300
(d)200
(e) None of these

7.) How much infomation can be stored between fffh-f00h address space.
(a)1024 bytes
(b)2048 bytes
(c)4096 bytes
(d)None of these

Ans->(d)

8.)
void main()
{
int ari = {1,2,3,4,5};
char arc = {'a','b','c','d','e'};
printf("%d %d",&ari[4]-&ari[2],&arc[3]-&arc[0]);
}

Ans -> 2 3

9.)  Find the POS form of the expression given below
_ _ _
X.Y.Z + X.Y.Z + X.( Y + Z )

10.) The binary  equivalent of 3B7F is

Ans. 0011 1011 0111 1111

11.) A microprogram can be defines as to consist of

Ans. A primitive operation

12.) A drum rotates at 4000 rpm. What is its average access time.

13.) What range of  integral values can be stored using 32 bits?

14.) e=<e+e> | <e*e> | <(e-e)> | <id> then
(a.)   It is ambigous
  (b.) generates all the arithemetic expressions for addition,
subtraction and multiplication
(c) It is non inherently ambigous
(d) None of the above

15.)  the sorting algorithm that requires maximum comparisons when in
sorted order and minimum comparisons when in reverse order?

(a.) straight insertion sort
(b.) binary insertion sort
(c.) heap sort
(d.) bubble sort

16.) A graph is represented as an adjacency list with n vertices and
e edges
      What is its time complexity

17.) A variable in a function cannot be accessed outside the
function, why? (think the question is like this)
(a.) garbage collection
(b.) because it exists in swap area of memory
(c.)it  gets popped out of the stack


18.)How many addresses are possible with 512 64kb segments?

19.) A question on pages and pagetables, i think to find the wrong
statement of the given
  (a.) small pages implies large page tables
  (b.) larger pages implies i/o operations efficiency
  (don't remember the rest of the options, though  the answer lies
there)

20.) A reference string was given and using LRU page replacement
algorithm we were asked to find the state of the memory during 3rd
page fault, the memory size being 3 pages.....

21.) A finite automaton was given and we were asked to find the
expression that represented the language that could be accepted by
the finite automaton

22.) There was a question on networks given a set of data like
    5 byte header for network layer and maximum data allowed 110 bytes
     similar data for 2 other layers
     question was to find the actual number of bytes send if the data
size was --------bytes under conditions like no separate
acknowledgement frames required, etc.....

23.) there was a program given on an array of unsigned integers and i
think the answer was that the program was to find the largest and
second largest of the elements in an array.

24.) John and Jacob are assigned the tasks of writing main() and a
function funct(X,Y )in Pascal. Where will there be conflicts between
the two?
(a.) the position of main and function
(b.) the type of function
(c.)  the number of times the function is called
(d.) in the paramters
  (i'm not sure abt the options)

25.)there was question on why  h/w translation was required for
memory relocation? (pretty easy one, don't remember the options)

26.) to find the prefix of (a+b)*(c-d)

27.)
#include<stdio.h>
void main()
{int i,x=4,sum=0;
int arr[6]=[1,2,3,4,5,6]
for (i=0;i<4;i++)
sum+ = func(arr);
printf("%d", sum);
}

func(int x)
{ int val,x;
val = 2;
return(x+ val++);
}
(there was another twist in the question about a static declaration
in the function, though i cannot recollect) f
28.)With a  2 line x decoder and 2 line y decoder how many address
lines could be decoded with two dimensional addressing?
   (a.) 4
    (b.) 16
   (c.) 32
   (d.) 64

Logged

Pages: [1]   Go Up
  Print  
 
Jump to:  

Copyright © 2006-2023 TechnoWorldInc.com. All Rights Reserved. Privacy Policy | Disclaimer
Page created in 0.081 seconds with 25 queries.