一亩三分地论坛

 找回密码
 获取更多干货,去instant注册!

扫码关注一亩三分地公众号
查看: 716|回复: 8
收起左侧

liveRamp OA 题。。。

[复制链接] |试试Instant~ |关注本帖
kiviljc 发表于 2015-1-18 22:25:15 | 显示全部楼层 |阅读模式

2015(1-3月) 码农类 硕士 全职@liveRamp - 网上海投 - 在线笔试 |Pass

注册一亩三分地论坛,查看更多干货!

您需要 登录 才可以下载或查看,没有帐号?获取更多干货,去instant注册!

x
有的同学发的帖的东西无法下载,,小弟直接帖出来。。。求米!!!!!!!
希望各位以后发帖不要加权限之类的。。这样很蛋疼,,,. 1point3acres.com/bbs

评分

3

查看全部评分

 楼主| kiviljc 发表于 2015-1-18 22:25:38 | 显示全部楼层
•        MDB 2.0 - Movie DB Table Structure
Your best friend Betty thinks IMDB is too complicated and challenges you to create a simple movie web site. One page will display movies (with movie name, date it was released, and list of actors). Click on an actor and you're taken to the actor page (with actor name, birthday, bio, and list of movies actor has been in). Please outline the relational table structure of the database for this.   View Answers (3). 鐗涗汉浜戦泦,涓浜╀笁鍒嗗湴
•        Six Degrees of Turkey Bacon
You've always been intrigued with the Six Degrees of Kevin Bacon game. Let's say if two actors have been in the same movie we call them 'friends' and if two actors have not been in the same movie, we say they are not 'friends'. Now choose any two actors at random -- we want to calculate the number of degrees of separation and the path between them. How do you go about this problem?
• Discuss your algorithm ideas. For each algorithm talk about the tradeoffs.
• Choose which method you think is best for solving this problem and describe how it works. You may also want to talk about what data structures you would use to implement it.   View Answer
•        The Max
Bubble sort is O(n) at best, O(n^2) at worst, and its memory usage is O(1) . Merge sort is always O(n log n), but its memory usage is O(n). Explain which algorithm you would use to implement a function that takes an array of integers and returns the max integer in the collection, assuming that the length of the array is less than 1000. What if the array length is greater than 1000?   View Answers (2)
•        An Activity to Further Your Gambling Addiction
If you roll 5 standard six-sided dice, what's the probability that you get at least three 2s?
. 鐣欏鐢宠璁哄潧-涓浜╀笁鍒嗗湴
Also: you are offered the following bet: we pay you $1000 if you roll at least three 2s but you have to pay LiveRamp $200 if you don't. Would you take the bet? Why or why not?   View Answers (2)
•        Why LiveRamp? 鏉ユ簮涓浜.涓夊垎鍦拌鍧.
We’re excited that you’re interested in a position here at LiveRamp. How did you hear about us and why are you interested in working at LiveRamp in particular? What about LiveRamp excites you? Please limit yourself to 1-2 paragraphs.   Answer Question




.鐣欏璁哄潧-涓浜-涓夊垎鍦
Bubble sort is O(n) at best, O(n^2) at worst, and its memory usage is O(1) . Merge sort is always O(n log n), but its memory usage is O(n). Explain which algorithm you would use to implement a function that takes an array of integers and returns the max integer in the collection, assuming that the length of the array is less than 1000. What if the array length is greater than 1000?.鏈枃鍘熷垱鑷1point3acres璁哄潧

2)You've always been intrigued with the Six Degrees of Kevin Bacon game. Now, let's say if two actors have been in the same movie we call them 'friends' and if two actors have not been in the same movie, we say they are not 'friends'. Now choose any two actors at random -- we want to calculate the number of degrees of separation and the path between them. How do you go about this problem? Discuss ideas, trade-offs, algorithm ideas, and more.

3)Your best friend Betty thinks IMDB is too complicated and challenges you to create a simple movie web site. One page will display movies (with movie name, date it was released, and list of actors). Click on an actor and you're taken to the actor page (with actor name, birthday, bio, and list of movies actor has been in). Please outline the relational table structure of the database for this.. Waral 鍗氬鏈夋洿澶氭枃绔,
create table Movie(Name varchchar, Date date, primary key ID identifying);
create table Actor (Name varchar, birtday date, bio varchar, primary key ID identifying);
create table MovieActor(MovieID integer references Movie, ActorID integer references Actor ) Primary key (MovieID , ActorID);
鏉ユ簮涓浜.涓夊垎鍦拌鍧.
4)If you roll 5 standard six-sided dice, what's the probability that you get at least three 2s?

评分

1

查看全部评分

回复 支持 反对

使用道具 举报

dahao 发表于 2015-2-5 09:31:06 | 显示全部楼层
楼主知不知道,每人题目是不是随机的。。。
回复 支持 反对

使用道具 举报

哆啦嗦 发表于 2015-2-12 15:16:46 | 显示全部楼层
正需要这个!楼主太赞了!!!
回复 支持 反对

使用道具 举报

哆啦嗦 发表于 2015-2-12 15:17:33 | 显示全部楼层
正需要这个!楼主太赞了!!!
回复 支持 反对

使用道具 举报

 楼主| kiviljc 发表于 2015-2-12 21:50:08 | 显示全部楼层
哆啦嗦 发表于 2015-2-12 15:17
正需要这个!楼主太赞了!!!

恩恩,,,求加米,,呵呵。
回复 支持 反对

使用道具 举报

liokumo 发表于 2015-2-13 00:56:40 | 显示全部楼层
我之前做了这个,楼主发的是几年前贴在glassdoor上的。
我大概一个月之前做的时候,前面大概7,8道题是选择题,大部分是时间复杂度的问题-google 1point3acres
之后就是Six Degrees of Turkey Bacon
还有Why LiveRamp?
这个公司我做题之前看过,glassdoor上将近200人做题没一个人得offer,这个公司好像根本不招人。
但是在我做完题之后又上glassdoor上看,突然发现有两个被录取的发了录取心得,但是发表时间非常接近,感觉就是为了广告效应发的
回复 支持 反对

使用道具 举报

jiebour 发表于 2015-2-13 01:25:13 | 显示全部楼层
想问下,找个最大数为什么要排序啊?
•        The Max
Bubble sort is O(n) at best, O(n^2) at worst, and its memory usage is O(1) . Merge sort is always O(n log n), but its memory usage is O(n). Explain which algorithm you would use to implement a function that takes an array of integers and returns the max integer in the collection, assuming that the length of the array is less than 1000. What if the array length is greater than 1000?
回复 支持 反对

使用道具 举报

哆啦嗦 发表于 2015-2-13 06:29:48 | 显示全部楼层
liokumo 发表于 2015-2-13 00:56
我之前做了这个,楼主发的是几年前贴在glassdoor上的。
我大概一个月之前做的时候,前面大概7,8道题是选 ...

是的~这个公司貌似是假装在招人。。。扩大他家知名度么?
还是bar 实在实在太高了,
回复 支持 反对

使用道具 举报

本版积分规则

请点这里访问我们的新网站:一亩三分地Instant.

Instant搜索更强大,不扣积分,内容组织的更好更整洁!目前仍在beta版本,努力完善中!反馈请点这里

关闭

一亩三分地推荐上一条 /5 下一条

手机版|小黑屋|一亩三分地论坛声明 ( 沪ICP备11015994号 )

custom counter

GMT+8, 2016-12-8 08:22

Powered by Discuz! X3

© 2001-2013 Comsenz Inc. Design By HUXTeam

快速回复 返回顶部 返回列表